/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:53:07,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:53:07,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:53:07,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:53:07,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:53:07,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:53:07,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:53:07,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:53:07,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:53:07,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:53:07,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:53:07,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:53:07,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:53:07,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:53:07,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:53:07,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:53:07,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:53:07,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:53:07,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:53:07,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:53:07,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:53:07,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:53:07,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:53:07,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:53:07,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:53:07,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:53:07,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:53:07,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:53:07,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:53:07,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:53:07,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:53:07,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:53:07,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:53:07,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:53:07,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:53:07,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:53:07,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:53:07,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:53:07,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:53:07,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:53:07,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:53:07,319 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:53:07,333 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:53:07,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:53:07,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:53:07,335 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:53:07,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:53:07,335 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:53:07,335 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:53:07,335 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:53:07,336 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:53:07,336 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:53:07,336 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:53:07,336 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:53:07,336 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:53:07,336 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:53:07,337 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:53:07,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:53:07,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:53:07,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:53:07,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:53:07,338 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:53:07,338 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:53:07,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:53:07,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:53:07,338 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:53:07,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:53:07,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:53:07,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:53:07,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:53:07,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:53:07,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:53:07,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:53:07,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:53:07,524 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:53:07,524 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:53:07,525 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:53:07,623 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_Mftuk1/tmp/267d5cee2c394799bac725acbf32fcc5/FLAGb90294a33 [2020-07-01 12:53:08,141 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:53:08,141 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:53:08,142 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:53:08,148 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_Mftuk1/tmp/267d5cee2c394799bac725acbf32fcc5/FLAGb90294a33 [2020-07-01 12:53:08,546 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_Mftuk1/tmp/267d5cee2c394799bac725acbf32fcc5 [2020-07-01 12:53:08,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:53:08,559 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:53:08,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:53:08,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:53:08,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:53:08,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edfb3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08, skipping insertion in model container [2020-07-01 12:53:08,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:53:08,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:53:08,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:53:08,839 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:53:08,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:53:08,871 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:53:08,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08 WrapperNode [2020-07-01 12:53:08,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:53:08,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:53:08,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:53:08,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:53:08,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:53:08,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:53:08,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:53:08,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:53:08,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... [2020-07-01 12:53:08,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:53:08,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:53:08,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:53:08,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:53:08,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:53:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:53:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:53:09,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:53:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:53:09,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:53:09,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:53:09,314 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:53:09,314 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-01 12:53:09,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:53:09 BoogieIcfgContainer [2020-07-01 12:53:09,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:53:09,319 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:53:09,319 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:53:09,321 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:53:09,322 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:53:09" (1/1) ... [2020-07-01 12:53:09,338 INFO L313 BlockEncoder]: Initial Icfg 55 locations, 58 edges [2020-07-01 12:53:09,340 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:53:09,340 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:53:09,341 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:53:09,341 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:53:09,346 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:53:09,347 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:53:09,347 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:53:09,374 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:53:09,410 INFO L200 BlockEncoder]: SBE split 29 edges [2020-07-01 12:53:09,415 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:53:09,417 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:53:09,453 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 12:53:09,456 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:53:09,457 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:53:09,457 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:53:09,458 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:53:09,458 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:53:09,459 INFO L313 BlockEncoder]: Encoded RCFG 46 locations, 82 edges [2020-07-01 12:53:09,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:53:09 BasicIcfg [2020-07-01 12:53:09,460 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:53:09,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:53:09,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:53:09,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:53:09,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:53:08" (1/4) ... [2020-07-01 12:53:09,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@807cdd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:53:09, skipping insertion in model container [2020-07-01 12:53:09,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (2/4) ... [2020-07-01 12:53:09,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@807cdd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:53:09, skipping insertion in model container [2020-07-01 12:53:09,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:53:09" (3/4) ... [2020-07-01 12:53:09,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@807cdd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:53:09, skipping insertion in model container [2020-07-01 12:53:09,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:53:09" (4/4) ... [2020-07-01 12:53:09,469 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:53:09,479 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:53:09,487 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 12:53:09,501 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 12:53:09,525 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:53:09,525 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:53:09,525 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:53:09,525 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:53:09,525 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:53:09,526 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:53:09,526 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:53:09,526 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:53:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-07-01 12:53:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:53:09,548 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:09,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:53:09,549 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:09,555 INFO L82 PathProgramCache]: Analyzing trace with hash 121634, now seen corresponding path program 1 times [2020-07-01 12:53:09,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:09,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578608929] [2020-07-01 12:53:09,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:09,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578608929] [2020-07-01 12:53:09,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:09,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:09,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341368445] [2020-07-01 12:53:09,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:09,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:09,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:09,745 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 12:53:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:09,908 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2020-07-01 12:53:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:09,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:53:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:09,922 INFO L225 Difference]: With dead ends: 90 [2020-07-01 12:53:09,922 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 12:53:09,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 12:53:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 12:53:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 12:53:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2020-07-01 12:53:09,966 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 75 transitions. Word has length 3 [2020-07-01 12:53:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:09,967 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 75 transitions. [2020-07-01 12:53:09,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 75 transitions. [2020-07-01 12:53:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:53:09,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:09,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:53:09,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:53:09,969 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:09,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:09,970 INFO L82 PathProgramCache]: Analyzing trace with hash 121727, now seen corresponding path program 1 times [2020-07-01 12:53:09,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:09,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848080522] [2020-07-01 12:53:09,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:10,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848080522] [2020-07-01 12:53:10,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:10,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:10,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389046581] [2020-07-01 12:53:10,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:10,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:10,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:10,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,021 INFO L87 Difference]: Start difference. First operand 46 states and 75 transitions. Second operand 3 states. [2020-07-01 12:53:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:10,149 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-07-01 12:53:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:10,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:53:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:10,151 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:53:10,152 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:53:10,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:53:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:53:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:53:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-07-01 12:53:10,159 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 3 [2020-07-01 12:53:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:10,159 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-07-01 12:53:10,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-07-01 12:53:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:53:10,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:10,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:53:10,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:53:10,160 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash 121728, now seen corresponding path program 1 times [2020-07-01 12:53:10,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661208541] [2020-07-01 12:53:10,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:10,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661208541] [2020-07-01 12:53:10,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:10,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:10,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989429486] [2020-07-01 12:53:10,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:10,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:10,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,190 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 3 states. [2020-07-01 12:53:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:10,262 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2020-07-01 12:53:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:10,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:53:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:10,264 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:53:10,264 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:53:10,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:53:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:53:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:53:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2020-07-01 12:53:10,270 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 3 [2020-07-01 12:53:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:10,270 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2020-07-01 12:53:10,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2020-07-01 12:53:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:53:10,271 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:10,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:53:10,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:53:10,271 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,272 INFO L82 PathProgramCache]: Analyzing trace with hash 121729, now seen corresponding path program 1 times [2020-07-01 12:53:10,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003020150] [2020-07-01 12:53:10,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:10,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003020150] [2020-07-01 12:53:10,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:10,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:10,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709153522] [2020-07-01 12:53:10,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:10,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:10,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,308 INFO L87 Difference]: Start difference. First operand 40 states and 57 transitions. Second operand 3 states. [2020-07-01 12:53:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:10,420 INFO L93 Difference]: Finished difference Result 40 states and 57 transitions. [2020-07-01 12:53:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:10,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:53:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:10,421 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:53:10,421 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:53:10,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:53:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:53:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:53:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2020-07-01 12:53:10,426 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 3 [2020-07-01 12:53:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:10,427 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2020-07-01 12:53:10,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2020-07-01 12:53:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:53:10,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:10,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:53:10,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:53:10,428 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:10,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,428 INFO L82 PathProgramCache]: Analyzing trace with hash 3770833, now seen corresponding path program 1 times [2020-07-01 12:53:10,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200537460] [2020-07-01 12:53:10,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:10,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200537460] [2020-07-01 12:53:10,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:10,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:10,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027239763] [2020-07-01 12:53:10,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:10,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:10,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:10,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,480 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 3 states. [2020-07-01 12:53:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:10,571 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2020-07-01 12:53:10,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:10,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:53:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:10,573 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:53:10,573 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:53:10,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:53:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:53:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:53:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-07-01 12:53:10,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 4 [2020-07-01 12:53:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:10,578 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-07-01 12:53:10,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2020-07-01 12:53:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:53:10,579 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:10,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:53:10,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:53:10,579 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash 3770835, now seen corresponding path program 1 times [2020-07-01 12:53:10,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16094461] [2020-07-01 12:53:10,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:10,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16094461] [2020-07-01 12:53:10,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:10,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:10,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943746898] [2020-07-01 12:53:10,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:10,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:10,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:10,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,620 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 3 states. [2020-07-01 12:53:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:10,682 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2020-07-01 12:53:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:10,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:53:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:10,683 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:53:10,683 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:53:10,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:53:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:53:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:53:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-07-01 12:53:10,687 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 4 [2020-07-01 12:53:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:10,688 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-01 12:53:10,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-07-01 12:53:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:53:10,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:10,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:53:10,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:53:10,689 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:10,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,689 INFO L82 PathProgramCache]: Analyzing trace with hash 664887618, now seen corresponding path program 1 times [2020-07-01 12:53:10,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497288776] [2020-07-01 12:53:10,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:10,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497288776] [2020-07-01 12:53:10,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:10,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:53:10,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717516744] [2020-07-01 12:53:10,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:53:10,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:10,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:53:10,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:53:10,728 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 4 states. [2020-07-01 12:53:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:10,826 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2020-07-01 12:53:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:53:10,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:53:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:10,827 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:53:10,827 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:53:10,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:53:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:53:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-01 12:53:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:53:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-07-01 12:53:10,832 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 7 [2020-07-01 12:53:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:10,833 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-01 12:53:10,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:53:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-07-01 12:53:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:53:10,834 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:10,834 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:53:10,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:53:10,834 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:10,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash -996115593, now seen corresponding path program 1 times [2020-07-01 12:53:10,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:10,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835513484] [2020-07-01 12:53:10,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:11,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835513484] [2020-07-01 12:53:11,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240085886] [2020-07-01 12:53:11,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:53:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:11,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 12:53:11,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:53:11,161 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2020-07-01 12:53:11,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2020-07-01 12:53:11,162 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:53:11,170 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:53:11,171 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:53:11,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2020-07-01 12:53:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:53:11,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:53:11,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2020-07-01 12:53:11,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882345148] [2020-07-01 12:53:11,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:11,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:11,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:11,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:53:11,199 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 3 states. [2020-07-01 12:53:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:11,245 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-07-01 12:53:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:11,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-01 12:53:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:11,247 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:53:11,247 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:53:11,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:53:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:53:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:53:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:53:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-07-01 12:53:11,251 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 13 [2020-07-01 12:53:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:11,251 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 12:53:11,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-01 12:53:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:53:11,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:11,252 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:53:11,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-01 12:53:11,453 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:11,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:11,454 INFO L82 PathProgramCache]: Analyzing trace with hash -996115591, now seen corresponding path program 1 times [2020-07-01 12:53:11,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:11,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406337361] [2020-07-01 12:53:11,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:11,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406337361] [2020-07-01 12:53:11,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977373699] [2020-07-01 12:53:11,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:53:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:11,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 12:53:11,657 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:53:11,697 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2020-07-01 12:53:11,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2020-07-01 12:53:11,698 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:53:11,711 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:53:11,713 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:53:11,713 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:19 [2020-07-01 12:53:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:53:11,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:53:11,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2020-07-01 12:53:11,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893151070] [2020-07-01 12:53:11,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:11,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:11,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:11,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:53:11,739 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 3 states. [2020-07-01 12:53:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:11,774 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-01 12:53:11,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:11,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-01 12:53:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:11,775 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:53:11,775 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:53:11,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:53:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:53:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:53:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:53:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-01 12:53:11,779 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2020-07-01 12:53:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:11,779 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-01 12:53:11,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-01 12:53:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:53:11,780 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:53:11,780 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:53:11,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:53:11,981 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:53:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash -996115590, now seen corresponding path program 1 times [2020-07-01 12:53:11,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:11,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264165463] [2020-07-01 12:53:11,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:53:12,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264165463] [2020-07-01 12:53:12,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:12,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:12,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825074017] [2020-07-01 12:53:12,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:53:12,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:12,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:12,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:12,018 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2020-07-01 12:53:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:12,037 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-01 12:53:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:12,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-01 12:53:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:53:12,037 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:53:12,038 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:53:12,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:53:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:53:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:53:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:53:12,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-01 12:53:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:53:12,039 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:53:12,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:53:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:53:12,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:53:12,040 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:53:12,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:53:12,132 INFO L264 CegarLoopResult]: At program point L10-9(line 10) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= (select |#valid| ULTIMATE.start_main_~c~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset)) [2020-07-01 12:53:12,132 INFO L268 CegarLoopResult]: For program point L10-10(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,133 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,133 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:53:12,133 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:53:12,133 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:53:12,133 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,133 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,133 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,133 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,134 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 12:53:12,134 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:12,134 INFO L268 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-07-01 12:53:12,135 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,135 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,135 INFO L268 CegarLoopResult]: For program point L9-3(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,135 INFO L268 CegarLoopResult]: For program point L9-4(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,135 INFO L268 CegarLoopResult]: For program point L9-6(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,135 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:53:12,135 INFO L268 CegarLoopResult]: For program point L9-8(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,136 INFO L264 CegarLoopResult]: At program point L9-10(line 9) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= (select |#valid| ULTIMATE.start_main_~c~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset)) [2020-07-01 12:53:12,136 INFO L268 CegarLoopResult]: For program point L9-11(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,136 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,136 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,136 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,136 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,136 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,136 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,136 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,137 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,137 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,137 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,137 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,137 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,137 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:53:12,137 INFO L268 CegarLoopResult]: For program point L10-3(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,137 INFO L268 CegarLoopResult]: For program point L10-4(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,137 INFO L268 CegarLoopResult]: For program point L10-6(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,138 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:53:12,138 INFO L268 CegarLoopResult]: For program point L10-7(line 10) no Hoare annotation was computed. [2020-07-01 12:53:12,140 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:53:12,149 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,150 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,150 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,150 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:53:12,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:53:12,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:53:12,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:53:12,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:53:12 BasicIcfg [2020-07-01 12:53:12,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:53:12,164 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:53:12,164 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:53:12,167 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:53:12,168 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:12,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:53:08" (1/5) ... [2020-07-01 12:53:12,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a8ed982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:53:12, skipping insertion in model container [2020-07-01 12:53:12,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:12,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:53:08" (2/5) ... [2020-07-01 12:53:12,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a8ed982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:53:12, skipping insertion in model container [2020-07-01 12:53:12,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:12,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:53:09" (3/5) ... [2020-07-01 12:53:12,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a8ed982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:53:12, skipping insertion in model container [2020-07-01 12:53:12,170 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:12,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:53:09" (4/5) ... [2020-07-01 12:53:12,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a8ed982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:53:12, skipping insertion in model container [2020-07-01 12:53:12,170 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:53:12,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:53:12" (5/5) ... [2020-07-01 12:53:12,172 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:53:12,193 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:53:12,193 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:53:12,193 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:53:12,193 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:53:12,193 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:53:12,193 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:53:12,193 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:53:12,193 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:53:12,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 12:53:12,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-01 12:53:12,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:53:12,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:53:12,209 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:53:12,209 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:53:12,209 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:53:12,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 12:53:12,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-01 12:53:12,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:53:12,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:53:12,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:53:12,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:53:12,218 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue [90] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 16#L-1true [174] L-1-->L8: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 34#L8true [83] L8-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~c~0.base_4)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~c~0.base_4)) (= (store |v_#memory_int_2| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0)) |v_#memory_int_1|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int] 31#L8-1true [80] L8-1-->L9-10: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~i~0.base_4)) (= (store |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4 0)) |v_#memory_int_3|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~i~0.base_4)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_7|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 17#L9-10true [2020-07-01 12:53:12,218 INFO L796 eck$LassoCheckResult]: Loop: 17#L9-10true [100] L9-10-->L9-1: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem5_2|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_9| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 12#L9-1true [99] L9-1-->L9-3: Formula: (< |v_ULTIMATE.start_main_#t~mem5_6| 100) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 8#L9-3true [95] L9-3-->L9-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~c~0.base_7)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~c~0.base_7) v_ULTIMATE.start_main_~c~0.offset_6) |v_ULTIMATE.start_main_#t~mem6_2|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~c~0.base_7))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 4#L9-4true [231] L9-4-->L9-6: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~c~0.base_22)) (<= (+ v_ULTIMATE.start_main_~c~0.offset_16 4) (select |v_#length_33| v_ULTIMATE.start_main_~c~0.base_22)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~c~0.base_22 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~c~0.base_22) v_ULTIMATE.start_main_~c~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem6_6| 1))) |v_#memory_int_22|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_16)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_22, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_23|, #length=|v_#length_33|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_22, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_22|, #length=|v_#length_33|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 25#L9-6true [232] L9-6-->L9-8: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_34| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_40| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= |v_ULTIMATE.start_main_#t~post4_5| |v_ULTIMATE.start_main_#t~mem3_5|) (= |v_ULTIMATE.start_main_#t~mem3_5| (select (select |v_#memory_int_24| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_24|, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_24|, #length=|v_#length_34|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~mem3] 21#L9-8true [236] L9-8-->L9-10: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_main_~i~0.base_17)) (= (store |v_#memory_int_30| v_ULTIMATE.start_main_~i~0.base_17 (store (select |v_#memory_int_30| v_ULTIMATE.start_main_~i~0.base_17) v_ULTIMATE.start_main_~i~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post4_7| 1))) |v_#memory_int_29|) (= 1 (select |v_#valid_46| v_ULTIMATE.start_main_~i~0.base_17)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_13)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_30|, #length=|v_#length_38|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_29|, #length=|v_#length_38|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_6|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem3, ULTIMATE.start_main_#t~post4] 17#L9-10true [2020-07-01 12:53:12,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:12,219 INFO L82 PathProgramCache]: Analyzing trace with hash 3774578, now seen corresponding path program 1 times [2020-07-01 12:53:12,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:12,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285605732] [2020-07-01 12:53:12,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:53:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:53:12,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285605732] [2020-07-01 12:53:12,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:53:12,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:53:12,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277300213] [2020-07-01 12:53:12,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:53:12,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:53:12,236 INFO L82 PathProgramCache]: Analyzing trace with hash -450060372, now seen corresponding path program 1 times [2020-07-01 12:53:12,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:53:12,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191100708] [2020-07-01 12:53:12,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:53:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:53:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:53:12,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:53:12,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:53:12,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:53:12,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:53:12,341 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 12:53:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:53:12,426 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-07-01 12:53:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:53:12,429 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:53:12,433 INFO L168 Benchmark]: Toolchain (without parser) took 3873.70 ms. Allocated memory was 514.9 MB in the beginning and 599.3 MB in the end (delta: 84.4 MB). Free memory was 438.8 MB in the beginning and 503.1 MB in the end (delta: -64.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,433 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:53:12,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.21 ms. Allocated memory was 514.9 MB in the beginning and 562.6 MB in the end (delta: 47.7 MB). Free memory was 438.1 MB in the beginning and 529.3 MB in the end (delta: -91.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.28 ms. Allocated memory is still 562.6 MB. Free memory was 529.3 MB in the beginning and 527.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,435 INFO L168 Benchmark]: Boogie Preprocessor took 24.80 ms. Allocated memory is still 562.6 MB. Free memory was 527.3 MB in the beginning and 525.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,435 INFO L168 Benchmark]: RCFGBuilder took 378.74 ms. Allocated memory is still 562.6 MB. Free memory was 525.9 MB in the beginning and 501.6 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,436 INFO L168 Benchmark]: BlockEncodingV2 took 140.88 ms. Allocated memory is still 562.6 MB. Free memory was 501.0 MB in the beginning and 489.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,436 INFO L168 Benchmark]: TraceAbstraction took 2702.16 ms. Allocated memory was 562.6 MB in the beginning and 599.3 MB in the end (delta: 36.7 MB). Free memory was 488.8 MB in the beginning and 540.8 MB in the end (delta: -52.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:53:12,437 INFO L168 Benchmark]: BuchiAutomizer took 267.33 ms. Allocated memory is still 599.3 MB. Free memory was 540.8 MB in the beginning and 503.1 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:53:12,440 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 55 locations, 58 edges - StatisticsResult: Encoded RCFG 46 locations, 82 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 312.21 ms. Allocated memory was 514.9 MB in the beginning and 562.6 MB in the end (delta: 47.7 MB). Free memory was 438.1 MB in the beginning and 529.3 MB in the end (delta: -91.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.28 ms. Allocated memory is still 562.6 MB. Free memory was 529.3 MB in the beginning and 527.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.80 ms. Allocated memory is still 562.6 MB. Free memory was 527.3 MB in the beginning and 525.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 378.74 ms. Allocated memory is still 562.6 MB. Free memory was 525.9 MB in the beginning and 501.6 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 140.88 ms. Allocated memory is still 562.6 MB. Free memory was 501.0 MB in the beginning and 489.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2702.16 ms. Allocated memory was 562.6 MB in the beginning and 599.3 MB in the end (delta: 36.7 MB). Free memory was 488.8 MB in the beginning and 540.8 MB in the end (delta: -52.0 MB). There was no memory consumed. Max. memory is 50.3 GB. * BuchiAutomizer took 267.33 ms. Allocated memory is still 599.3 MB. Free memory was 540.8 MB in the beginning and 503.1 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 12:53:12,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:53:12,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((1 == \valid[j] && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == i) && \valid[c] == 1) && 4 == unknown-#length-unknown[c]) && unknown-#length-unknown[j] == 4) && 0 == j) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 12:53:12,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:53:12,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:53:12,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((1 == \valid[j] && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == i) && \valid[c] == 1) && 4 == unknown-#length-unknown[c]) && unknown-#length-unknown[j] == 4) && 0 == j) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 69 SDtfs, 344 SDslu, 53 SDs, 0 SdLazy, 408 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 86 HoareAnnotationTreeSize, 2 FomulaSimplifications, 54 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 5382 SizeOfPredicates, 9 NumberOfNonLiveVariables, 178 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 6/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:53:05.098 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_Mftuk1/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:53:12.680 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check