java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:52:00,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:52:00,358 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:52:00,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:52:00,370 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:52:00,371 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:52:00,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:52:00,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:52:00,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:52:00,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:52:00,377 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:52:00,377 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:52:00,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:52:00,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:52:00,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:52:00,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:52:00,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:52:00,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:52:00,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:52:00,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:52:00,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:52:00,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:52:00,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:52:00,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:52:00,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:52:00,393 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:52:00,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:52:00,394 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:52:00,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:52:00,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:52:00,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:52:00,396 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:52:00,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:52:00,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:52:00,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:52:00,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:52:00,408 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:52:00,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:52:00,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:52:00,409 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:52:00,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:52:00,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:52:00,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:52:00,409 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:52:00,409 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:52:00,410 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:52:00,410 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:52:00,410 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:52:00,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:52:00,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:52:00,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:52:00,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:52:00,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:52:00,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:52:00,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:52:00,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:52:00,455 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:52:00,459 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:52:00,460 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:52:00,461 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:52:00,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:52:00,612 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:52:00,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:52:00,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:52:00,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:52:00,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:52:00,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:52:00" (1/1) ... [2018-02-02 20:52:00,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36af2533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00, skipping insertion in model container [2018-02-02 20:52:00,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:52:00" (1/1) ... [2018-02-02 20:52:00,635 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:52:00,663 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:52:00,748 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:52:00,763 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:52:00,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00 WrapperNode [2018-02-02 20:52:00,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:52:00,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:52:00,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:52:00,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:52:00,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00" (1/1) ... [2018-02-02 20:52:00,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00" (1/1) ... [2018-02-02 20:52:00,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00" (1/1) ... [2018-02-02 20:52:00,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00" (1/1) ... [2018-02-02 20:52:00,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00" (1/1) ... [2018-02-02 20:52:00,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00" (1/1) ... [2018-02-02 20:52:00,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00" (1/1) ... [2018-02-02 20:52:00,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:52:00,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:52:00,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:52:00,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:52:00,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:52:00,835 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:52:00,835 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:52:00,835 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:52:00,835 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:52:00,836 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:52:01,185 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:52:01,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:52:01 BoogieIcfgContainer [2018-02-02 20:52:01,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:52:01,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:52:01,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:52:01,188 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:52:01,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:52:00" (1/3) ... [2018-02-02 20:52:01,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f419a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:52:01, skipping insertion in model container [2018-02-02 20:52:01,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:00" (2/3) ... [2018-02-02 20:52:01,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f419a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:52:01, skipping insertion in model container [2018-02-02 20:52:01,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:52:01" (3/3) ... [2018-02-02 20:52:01,190 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:52:01,195 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:52:01,200 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-02-02 20:52:01,222 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:52:01,222 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:52:01,222 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:52:01,222 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:52:01,223 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:52:01,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:52:01,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:52:01,223 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:52:01,223 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:52:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-02-02 20:52:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:52:01,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:01,240 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:01,240 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash 437540254, now seen corresponding path program 1 times [2018-02-02 20:52:01,276 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:01,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:01,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:01,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:52:01,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:01,340 INFO L182 omatonBuilderFactory]: Interpolants [147#true, 148#false, 149#(= 1 (select |#valid| |main_#t~malloc0.base|)), 150#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 20:52:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:01,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:52:01,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:52:01,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:52:01,351 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 4 states. [2018-02-02 20:52:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:01,589 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2018-02-02 20:52:01,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:52:01,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:52:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:01,598 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:52:01,598 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 20:52:01,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 20:52:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2018-02-02 20:52:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 20:52:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2018-02-02 20:52:01,627 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 8 [2018-02-02 20:52:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:01,627 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-02-02 20:52:01,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:52:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2018-02-02 20:52:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:52:01,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:01,628 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:01,628 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:01,628 INFO L82 PathProgramCache]: Analyzing trace with hash 437540255, now seen corresponding path program 1 times [2018-02-02 20:52:01,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:01,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:01,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:01,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:52:01,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:01,744 INFO L182 omatonBuilderFactory]: Interpolants [444#true, 445#false, 446#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 447#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0))] [2018-02-02 20:52:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:01,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:52:01,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:52:01,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:52:01,746 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 4 states. [2018-02-02 20:52:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:01,873 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-02-02 20:52:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:52:01,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:52:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:01,875 INFO L225 Difference]: With dead ends: 130 [2018-02-02 20:52:01,875 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:52:01,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:52:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-02-02 20:52:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 20:52:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2018-02-02 20:52:01,882 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 8 [2018-02-02 20:52:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:01,883 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2018-02-02 20:52:01,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:52:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2018-02-02 20:52:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:52:01,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:01,884 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:01,884 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1223362610, now seen corresponding path program 1 times [2018-02-02 20:52:01,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:01,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:01,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:01,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:52:01,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:01,946 INFO L182 omatonBuilderFactory]: Interpolants [705#true, 706#false, 707#(= 1 (select |#valid| |main_#t~malloc4.base|)), 708#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))), 709#(= 1 (select |#valid| |main_#t~mem6.base|))] [2018-02-02 20:52:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:01,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:52:01,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:52:01,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:01,947 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand 5 states. [2018-02-02 20:52:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:02,248 INFO L93 Difference]: Finished difference Result 270 states and 294 transitions. [2018-02-02 20:52:02,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:52:02,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:52:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:02,250 INFO L225 Difference]: With dead ends: 270 [2018-02-02 20:52:02,250 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 20:52:02,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:52:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 20:52:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 124. [2018-02-02 20:52:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 20:52:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-02-02 20:52:02,258 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 15 [2018-02-02 20:52:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:02,259 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-02-02 20:52:02,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:52:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-02-02 20:52:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:52:02,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:02,260 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:02,260 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1223362609, now seen corresponding path program 1 times [2018-02-02 20:52:02,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:02,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:02,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:52:02,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,341 INFO L182 omatonBuilderFactory]: Interpolants [1110#true, 1111#false, 1112#(and (= 12 (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1113#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))), 1114#(and (= (select |#length| |main_#t~mem6.base|) 12) (= |main_#t~mem6.offset| 0))] [2018-02-02 20:52:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:52:02,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:52:02,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:02,342 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 5 states. [2018-02-02 20:52:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:02,609 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2018-02-02 20:52:02,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:52:02,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:52:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:02,610 INFO L225 Difference]: With dead ends: 225 [2018-02-02 20:52:02,611 INFO L226 Difference]: Without dead ends: 225 [2018-02-02 20:52:02,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:52:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-02 20:52:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 123. [2018-02-02 20:52:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:52:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-02-02 20:52:02,615 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 15 [2018-02-02 20:52:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:02,615 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-02-02 20:52:02,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:52:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-02-02 20:52:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:52:02,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:02,616 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:02,616 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:02,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1355242881, now seen corresponding path program 1 times [2018-02-02 20:52:02,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:02,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:02,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:52:02,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,677 INFO L182 omatonBuilderFactory]: Interpolants [1472#(= 1 (select |#valid| main_~x~0.base)), 1469#true, 1470#false, 1471#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 20:52:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:52:02,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:52:02,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:52:02,678 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 4 states. [2018-02-02 20:52:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:02,787 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-02-02 20:52:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:52:02,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-02 20:52:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:02,788 INFO L225 Difference]: With dead ends: 127 [2018-02-02 20:52:02,788 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 20:52:02,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 20:52:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-02-02 20:52:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:52:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-02-02 20:52:02,794 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 19 [2018-02-02 20:52:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:02,794 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-02-02 20:52:02,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:52:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-02-02 20:52:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:52:02,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:02,795 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:02,795 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1355242882, now seen corresponding path program 1 times [2018-02-02 20:52:02,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:02,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:02,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:52:02,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,867 INFO L182 omatonBuilderFactory]: Interpolants [1721#true, 1722#false, 1723#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1724#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 1725#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))] [2018-02-02 20:52:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:52:02,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:52:02,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:02,867 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 5 states. [2018-02-02 20:52:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:02,988 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2018-02-02 20:52:02,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:52:02,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 20:52:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:02,989 INFO L225 Difference]: With dead ends: 164 [2018-02-02 20:52:02,989 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 20:52:02,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:52:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 20:52:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2018-02-02 20:52:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 20:52:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2018-02-02 20:52:02,994 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 19 [2018-02-02 20:52:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:02,995 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2018-02-02 20:52:02,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:52:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2018-02-02 20:52:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:52:02,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:02,996 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:02,996 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1348114365, now seen corresponding path program 1 times [2018-02-02 20:52:02,997 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:03,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:03,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:03,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:52:03,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:03,040 INFO L182 omatonBuilderFactory]: Interpolants [2041#true, 2042#false, 2043#(= 1 (select |#valid| |main_#t~malloc14.base|)), 2044#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2045#(= 1 (select |#valid| |main_#t~mem16.base|)), 2046#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:52:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:03,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:52:03,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:52:03,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:52:03,041 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand 6 states. [2018-02-02 20:52:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:03,214 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2018-02-02 20:52:03,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:52:03,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 20:52:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:03,215 INFO L225 Difference]: With dead ends: 211 [2018-02-02 20:52:03,215 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:52:03,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:52:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:52:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 146. [2018-02-02 20:52:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 20:52:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2018-02-02 20:52:03,219 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 22 [2018-02-02 20:52:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:03,219 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2018-02-02 20:52:03,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:52:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2018-02-02 20:52:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:52:03,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:03,220 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:03,220 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1348114366, now seen corresponding path program 1 times [2018-02-02 20:52:03,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:03,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:03,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:03,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:52:03,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:03,286 INFO L182 omatonBuilderFactory]: Interpolants [2416#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 2411#true, 2412#false, 2413#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|)), 2414#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2415#(and (= 12 (select |#length| |main_#t~mem16.base|)) (= 0 |main_#t~mem16.offset|))] [2018-02-02 20:52:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:03,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:52:03,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:52:03,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:52:03,287 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand 6 states. [2018-02-02 20:52:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:03,835 INFO L93 Difference]: Finished difference Result 222 states and 262 transitions. [2018-02-02 20:52:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:52:03,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 20:52:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:03,837 INFO L225 Difference]: With dead ends: 222 [2018-02-02 20:52:03,837 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 20:52:03,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:52:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 20:52:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 130. [2018-02-02 20:52:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 20:52:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-02-02 20:52:03,841 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 22 [2018-02-02 20:52:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:03,842 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-02-02 20:52:03,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:52:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-02-02 20:52:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:52:03,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:03,843 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:03,844 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:03,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1821397366, now seen corresponding path program 1 times [2018-02-02 20:52:03,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:03,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:03,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:03,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:52:03,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:03,878 INFO L182 omatonBuilderFactory]: Interpolants [2784#(not (= 0 main_~x~0.base)), 2780#true, 2781#false, 2782#(not (= 0 |main_#t~malloc0.base|)), 2783#(not (= 0 main_~head~0.base))] [2018-02-02 20:52:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:03,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:52:03,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:52:03,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:03,879 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 5 states. [2018-02-02 20:52:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:03,980 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2018-02-02 20:52:03,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:52:03,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 20:52:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:03,982 INFO L225 Difference]: With dead ends: 148 [2018-02-02 20:52:03,982 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 20:52:03,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:52:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 20:52:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2018-02-02 20:52:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 20:52:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2018-02-02 20:52:03,986 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 25 [2018-02-02 20:52:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:03,986 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2018-02-02 20:52:03,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:52:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2018-02-02 20:52:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:52:03,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:03,988 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:03,988 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:03,988 INFO L82 PathProgramCache]: Analyzing trace with hash 203248485, now seen corresponding path program 1 times [2018-02-02 20:52:03,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:03,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:04,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:52:04,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,016 INFO L182 omatonBuilderFactory]: Interpolants [3067#true, 3068#false, 3069#(not |main_#t~short31|), 3070#(not |main_#t~short34|)] [2018-02-02 20:52:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:52:04,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:52:04,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:52:04,017 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand 4 states. [2018-02-02 20:52:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:04,033 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2018-02-02 20:52:04,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:52:04,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-02 20:52:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:04,035 INFO L225 Difference]: With dead ends: 156 [2018-02-02 20:52:04,035 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 20:52:04,035 INFO L554 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 [2018-02-02 20:52:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 20:52:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-02-02 20:52:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 20:52:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2018-02-02 20:52:04,038 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 28 [2018-02-02 20:52:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:04,039 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2018-02-02 20:52:04,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:52:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2018-02-02 20:52:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:52:04,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:04,040 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:04,040 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1370430932, now seen corresponding path program 1 times [2018-02-02 20:52:04,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:04,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:04,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:52:04,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,089 INFO L182 omatonBuilderFactory]: Interpolants [3363#true, 3364#false, 3365#(= 1 (select |#valid| |main_#t~malloc20.base|)), 3366#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 3367#(= 1 (select |#valid| |main_#t~mem22.base|))] [2018-02-02 20:52:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:52:04,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:52:04,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:04,090 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 5 states. [2018-02-02 20:52:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:04,409 INFO L93 Difference]: Finished difference Result 232 states and 267 transitions. [2018-02-02 20:52:04,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:52:04,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 20:52:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:04,411 INFO L225 Difference]: With dead ends: 232 [2018-02-02 20:52:04,411 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 20:52:04,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:52:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 20:52:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 133. [2018-02-02 20:52:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 20:52:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2018-02-02 20:52:04,415 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 29 [2018-02-02 20:52:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:04,416 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2018-02-02 20:52:04,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:52:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2018-02-02 20:52:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:52:04,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:04,417 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:04,417 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:04,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1370430931, now seen corresponding path program 1 times [2018-02-02 20:52:04,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:04,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:04,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:52:04,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,473 INFO L182 omatonBuilderFactory]: Interpolants [3744#(and (= |main_#t~mem22.offset| 0) (= (select |#length| |main_#t~mem22.base|) 12)), 3740#true, 3741#false, 3742#(and (= 0 |main_#t~malloc20.offset|) (= 12 (select |#length| |main_#t~malloc20.base|))), 3743#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))))] [2018-02-02 20:52:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:52:04,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:52:04,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:04,474 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 5 states. [2018-02-02 20:52:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:04,639 INFO L93 Difference]: Finished difference Result 238 states and 276 transitions. [2018-02-02 20:52:04,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:52:04,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 20:52:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:04,640 INFO L225 Difference]: With dead ends: 238 [2018-02-02 20:52:04,640 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 20:52:04,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:52:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 20:52:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 132. [2018-02-02 20:52:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 20:52:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2018-02-02 20:52:04,642 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 29 [2018-02-02 20:52:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:04,642 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2018-02-02 20:52:04,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:52:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2018-02-02 20:52:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:52:04,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:04,643 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:04,643 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash 811222786, now seen corresponding path program 1 times [2018-02-02 20:52:04,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:04,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:04,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:52:04,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,805 INFO L182 omatonBuilderFactory]: Interpolants [4128#(and (= 1 (select |#valid| main_~x~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 4129#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~x~0.offset 0)), 4130#(= 1 (select |#valid| |main_#t~mem32.base|)), 4121#true, 4122#false, 4123#(= 0 |main_#t~malloc0.offset|), 4124#(= main_~head~0.offset 0), 4125#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 4126#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 4127#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset))] [2018-02-02 20:52:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:04,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:52:04,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:52:04,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:52:04,806 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand 10 states. [2018-02-02 20:52:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:05,075 INFO L93 Difference]: Finished difference Result 239 states and 273 transitions. [2018-02-02 20:52:05,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:52:05,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-02-02 20:52:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:05,076 INFO L225 Difference]: With dead ends: 239 [2018-02-02 20:52:05,076 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 20:52:05,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:52:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 20:52:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 149. [2018-02-02 20:52:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 20:52:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2018-02-02 20:52:05,081 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 30 [2018-02-02 20:52:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:05,081 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2018-02-02 20:52:05,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:52:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-02-02 20:52:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:52:05,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:05,082 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:05,082 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash 811222787, now seen corresponding path program 1 times [2018-02-02 20:52:05,083 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:05,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:05,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:05,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:52:05,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:05,207 INFO L182 omatonBuilderFactory]: Interpolants [4535#true, 4536#false, 4537#(= 0 |main_#t~malloc0.offset|), 4538#(= main_~head~0.offset 0), 4539#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0)), 4540#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 4541#(and (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= |main_#t~mem30.offset| main_~x~0.offset)), 4542#(and (= main_~x~0.offset 0) (not |main_#t~short31|)), 4543#(and (= main_~x~0.offset 0) (not |main_#t~short34|))] [2018-02-02 20:52:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:05,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:52:05,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:52:05,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:52:05,208 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 9 states. [2018-02-02 20:52:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:05,506 INFO L93 Difference]: Finished difference Result 218 states and 247 transitions. [2018-02-02 20:52:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:52:05,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-02 20:52:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:05,507 INFO L225 Difference]: With dead ends: 218 [2018-02-02 20:52:05,507 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 20:52:05,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:52:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 20:52:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 145. [2018-02-02 20:52:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:52:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2018-02-02 20:52:05,511 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 30 [2018-02-02 20:52:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:05,511 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2018-02-02 20:52:05,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:52:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2018-02-02 20:52:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:52:05,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:05,512 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:05,512 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash -518752177, now seen corresponding path program 1 times [2018-02-02 20:52:05,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:05,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:05,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:05,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:52:05,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:05,606 INFO L182 omatonBuilderFactory]: Interpolants [4928#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~mem6.base|))), 4929#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))), 4930#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 4931#(= 1 (select |#valid| |main_#t~mem32.base|)), 4923#true, 4924#false, 4925#(= (select |#valid| main_~head~0.base) 1), 4926#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 4927#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))))] [2018-02-02 20:52:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:05,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:52:05,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:52:05,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:52:05,607 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 9 states. [2018-02-02 20:52:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:06,028 INFO L93 Difference]: Finished difference Result 398 states and 454 transitions. [2018-02-02 20:52:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:52:06,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 20:52:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:06,029 INFO L225 Difference]: With dead ends: 398 [2018-02-02 20:52:06,029 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 20:52:06,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:52:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 20:52:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 161. [2018-02-02 20:52:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 20:52:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2018-02-02 20:52:06,033 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 33 [2018-02-02 20:52:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:06,033 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2018-02-02 20:52:06,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:52:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2018-02-02 20:52:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:52:06,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:06,034 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:06,034 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash -518752176, now seen corresponding path program 1 times [2018-02-02 20:52:06,035 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:06,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:06,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:52:06,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,140 INFO L182 omatonBuilderFactory]: Interpolants [5520#false, 5521#(= (select |#valid| main_~head~0.base) 1), 5522#(and (= 12 (select |#length| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 5523#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))), 5524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~mem6.base|))), 5525#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))), 5526#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)))), 5527#(and (= |main_#t~mem32.offset| 0) (= 12 (select |#length| |main_#t~mem32.base|))), 5519#true] [2018-02-02 20:52:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:52:06,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:52:06,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:52:06,141 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 9 states. [2018-02-02 20:52:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:06,536 INFO L93 Difference]: Finished difference Result 311 states and 354 transitions. [2018-02-02 20:52:06,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:52:06,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 20:52:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:06,537 INFO L225 Difference]: With dead ends: 311 [2018-02-02 20:52:06,537 INFO L226 Difference]: Without dead ends: 311 [2018-02-02 20:52:06,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:52:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-02 20:52:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 161. [2018-02-02 20:52:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 20:52:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2018-02-02 20:52:06,540 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 33 [2018-02-02 20:52:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:06,540 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2018-02-02 20:52:06,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:52:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2018-02-02 20:52:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:52:06,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:06,541 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:06,541 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1613392636, now seen corresponding path program 1 times [2018-02-02 20:52:06,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:06,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:06,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:52:06,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,570 INFO L182 omatonBuilderFactory]: Interpolants [6016#true, 6017#false, 6018#(not |main_#t~short34|), 6019#(not |main_#t~short36|)] [2018-02-02 20:52:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:52:06,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:52:06,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:52:06,571 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 4 states. [2018-02-02 20:52:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:06,584 INFO L93 Difference]: Finished difference Result 172 states and 197 transitions. [2018-02-02 20:52:06,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:52:06,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-02-02 20:52:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:06,585 INFO L225 Difference]: With dead ends: 172 [2018-02-02 20:52:06,585 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 20:52:06,585 INFO L554 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 [2018-02-02 20:52:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 20:52:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2018-02-02 20:52:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 20:52:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2018-02-02 20:52:06,589 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 36 [2018-02-02 20:52:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:06,589 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2018-02-02 20:52:06,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:52:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2018-02-02 20:52:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:52:06,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:06,590 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:06,590 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:06,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1298991553, now seen corresponding path program 1 times [2018-02-02 20:52:06,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:06,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:06,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:52:06,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,688 INFO L182 omatonBuilderFactory]: Interpolants [6359#true, 6360#false, 6361#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6362#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6363#(and (= 0 |main_#t~mem37.offset|) (= 0 |main_#t~mem37.base|)), 6364#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset))] [2018-02-02 20:52:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:52:06,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:52:06,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:52:06,689 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand 6 states. [2018-02-02 20:52:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:06,859 INFO L93 Difference]: Finished difference Result 202 states and 229 transitions. [2018-02-02 20:52:06,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:52:06,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-02 20:52:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:06,860 INFO L225 Difference]: With dead ends: 202 [2018-02-02 20:52:06,860 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 20:52:06,860 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:52:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 20:52:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2018-02-02 20:52:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 20:52:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2018-02-02 20:52:06,862 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 38 [2018-02-02 20:52:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:06,862 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2018-02-02 20:52:06,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:52:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2018-02-02 20:52:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:52:06,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:06,863 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:06,863 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash -49439231, now seen corresponding path program 1 times [2018-02-02 20:52:06,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:06,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:07,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:07,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:52:07,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:07,170 INFO L182 omatonBuilderFactory]: Interpolants [6753#true, 6754#false, 6755#(= 0 |main_#t~malloc0.offset|), 6756#(= main_~head~0.offset 0), 6757#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 6758#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 6759#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6760#(and (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 6761#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6762#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 1 (select |#valid| main_~head~0.base))), 6763#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 6764#(and (= 1 (select |#valid| main_~head~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base)), 6765#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= 1 (select |#valid| main_~head~0.base))), 6766#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 6767#(and (= 1 (select |#valid| main_~x~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base |main_#t~mem30.base|)), 6768#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 6769#(= 1 (select |#valid| |main_#t~mem32.base|))] [2018-02-02 20:52:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:07,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:52:07,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:52:07,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:52:07,171 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand 17 states. [2018-02-02 20:52:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:07,899 INFO L93 Difference]: Finished difference Result 331 states and 367 transitions. [2018-02-02 20:52:07,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:52:07,899 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-02-02 20:52:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:07,900 INFO L225 Difference]: With dead ends: 331 [2018-02-02 20:52:07,900 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 20:52:07,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:52:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 20:52:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 208. [2018-02-02 20:52:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 20:52:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2018-02-02 20:52:07,903 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 43 [2018-02-02 20:52:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:07,904 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2018-02-02 20:52:07,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:52:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2018-02-02 20:52:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:52:07,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:07,904 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:07,904 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:07,904 INFO L82 PathProgramCache]: Analyzing trace with hash -49439230, now seen corresponding path program 1 times [2018-02-02 20:52:07,905 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:07,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:08,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:08,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:52:08,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:08,391 INFO L182 omatonBuilderFactory]: Interpolants [7360#(and (= main_~x~0.offset 0) (not |main_#t~short31|)), 7361#(and (= main_~x~0.offset 0) (not |main_#t~short34|)), 7345#true, 7346#false, 7347#(= 0 |main_#t~malloc0.offset|), 7348#(= main_~head~0.offset 0), 7349#(and (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 7350#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7351#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 7352#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 7353#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 7354#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~mem16.base|)) (= main_~head~0.offset 0)), 7355#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 7356#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0)), 7357#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0)), 7358#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 7359#(and (= main_~x~0.offset 0) (= main_~x~0.base |main_#t~mem30.base|) (= |main_#t~mem30.offset| main_~x~0.offset))] [2018-02-02 20:52:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:08,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:52:08,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:52:08,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:52:08,392 INFO L87 Difference]: Start difference. First operand 208 states and 240 transitions. Second operand 17 states. [2018-02-02 20:52:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:09,443 INFO L93 Difference]: Finished difference Result 323 states and 357 transitions. [2018-02-02 20:52:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:52:09,443 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-02-02 20:52:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:09,444 INFO L225 Difference]: With dead ends: 323 [2018-02-02 20:52:09,445 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 20:52:09,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:52:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 20:52:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 204. [2018-02-02 20:52:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 20:52:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 234 transitions. [2018-02-02 20:52:09,449 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 234 transitions. Word has length 43 [2018-02-02 20:52:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:09,449 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 234 transitions. [2018-02-02 20:52:09,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:52:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 234 transitions. [2018-02-02 20:52:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:52:09,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:09,450 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:09,450 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:09,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1721344812, now seen corresponding path program 1 times [2018-02-02 20:52:09,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:09,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:09,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:09,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:52:09,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:09,639 INFO L182 omatonBuilderFactory]: Interpolants [7936#(= main_~head~0.offset 0), 7937#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 7938#(and (= |main_#t~mem29| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 7939#(and (= 0 main_~head~0.offset) (or |main_#t~short31| (and (not (= 2 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~x~0.base main_~head~0.base))) (= main_~head~0.offset main_~x~0.offset)), 7940#(and (= main_~head~0.offset main_~x~0.offset) (not (= 2 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 7941#(and (not (= 2 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8)))) (= main_~head~0.offset 0)), 7942#(and (not (= 2 (select (select |#memory_int| main_~x~0.base) (+ 0 8)))) (= 0 main_~x~0.offset)), 7943#(not (= 2 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8)))), 7944#(not (= 2 |main_#t~mem39|)), 7933#true, 7934#false, 7935#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 20:52:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:09,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:52:09,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:52:09,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:52:09,639 INFO L87 Difference]: Start difference. First operand 204 states and 234 transitions. Second operand 12 states. [2018-02-02 20:52:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:09,868 INFO L93 Difference]: Finished difference Result 280 states and 309 transitions. [2018-02-02 20:52:09,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:52:09,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-02 20:52:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:09,869 INFO L225 Difference]: With dead ends: 280 [2018-02-02 20:52:09,869 INFO L226 Difference]: Without dead ends: 280 [2018-02-02 20:52:09,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:52:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-02 20:52:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 255. [2018-02-02 20:52:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 20:52:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 297 transitions. [2018-02-02 20:52:09,872 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 297 transitions. Word has length 45 [2018-02-02 20:52:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:09,872 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 297 transitions. [2018-02-02 20:52:09,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:52:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 297 transitions. [2018-02-02 20:52:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:52:09,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:09,873 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:09,873 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash 769700308, now seen corresponding path program 1 times [2018-02-02 20:52:09,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:09,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:10,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:10,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:52:10,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:10,163 INFO L182 omatonBuilderFactory]: Interpolants [8512#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))), 8513#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 8514#(= (select |#valid| |main_#t~mem32.base|) 1), 8496#true, 8497#false, 8498#(= 0 |main_#t~malloc0.offset|), 8499#(= main_~head~0.offset 0), 8500#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 8501#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 8502#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 8503#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 8504#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 8505#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.offset (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8506#(and (not (= main_~x~0.offset (+ main_~head~0.offset 4))) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (or (= |main_#t~malloc14.base| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)))))), 8507#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.offset (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4))))), 8508#(and (or (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~head~0.base |main_#t~mem16.base|))), 8509#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~x~0.base main_~head~0.base))), 8510#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base main_~head~0.base))), 8511#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4))))] [2018-02-02 20:52:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:10,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:10,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:10,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:10,164 INFO L87 Difference]: Start difference. First operand 255 states and 297 transitions. Second operand 19 states. [2018-02-02 20:52:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:11,320 INFO L93 Difference]: Finished difference Result 677 states and 784 transitions. [2018-02-02 20:52:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:52:11,320 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-02-02 20:52:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:11,322 INFO L225 Difference]: With dead ends: 677 [2018-02-02 20:52:11,322 INFO L226 Difference]: Without dead ends: 677 [2018-02-02 20:52:11,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=565, Invalid=1885, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:52:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-02-02 20:52:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 283. [2018-02-02 20:52:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 20:52:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 331 transitions. [2018-02-02 20:52:11,326 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 331 transitions. Word has length 46 [2018-02-02 20:52:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:11,327 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 331 transitions. [2018-02-02 20:52:11,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 331 transitions. [2018-02-02 20:52:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:52:11,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:11,327 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:11,327 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash 769700309, now seen corresponding path program 1 times [2018-02-02 20:52:11,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:11,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:11,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:11,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:52:11,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:11,752 INFO L182 omatonBuilderFactory]: Interpolants [9537#true, 9538#false, 9539#(= |main_#t~malloc0.offset| 0), 9540#(= main_~head~0.offset 0), 9541#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9542#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (= 12 (select |#length| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9543#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9544#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))), 9545#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9546#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 9547#(and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc14.base|))), 9548#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base)), 9549#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem16.base|))), 9550#(and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base main_~head~0.base))), 9551#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) (+ main_~head~0.offset 4)))), 9552#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))), 9553#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 9554#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= |main_#t~mem30.offset| main_~x~0.offset) (= 0 main_~x~0.offset)), 9555#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)))), 9556#(and (= |main_#t~mem32.offset| 0) (= 12 (select |#length| |main_#t~mem32.base|)))] [2018-02-02 20:52:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:11,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:52:11,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:52:11,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:52:11,753 INFO L87 Difference]: Start difference. First operand 283 states and 331 transitions. Second operand 20 states. [2018-02-02 20:52:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:12,777 INFO L93 Difference]: Finished difference Result 447 states and 513 transitions. [2018-02-02 20:52:12,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:52:12,777 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-02-02 20:52:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:12,778 INFO L225 Difference]: With dead ends: 447 [2018-02-02 20:52:12,778 INFO L226 Difference]: Without dead ends: 447 [2018-02-02 20:52:12,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:52:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-02-02 20:52:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 283. [2018-02-02 20:52:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 20:52:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 330 transitions. [2018-02-02 20:52:12,782 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 330 transitions. Word has length 46 [2018-02-02 20:52:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:12,782 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 330 transitions. [2018-02-02 20:52:12,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:52:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 330 transitions. [2018-02-02 20:52:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:52:12,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:12,783 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:12,783 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1896911989, now seen corresponding path program 1 times [2018-02-02 20:52:12,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:12,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:13,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:13,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:52:13,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:13,155 INFO L182 omatonBuilderFactory]: Interpolants [10336#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 10337#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 10338#(and (= 1 (select |#valid| main_~x~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.offset 0) (= main_~x~0.base |main_#t~mem30.base|)), 10339#(= 1 (select |#valid| |main_#t~mem32.base|)), 10321#true, 10322#false, 10323#(= 0 |main_#t~malloc0.offset|), 10324#(= main_~head~0.offset 0), 10325#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 10326#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 10327#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 10328#(and (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 10329#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 10330#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 10331#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 10332#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~malloc20.base|)) (= main_~head~0.offset 0)), 10333#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset 0)), 10334#(and (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0)), 10335#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0))] [2018-02-02 20:52:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:13,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:13,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:13,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:13,156 INFO L87 Difference]: Start difference. First operand 283 states and 330 transitions. Second operand 19 states. [2018-02-02 20:52:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:13,909 INFO L93 Difference]: Finished difference Result 463 states and 533 transitions. [2018-02-02 20:52:13,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:52:13,910 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-02-02 20:52:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:13,911 INFO L225 Difference]: With dead ends: 463 [2018-02-02 20:52:13,911 INFO L226 Difference]: Without dead ends: 463 [2018-02-02 20:52:13,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:52:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-02 20:52:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 305. [2018-02-02 20:52:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-02 20:52:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 356 transitions. [2018-02-02 20:52:13,917 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 356 transitions. Word has length 46 [2018-02-02 20:52:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:13,917 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 356 transitions. [2018-02-02 20:52:13,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 356 transitions. [2018-02-02 20:52:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:52:13,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:13,918 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:13,918 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1896911990, now seen corresponding path program 1 times [2018-02-02 20:52:13,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:13,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:14,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:14,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:52:14,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:14,333 INFO L182 omatonBuilderFactory]: Interpolants [11144#true, 11145#false, 11146#(= 0 |main_#t~malloc0.offset|), 11147#(= main_~head~0.offset 0), 11148#(and (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 11149#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11150#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 11151#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~x~0.base main_~head~0.base)), 11152#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 11153#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1)), 11154#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 11155#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~malloc20.base|)) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) (+ main_~head~0.offset 4)))), 11156#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))))), 11157#(and (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))), 11158#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base)), 11159#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 11160#(and (= main_~x~0.base |main_#t~mem30.base|) (= |main_#t~mem30.offset| main_~x~0.offset)), 11161#(not |main_#t~short31|), 11162#(not |main_#t~short34|)] [2018-02-02 20:52:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:14,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:14,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:14,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:14,334 INFO L87 Difference]: Start difference. First operand 305 states and 356 transitions. Second operand 19 states. [2018-02-02 20:52:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:15,654 INFO L93 Difference]: Finished difference Result 495 states and 566 transitions. [2018-02-02 20:52:15,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:52:15,654 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-02-02 20:52:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:15,655 INFO L225 Difference]: With dead ends: 495 [2018-02-02 20:52:15,655 INFO L226 Difference]: Without dead ends: 495 [2018-02-02 20:52:15,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=581, Invalid=2611, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 20:52:15,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-02-02 20:52:15,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 289. [2018-02-02 20:52:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-02-02 20:52:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 336 transitions. [2018-02-02 20:52:15,659 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 336 transitions. Word has length 46 [2018-02-02 20:52:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:15,660 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 336 transitions. [2018-02-02 20:52:15,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 336 transitions. [2018-02-02 20:52:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:52:15,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:15,660 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:15,661 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:15,661 INFO L82 PathProgramCache]: Analyzing trace with hash 658549975, now seen corresponding path program 1 times [2018-02-02 20:52:15,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:15,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:15,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:15,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:52:15,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:15,743 INFO L182 omatonBuilderFactory]: Interpolants [12023#true, 12024#false, 12025#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12026#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem37.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem37.base|)), 12027#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~x~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)), 12028#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12029#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12030#(and (= 0 |main_#t~mem38.base|) (= 0 |main_#t~mem38.offset|)), 12031#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset))] [2018-02-02 20:52:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:15,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:52:15,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:52:15,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:52:15,744 INFO L87 Difference]: Start difference. First operand 289 states and 336 transitions. Second operand 9 states. [2018-02-02 20:52:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:16,107 INFO L93 Difference]: Finished difference Result 378 states and 439 transitions. [2018-02-02 20:52:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:52:16,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-02-02 20:52:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:16,109 INFO L225 Difference]: With dead ends: 378 [2018-02-02 20:52:16,109 INFO L226 Difference]: Without dead ends: 378 [2018-02-02 20:52:16,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:52:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-02 20:52:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 316. [2018-02-02 20:52:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-02 20:52:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 369 transitions. [2018-02-02 20:52:16,113 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 369 transitions. Word has length 47 [2018-02-02 20:52:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:16,113 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 369 transitions. [2018-02-02 20:52:16,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:52:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 369 transitions. [2018-02-02 20:52:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:52:16,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:16,114 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:16,114 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:16,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1059788181, now seen corresponding path program 1 times [2018-02-02 20:52:16,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:16,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:52:16,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:16,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:52:16,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:16,201 INFO L182 omatonBuilderFactory]: Interpolants [12737#true, 12738#false, 12739#(= |#valid| |old(#valid)|), 12740#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 12741#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 12742#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|))] [2018-02-02 20:52:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:52:16,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:52:16,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:52:16,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:52:16,202 INFO L87 Difference]: Start difference. First operand 316 states and 369 transitions. Second operand 6 states. [2018-02-02 20:52:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:16,407 INFO L93 Difference]: Finished difference Result 340 states and 392 transitions. [2018-02-02 20:52:16,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:52:16,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-02-02 20:52:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:16,409 INFO L225 Difference]: With dead ends: 340 [2018-02-02 20:52:16,409 INFO L226 Difference]: Without dead ends: 307 [2018-02-02 20:52:16,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:52:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-02 20:52:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-02-02 20:52:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-02-02 20:52:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 358 transitions. [2018-02-02 20:52:16,412 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 358 transitions. Word has length 48 [2018-02-02 20:52:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:16,413 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 358 transitions. [2018-02-02 20:52:16,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:52:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 358 transitions. [2018-02-02 20:52:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:52:16,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:16,413 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:16,414 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash 878742466, now seen corresponding path program 1 times [2018-02-02 20:52:16,414 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:16,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:17,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:17,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:52:17,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:17,033 INFO L182 omatonBuilderFactory]: Interpolants [13408#(and (or (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 13409#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 13410#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4))))) (= main_~head~0.offset 0)), 13411#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 13412#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 13413#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 13414#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 main_~x~0.offset)), 13415#(= (select |#valid| |main_#t~mem32.base|) 1), 13396#true, 13397#false, 13398#(= 0 |main_#t~malloc0.offset|), 13399#(= main_~head~0.offset 0), 13400#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 13401#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 13402#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 13403#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 13404#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 13405#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 13406#(and (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (or (= |main_#t~malloc14.base| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4))))) (= main_~head~0.offset 0)), 13407#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:52:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:17,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:52:17,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:52:17,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:52:17,034 INFO L87 Difference]: Start difference. First operand 307 states and 358 transitions. Second operand 20 states. [2018-02-02 20:52:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:18,768 INFO L93 Difference]: Finished difference Result 905 states and 1060 transitions. [2018-02-02 20:52:18,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:52:18,768 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 20:52:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:18,770 INFO L225 Difference]: With dead ends: 905 [2018-02-02 20:52:18,770 INFO L226 Difference]: Without dead ends: 905 [2018-02-02 20:52:18,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=744, Invalid=2678, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:52:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-02-02 20:52:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 329. [2018-02-02 20:52:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-02 20:52:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 384 transitions. [2018-02-02 20:52:18,775 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 384 transitions. Word has length 49 [2018-02-02 20:52:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:18,776 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 384 transitions. [2018-02-02 20:52:18,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:52:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 384 transitions. [2018-02-02 20:52:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:52:18,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:18,777 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:18,777 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash 878742467, now seen corresponding path program 1 times [2018-02-02 20:52:18,777 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:18,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:19,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:19,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:52:19,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:19,376 INFO L182 omatonBuilderFactory]: Interpolants [14728#true, 14729#false, 14730#(= 0 |main_#t~malloc0.offset|), 14731#(= main_~head~0.offset 0), 14732#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 14733#(and (= 12 (select |#length| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 14734#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 14735#(and (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 12 (select |#length| |main_#t~mem6.base|)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 14736#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 14737#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 14738#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 14739#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 14740#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 12 (select |#length| |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 14741#(and (= 12 (select |#length| main_~x~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))), 14742#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~malloc20.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 14743#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset 0)), 14744#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 14745#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 14746#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 14747#(and (= |main_#t~mem32.offset| 0) (= (select |#length| |main_#t~mem32.base|) 12))] [2018-02-02 20:52:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:19,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:52:19,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:52:19,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:52:19,377 INFO L87 Difference]: Start difference. First operand 329 states and 384 transitions. Second operand 20 states. [2018-02-02 20:52:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:20,599 INFO L93 Difference]: Finished difference Result 727 states and 854 transitions. [2018-02-02 20:52:20,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:52:20,599 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 20:52:20,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:20,600 INFO L225 Difference]: With dead ends: 727 [2018-02-02 20:52:20,600 INFO L226 Difference]: Without dead ends: 727 [2018-02-02 20:52:20,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=416, Invalid=1224, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:52:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-02-02 20:52:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 313. [2018-02-02 20:52:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-02-02 20:52:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2018-02-02 20:52:20,604 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 49 [2018-02-02 20:52:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:20,604 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2018-02-02 20:52:20,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:52:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2018-02-02 20:52:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:52:20,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:20,604 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:20,605 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:20,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1873260418, now seen corresponding path program 1 times [2018-02-02 20:52:20,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:20,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:20,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:20,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:52:20,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:20,756 INFO L182 omatonBuilderFactory]: Interpolants [15840#(and (= main_~x~0.offset 0) (not |main_#t~short36|) (= main_~head~0.offset 0)), 15830#true, 15831#false, 15832#(= 0 |main_#t~malloc0.offset|), 15833#(= main_~head~0.offset 0), 15834#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 15835#(and (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 15836#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 15837#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))), 15838#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0) (= 0 main_~x~0.offset)), 15839#(and (not (= main_~x~0.base |main_#t~mem35.base|)) (= main_~x~0.offset 0) (= main_~head~0.offset 0))] [2018-02-02 20:52:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:20,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:52:20,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:52:20,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:52:20,756 INFO L87 Difference]: Start difference. First operand 313 states and 364 transitions. Second operand 11 states. [2018-02-02 20:52:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:21,054 INFO L93 Difference]: Finished difference Result 458 states and 533 transitions. [2018-02-02 20:52:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:52:21,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-02-02 20:52:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:21,055 INFO L225 Difference]: With dead ends: 458 [2018-02-02 20:52:21,055 INFO L226 Difference]: Without dead ends: 446 [2018-02-02 20:52:21,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:52:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-02-02 20:52:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 297. [2018-02-02 20:52:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 20:52:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 345 transitions. [2018-02-02 20:52:21,058 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 345 transitions. Word has length 50 [2018-02-02 20:52:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:21,058 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 345 transitions. [2018-02-02 20:52:21,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:52:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 345 transitions. [2018-02-02 20:52:21,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:52:21,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:21,059 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:21,059 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1791484681, now seen corresponding path program 1 times [2018-02-02 20:52:21,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:21,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:21,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:21,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:52:21,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:21,187 INFO L182 omatonBuilderFactory]: Interpolants [16624#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 16625#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0)), 16626#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 16627#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 16628#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4)))) (= 0 main_~x~0.offset)), 16629#(= 1 (select |#valid| |main_#t~mem40.base|)), 16618#true, 16619#false, 16620#(= 0 |main_#t~malloc0.offset|), 16621#(= main_~head~0.offset 0), 16622#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 16623#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0))] [2018-02-02 20:52:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:21,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:52:21,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:52:21,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:52:21,187 INFO L87 Difference]: Start difference. First operand 297 states and 345 transitions. Second operand 12 states. [2018-02-02 20:52:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:21,541 INFO L93 Difference]: Finished difference Result 445 states and 519 transitions. [2018-02-02 20:52:21,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:52:21,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-02-02 20:52:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:21,542 INFO L225 Difference]: With dead ends: 445 [2018-02-02 20:52:21,542 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 20:52:21,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:52:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 20:52:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 306. [2018-02-02 20:52:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-02 20:52:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 356 transitions. [2018-02-02 20:52:21,546 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 356 transitions. Word has length 51 [2018-02-02 20:52:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:21,546 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 356 transitions. [2018-02-02 20:52:21,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:52:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 356 transitions. [2018-02-02 20:52:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:52:21,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:21,547 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:21,547 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:21,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1791484682, now seen corresponding path program 1 times [2018-02-02 20:52:21,548 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:21,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:21,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:21,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:52:21,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:21,663 INFO L182 omatonBuilderFactory]: Interpolants [17408#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0)), 17409#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 17410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 17411#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ 0 4))) (= 0 main_~x~0.offset)), 17412#(= |main_#t~mem40.offset| 0), 17401#true, 17402#false, 17403#(= 0 |main_#t~malloc0.offset|), 17404#(= main_~head~0.offset 0), 17405#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 17406#(and (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 17407#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0))] [2018-02-02 20:52:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:21,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:52:21,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:52:21,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:52:21,663 INFO L87 Difference]: Start difference. First operand 306 states and 356 transitions. Second operand 12 states. [2018-02-02 20:52:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:22,008 INFO L93 Difference]: Finished difference Result 444 states and 518 transitions. [2018-02-02 20:52:22,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:52:22,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-02-02 20:52:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:22,009 INFO L225 Difference]: With dead ends: 444 [2018-02-02 20:52:22,009 INFO L226 Difference]: Without dead ends: 444 [2018-02-02 20:52:22,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:52:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-02 20:52:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 306. [2018-02-02 20:52:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-02 20:52:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 355 transitions. [2018-02-02 20:52:22,013 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 355 transitions. Word has length 51 [2018-02-02 20:52:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:22,013 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 355 transitions. [2018-02-02 20:52:22,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:52:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 355 transitions. [2018-02-02 20:52:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:52:22,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:22,013 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:22,013 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:22,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1687482816, now seen corresponding path program 1 times [2018-02-02 20:52:22,014 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:22,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:22,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:52:22,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,163 INFO L182 omatonBuilderFactory]: Interpolants [18189#true, 18190#false, 18191#(= (select |#valid| main_~head~0.base) 1), 18192#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 18193#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 18194#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 18195#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|))), 18196#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 18197#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 18198#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))), 18199#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 18200#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 18201#(= 1 (select |#valid| |main_#t~mem37.base|)), 18202#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:52:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:52:22,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:52:22,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:52:22,164 INFO L87 Difference]: Start difference. First operand 306 states and 355 transitions. Second operand 14 states. [2018-02-02 20:52:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:22,646 INFO L93 Difference]: Finished difference Result 468 states and 543 transitions. [2018-02-02 20:52:22,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:52:22,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-02-02 20:52:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:22,647 INFO L225 Difference]: With dead ends: 468 [2018-02-02 20:52:22,647 INFO L226 Difference]: Without dead ends: 468 [2018-02-02 20:52:22,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:52:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-02 20:52:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 365. [2018-02-02 20:52:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 20:52:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 424 transitions. [2018-02-02 20:52:22,650 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 424 transitions. Word has length 51 [2018-02-02 20:52:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:22,651 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 424 transitions. [2018-02-02 20:52:22,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:52:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 424 transitions. [2018-02-02 20:52:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:52:22,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:22,651 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:22,651 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1687482817, now seen corresponding path program 1 times [2018-02-02 20:52:22,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:22,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:22,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:52:22,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,778 INFO L182 omatonBuilderFactory]: Interpolants [19072#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 19060#true, 19061#false, 19062#(= (select |#valid| main_~head~0.base) 1), 19063#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19064#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 19065#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 19066#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19067#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 19068#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 19069#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19070#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 19071#(and (= 0 |main_#t~mem37.offset|) (= 12 (select |#length| |main_#t~mem37.base|)))] [2018-02-02 20:52:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:52:22,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:52:22,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:52:22,779 INFO L87 Difference]: Start difference. First operand 365 states and 424 transitions. Second operand 13 states. [2018-02-02 20:52:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:23,312 INFO L93 Difference]: Finished difference Result 523 states and 606 transitions. [2018-02-02 20:52:23,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:52:23,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-02-02 20:52:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:23,313 INFO L225 Difference]: With dead ends: 523 [2018-02-02 20:52:23,313 INFO L226 Difference]: Without dead ends: 523 [2018-02-02 20:52:23,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:52:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-02-02 20:52:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 405. [2018-02-02 20:52:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-02 20:52:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 472 transitions. [2018-02-02 20:52:23,316 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 472 transitions. Word has length 51 [2018-02-02 20:52:23,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:23,316 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 472 transitions. [2018-02-02 20:52:23,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:52:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 472 transitions. [2018-02-02 20:52:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:52:23,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:23,317 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:23,317 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:23,317 INFO L82 PathProgramCache]: Analyzing trace with hash 665112027, now seen corresponding path program 1 times [2018-02-02 20:52:23,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:23,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:52:23,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:23,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:52:23,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:23,451 INFO L182 omatonBuilderFactory]: Interpolants [20017#true, 20018#false, 20019#(= 0 |main_#t~malloc0.offset|), 20020#(= main_~head~0.offset 0), 20021#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 20022#(and (not (= |main_#t~malloc4.base| main_~head~0.base)) (= main_~head~0.offset 0)), 20023#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 20024#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))), 20025#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4)))) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 20026#(= 1 (select (store |#valid| |main_#t~mem40.base| 0) main_~head~0.base)), 20027#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 20:52:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:52:23,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:52:23,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:52:23,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:52:23,452 INFO L87 Difference]: Start difference. First operand 405 states and 472 transitions. Second operand 11 states. [2018-02-02 20:52:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:23,692 INFO L93 Difference]: Finished difference Result 604 states and 708 transitions. [2018-02-02 20:52:23,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:52:23,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-02-02 20:52:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:23,693 INFO L225 Difference]: With dead ends: 604 [2018-02-02 20:52:23,694 INFO L226 Difference]: Without dead ends: 604 [2018-02-02 20:52:23,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:52:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-02-02 20:52:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 406. [2018-02-02 20:52:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-02 20:52:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 473 transitions. [2018-02-02 20:52:23,697 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 473 transitions. Word has length 53 [2018-02-02 20:52:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:23,697 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 473 transitions. [2018-02-02 20:52:23,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:52:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 473 transitions. [2018-02-02 20:52:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:52:23,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:23,697 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:23,698 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:23,698 INFO L82 PathProgramCache]: Analyzing trace with hash -590079808, now seen corresponding path program 1 times [2018-02-02 20:52:23,698 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:23,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:23,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:23,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:52:23,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:23,815 INFO L182 omatonBuilderFactory]: Interpolants [21060#true, 21061#false, 21062#(= 0 |main_#t~malloc0.offset|), 21063#(= main_~head~0.offset 0), 21064#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 21065#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem29|)), 21066#(and (or (and (= 2 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.base main_~head~0.base)) (not |main_#t~short31|)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 21067#(and (= 2 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 21068#(and (= 2 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 21069#(and (= 2 (select (select |#memory_int| main_~x~0.base) (+ 0 8))) (= 0 main_~x~0.offset)), 21070#(and (= 2 |main_#t~mem39|) (= main_~head~0.offset 0))] [2018-02-02 20:52:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:23,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:52:23,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:52:23,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:52:23,815 INFO L87 Difference]: Start difference. First operand 406 states and 473 transitions. Second operand 11 states. [2018-02-02 20:52:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:24,013 INFO L93 Difference]: Finished difference Result 427 states and 478 transitions. [2018-02-02 20:52:24,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:52:24,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 20:52:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:24,014 INFO L225 Difference]: With dead ends: 427 [2018-02-02 20:52:24,014 INFO L226 Difference]: Without dead ends: 427 [2018-02-02 20:52:24,015 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-02 20:52:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 406. [2018-02-02 20:52:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-02 20:52:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 470 transitions. [2018-02-02 20:52:24,018 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 470 transitions. Word has length 54 [2018-02-02 20:52:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:24,018 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 470 transitions. [2018-02-02 20:52:24,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:52:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 470 transitions. [2018-02-02 20:52:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:52:24,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:24,019 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:24,019 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1471925196, now seen corresponding path program 1 times [2018-02-02 20:52:24,019 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:24,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:24,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:24,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:52:24,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:24,131 INFO L182 omatonBuilderFactory]: Interpolants [21920#true, 21921#false, 21922#(= (select |#valid| main_~head~0.base) 1), 21923#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21924#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 21925#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21926#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1)), 21927#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 21928#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset))), 21929#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= (select |#valid| main_~x~0.base) 1)), 21930#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset))), 21931#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 21932#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 21933#(= 1 (select |#valid| |main_#t~mem37.base|)), 21934#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:52:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:24,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:52:24,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:52:24,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:52:24,131 INFO L87 Difference]: Start difference. First operand 406 states and 470 transitions. Second operand 15 states. [2018-02-02 20:52:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:24,730 INFO L93 Difference]: Finished difference Result 543 states and 624 transitions. [2018-02-02 20:52:24,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:52:24,731 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-02 20:52:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:24,732 INFO L225 Difference]: With dead ends: 543 [2018-02-02 20:52:24,732 INFO L226 Difference]: Without dead ends: 543 [2018-02-02 20:52:24,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=834, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:52:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-02 20:52:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 435. [2018-02-02 20:52:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-02 20:52:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 504 transitions. [2018-02-02 20:52:24,735 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 504 transitions. Word has length 54 [2018-02-02 20:52:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:24,735 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 504 transitions. [2018-02-02 20:52:24,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:52:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 504 transitions. [2018-02-02 20:52:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:52:24,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:24,736 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:24,736 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:24,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1471925195, now seen corresponding path program 1 times [2018-02-02 20:52:24,736 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:24,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:24,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:24,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:52:24,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:24,921 INFO L182 omatonBuilderFactory]: Interpolants [22949#true, 22950#false, 22951#(= (select |#valid| main_~head~0.base) 1), 22952#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22953#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 22954#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22955#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 12 (select |#length| |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22956#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 22957#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset))), 22958#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22959#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset))), 22960#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22961#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 22962#(and (= 0 |main_#t~mem37.offset|) (= 12 (select |#length| |main_#t~mem37.base|))), 22963#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset))] [2018-02-02 20:52:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:24,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:52:24,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:52:24,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:52:24,922 INFO L87 Difference]: Start difference. First operand 435 states and 504 transitions. Second operand 15 states. [2018-02-02 20:52:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:25,732 INFO L93 Difference]: Finished difference Result 602 states and 689 transitions. [2018-02-02 20:52:25,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:52:25,732 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-02 20:52:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:25,733 INFO L225 Difference]: With dead ends: 602 [2018-02-02 20:52:25,733 INFO L226 Difference]: Without dead ends: 602 [2018-02-02 20:52:25,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:52:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-02-02 20:52:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 376. [2018-02-02 20:52:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-02 20:52:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 435 transitions. [2018-02-02 20:52:25,737 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 435 transitions. Word has length 54 [2018-02-02 20:52:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:25,737 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 435 transitions. [2018-02-02 20:52:25,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:52:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 435 transitions. [2018-02-02 20:52:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:52:25,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:25,738 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:25,738 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:25,738 INFO L82 PathProgramCache]: Analyzing trace with hash 685890914, now seen corresponding path program 2 times [2018-02-02 20:52:25,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:25,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:26,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:26,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:52:26,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:26,052 INFO L182 omatonBuilderFactory]: Interpolants [23974#true, 23975#false, 23976#(= 0 |main_#t~malloc0.offset|), 23977#(= main_~head~0.offset 0), 23978#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 23979#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 23980#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23981#(and (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 23982#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23983#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1)), 23984#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 23985#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~malloc14.base|))), 23986#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 23987#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~mem16.base|))), 23988#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~x~0.base main_~head~0.base))), 23989#(= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base), 23990#(= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base), 23991#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))), 23992#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 23993#(and (= 1 (select |#valid| main_~x~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base |main_#t~mem30.base|)), 23994#(= 1 (select |#valid| |main_#t~mem32.base|))] [2018-02-02 20:52:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:26,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:52:26,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:52:26,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:52:26,053 INFO L87 Difference]: Start difference. First operand 376 states and 435 transitions. Second operand 21 states. [2018-02-02 20:52:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:26,905 INFO L93 Difference]: Finished difference Result 670 states and 772 transitions. [2018-02-02 20:52:26,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:52:26,905 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-02 20:52:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:26,906 INFO L225 Difference]: With dead ends: 670 [2018-02-02 20:52:26,906 INFO L226 Difference]: Without dead ends: 670 [2018-02-02 20:52:26,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=445, Invalid=1447, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:52:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-02-02 20:52:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 407. [2018-02-02 20:52:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-02 20:52:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 473 transitions. [2018-02-02 20:52:26,910 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 473 transitions. Word has length 56 [2018-02-02 20:52:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:26,910 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 473 transitions. [2018-02-02 20:52:26,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:52:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 473 transitions. [2018-02-02 20:52:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:52:26,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:26,911 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:26,911 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:26,911 INFO L82 PathProgramCache]: Analyzing trace with hash 685890915, now seen corresponding path program 2 times [2018-02-02 20:52:26,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:26,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:27,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:27,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:52:27,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:27,437 INFO L182 omatonBuilderFactory]: Interpolants [25120#(= |main_#t~malloc0.offset| 0), 25121#(= main_~head~0.offset 0), 25122#(and (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 25123#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25124#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 25125#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~head~0.offset 0)), 25126#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 25127#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 25128#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))), 25129#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0) (not (= main_~head~0.base |main_#t~malloc14.base|))), 25130#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 25131#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= main_~head~0.offset 0)), 25132#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))), 25133#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) (+ main_~head~0.offset 4)))), 25134#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 25135#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 25136#(and (= main_~x~0.offset 0) (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base |main_#t~mem30.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)))), 25137#(and (= main_~x~0.offset 0) (not |main_#t~short31|)), 25138#(and (= main_~x~0.offset 0) (not |main_#t~short34|)), 25118#true, 25119#false] [2018-02-02 20:52:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:27,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:52:27,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:52:27,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:52:27,438 INFO L87 Difference]: Start difference. First operand 407 states and 473 transitions. Second operand 21 states. [2018-02-02 20:52:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:28,494 INFO L93 Difference]: Finished difference Result 617 states and 713 transitions. [2018-02-02 20:52:28,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:52:28,494 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-02 20:52:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:28,496 INFO L225 Difference]: With dead ends: 617 [2018-02-02 20:52:28,496 INFO L226 Difference]: Without dead ends: 617 [2018-02-02 20:52:28,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:52:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-02-02 20:52:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 405. [2018-02-02 20:52:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-02 20:52:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 469 transitions. [2018-02-02 20:52:28,499 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 469 transitions. Word has length 56 [2018-02-02 20:52:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:28,499 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 469 transitions. [2018-02-02 20:52:28,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:52:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 469 transitions. [2018-02-02 20:52:28,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:52:28,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:28,500 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:28,500 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash 180333311, now seen corresponding path program 1 times [2018-02-02 20:52:28,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:28,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:28,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:28,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:52:28,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:28,957 INFO L182 omatonBuilderFactory]: Interpolants [26208#(and (= 0 (select |#valid| 0)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc4.base| 0) main_~head~0.base 0)) (not (= |main_#t~malloc4.base| 0)) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 26209#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) 0)) (not (= 0 main_~head~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) 0) main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0)), 26210#(and (= (store (store |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)) 0) main_~head~0.base 0) |old(#valid)|) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)) 0)) (= 0 (select |#valid| 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= 0 main_~head~0.base)) (= main_~head~0.offset 0) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4))))), 26211#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) 0) main_~head~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) 0)) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 26212#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4)))) (not (= 0 main_~x~0.base)) (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4)) 0)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) 4) 0) main_~x~0.base 0)) (= 0 main_~x~0.offset)), 26213#(and (or (and (= (store (store |#valid| |main_#t~mem40.base| 0) main_~head~0.base 0) |old(#valid)|) (not (= |main_#t~mem40.base| main_~head~0.base)) (not (= 0 main_~head~0.base))) (not (= 1 (select |#valid| |main_#t~mem40.base|)))) (not (= 0 |main_#t~mem40.base|)) (= main_~head~0.offset 0)), 26214#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0)), 26215#(= |#valid| |old(#valid)|), 26201#true, 26202#false, 26203#(= (select |#valid| 0) 0), 26204#(and (= |#valid| |old(#valid)|) (= (select |#valid| 0) 0)), 26205#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= (select |#valid| 0) 0)), 26206#(and (= (select |#valid| 0) 0) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0)), 26207#(and (= 1 (select |#valid| main_~head~0.base)) (= (select |#valid| 0) 0) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0))] [2018-02-02 20:52:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:28,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:52:28,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:52:28,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:52:28,957 INFO L87 Difference]: Start difference. First operand 405 states and 469 transitions. Second operand 15 states. [2018-02-02 20:52:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:29,483 INFO L93 Difference]: Finished difference Result 410 states and 473 transitions. [2018-02-02 20:52:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:52:29,483 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-02-02 20:52:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:29,484 INFO L225 Difference]: With dead ends: 410 [2018-02-02 20:52:29,484 INFO L226 Difference]: Without dead ends: 373 [2018-02-02 20:52:29,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:52:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-02 20:52:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-02-02 20:52:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-02 20:52:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 436 transitions. [2018-02-02 20:52:29,487 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 436 transitions. Word has length 57 [2018-02-02 20:52:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:29,487 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 436 transitions. [2018-02-02 20:52:29,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:52:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 436 transitions. [2018-02-02 20:52:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:52:29,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:29,487 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:29,487 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:29,487 INFO L82 PathProgramCache]: Analyzing trace with hash -961357713, now seen corresponding path program 2 times [2018-02-02 20:52:29,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:29,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:30,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:30,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:52:30,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:30,013 INFO L182 omatonBuilderFactory]: Interpolants [27017#true, 27018#false, 27019#(= 0 |main_#t~malloc0.offset|), 27020#(= main_~head~0.offset 0), 27021#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 27022#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 27023#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 27024#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 27025#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 27026#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.offset (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27027#(and (not (= main_~x~0.offset (+ main_~head~0.offset 4))) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (or (= |main_#t~malloc14.base| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)))))), 27028#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.offset (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~x~0.base) 1)), 27029#(and (or (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1)), 27030#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 27031#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= |main_#t~malloc14.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~malloc14.base|))), 27032#(and (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 27033#(and (or (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~head~0.base |main_#t~mem16.base|))), 27034#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~x~0.base main_~head~0.base))), 27035#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base main_~head~0.base))), 27036#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)))), 27037#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))), 27038#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 27039#(= (select |#valid| |main_#t~mem32.base|) 1)] [2018-02-02 20:52:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:30,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:52:30,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:52:30,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:52:30,014 INFO L87 Difference]: Start difference. First operand 373 states and 436 transitions. Second operand 23 states. [2018-02-02 20:52:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:31,691 INFO L93 Difference]: Finished difference Result 1067 states and 1243 transitions. [2018-02-02 20:52:31,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:52:31,691 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-02-02 20:52:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:31,693 INFO L225 Difference]: With dead ends: 1067 [2018-02-02 20:52:31,693 INFO L226 Difference]: Without dead ends: 1067 [2018-02-02 20:52:31,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=772, Invalid=2768, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:52:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-02-02 20:52:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 404. [2018-02-02 20:52:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-02-02 20:52:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 474 transitions. [2018-02-02 20:52:31,697 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 474 transitions. Word has length 59 [2018-02-02 20:52:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:31,698 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 474 transitions. [2018-02-02 20:52:31,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:52:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 474 transitions. [2018-02-02 20:52:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:52:31,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:31,698 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:31,698 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash -961357712, now seen corresponding path program 2 times [2018-02-02 20:52:31,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:31,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:32,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:32,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:52:32,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:32,461 INFO L182 omatonBuilderFactory]: Interpolants [28585#true, 28586#false, 28587#(= |main_#t~malloc0.offset| 0), 28588#(= main_~head~0.offset 0), 28589#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28590#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (= 12 (select |#length| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28591#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28592#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#length| |main_#t~mem6.base|) 12) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))), 28593#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28594#(and (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4))))), 28595#(and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (<= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 28596#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4))))), 28597#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem16.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 28598#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 28599#(and (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0) (not (= main_~head~0.base |main_#t~malloc14.base|))), 28600#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 28601#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem16.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 28602#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 28603#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) (+ main_~head~0.offset 4))) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 28604#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 28605#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 main_~x~0.offset)), 28606#(and (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= |main_#t~mem30.offset| main_~x~0.offset) (= 0 main_~x~0.offset)), 28607#(and (= |main_#t~mem32.offset| 0) (<= 12 (select |#length| |main_#t~mem32.base|)))] [2018-02-02 20:52:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:32,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:52:32,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:52:32,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:52:32,462 INFO L87 Difference]: Start difference. First operand 404 states and 474 transitions. Second operand 23 states. [2018-02-02 20:52:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:33,742 INFO L93 Difference]: Finished difference Result 634 states and 742 transitions. [2018-02-02 20:52:33,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:52:33,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-02-02 20:52:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:33,743 INFO L225 Difference]: With dead ends: 634 [2018-02-02 20:52:33,743 INFO L226 Difference]: Without dead ends: 634 [2018-02-02 20:52:33,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=322, Invalid=1400, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:52:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-02-02 20:52:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 404. [2018-02-02 20:52:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-02-02 20:52:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 473 transitions. [2018-02-02 20:52:33,747 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 473 transitions. Word has length 59 [2018-02-02 20:52:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:33,747 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 473 transitions. [2018-02-02 20:52:33,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:52:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 473 transitions. [2018-02-02 20:52:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:52:33,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:33,748 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:33,748 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:33,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1079903086, now seen corresponding path program 1 times [2018-02-02 20:52:33,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:33,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:34,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:34,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:52:34,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:34,414 INFO L182 omatonBuilderFactory]: Interpolants [29696#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29697#(and (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29698#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0) (not (= main_~head~0.base |main_#t~malloc14.base|))), 29699#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 29700#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~mem16.base|)) (= main_~head~0.offset 0)), 29701#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29702#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0)), 29703#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~head~0.offset 0)), 29704#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 29705#(and (= main_~x~0.offset 0) (= main_~x~0.base |main_#t~mem30.base|) (= |main_#t~mem30.offset| main_~x~0.offset)), 29706#(and (= main_~x~0.offset 0) (not |main_#t~short31|)), 29707#(and (= main_~x~0.offset 0) (not |main_#t~short34|)), 29684#true, 29685#false, 29686#(= 0 |main_#t~malloc0.offset|), 29687#(= main_~head~0.offset 0), 29688#(and (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 29689#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 29690#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 29691#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)) main_~head~0.base) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 29692#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 29693#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 29694#(and (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29695#(and (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4)) main_~head~0.base) (not (= main_~head~0.base |main_#t~malloc20.base|)) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0))] [2018-02-02 20:52:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:34,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:52:34,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:52:34,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:52:34,414 INFO L87 Difference]: Start difference. First operand 404 states and 473 transitions. Second operand 24 states. [2018-02-02 20:52:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:35,813 INFO L93 Difference]: Finished difference Result 643 states and 748 transitions. [2018-02-02 20:52:35,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:52:35,814 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-02-02 20:52:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:35,815 INFO L225 Difference]: With dead ends: 643 [2018-02-02 20:52:35,815 INFO L226 Difference]: Without dead ends: 643 [2018-02-02 20:52:35,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=533, Invalid=2223, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:52:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-02-02 20:52:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 407. [2018-02-02 20:52:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-02 20:52:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 475 transitions. [2018-02-02 20:52:35,820 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 475 transitions. Word has length 59 [2018-02-02 20:52:35,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:35,820 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 475 transitions. [2018-02-02 20:52:35,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:52:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 475 transitions. [2018-02-02 20:52:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:52:35,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:35,821 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:35,821 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:35,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1411874676, now seen corresponding path program 1 times [2018-02-02 20:52:35,821 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:35,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:36,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:36,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:52:36,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:36,146 INFO L182 omatonBuilderFactory]: Interpolants [30816#true, 30817#false, 30818#(= 0 |main_#t~malloc0.offset|), 30819#(= main_~head~0.offset 0), 30820#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 30821#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 30822#(and (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 30823#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 30824#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 0 |main_#t~mem16.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30825#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 30826#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30827#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 30828#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30829#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 30830#(and (= 1 (select |#valid| |main_#t~mem37.base|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)) |main_#t~mem37.base|) (= 0 |main_#t~mem37.offset|)), 30831#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 30832#(and (= 1 (select |#valid| main_~x~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))), 30833#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~x~0.offset 0)), 30834#(= 1 (select |#valid| |main_#t~mem32.base|))] [2018-02-02 20:52:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:36,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:36,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:36,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:36,147 INFO L87 Difference]: Start difference. First operand 407 states and 475 transitions. Second operand 19 states. [2018-02-02 20:52:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:37,002 INFO L93 Difference]: Finished difference Result 660 states and 757 transitions. [2018-02-02 20:52:37,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:52:37,002 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-02-02 20:52:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:37,003 INFO L225 Difference]: With dead ends: 660 [2018-02-02 20:52:37,003 INFO L226 Difference]: Without dead ends: 660 [2018-02-02 20:52:37,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:52:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-02-02 20:52:37,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 479. [2018-02-02 20:52:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-02-02 20:52:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 560 transitions. [2018-02-02 20:52:37,007 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 560 transitions. Word has length 59 [2018-02-02 20:52:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:37,007 INFO L432 AbstractCegarLoop]: Abstraction has 479 states and 560 transitions. [2018-02-02 20:52:37,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 560 transitions. [2018-02-02 20:52:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:52:37,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:37,008 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:37,008 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1411874675, now seen corresponding path program 1 times [2018-02-02 20:52:37,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:37,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:37,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:37,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:52:37,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:37,302 INFO L182 omatonBuilderFactory]: Interpolants [32032#(and (= main_~x~0.offset 0) (not |main_#t~short34|)), 32014#true, 32015#false, 32016#(= 0 |main_#t~malloc0.offset|), 32017#(= main_~head~0.offset 0), 32018#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 32019#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 32020#(and (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 32021#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 32022#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 0 |main_#t~mem16.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32023#(and (or (not (= main_~head~0.offset main_~x~0.offset)) (and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 32024#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32025#(and (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (<= main_~head~0.offset main_~x~0.offset)), 32026#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32027#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 32028#(and (= |main_#t~mem37.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 4))) (= (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)) |main_#t~mem37.base|) (= 0 |main_#t~mem37.offset|)), 32029#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 32030#(and (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= |main_#t~mem30.offset| main_~x~0.offset)), 32031#(and (= main_~x~0.offset 0) (not |main_#t~short31|))] [2018-02-02 20:52:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:37,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:37,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:37,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:37,302 INFO L87 Difference]: Start difference. First operand 479 states and 560 transitions. Second operand 19 states. [2018-02-02 20:52:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:38,364 INFO L93 Difference]: Finished difference Result 635 states and 726 transitions. [2018-02-02 20:52:38,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:52:38,364 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-02-02 20:52:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:38,365 INFO L225 Difference]: With dead ends: 635 [2018-02-02 20:52:38,365 INFO L226 Difference]: Without dead ends: 635 [2018-02-02 20:52:38,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=1526, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:52:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-02-02 20:52:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 471. [2018-02-02 20:52:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-02 20:52:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 548 transitions. [2018-02-02 20:52:38,369 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 548 transitions. Word has length 59 [2018-02-02 20:52:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:38,369 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 548 transitions. [2018-02-02 20:52:38,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 548 transitions. [2018-02-02 20:52:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:52:38,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:38,370 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:38,370 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1743545360, now seen corresponding path program 1 times [2018-02-02 20:52:38,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:38,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:38,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:38,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:52:38,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:38,513 INFO L182 omatonBuilderFactory]: Interpolants [33189#true, 33190#false, 33191#(= (select |#valid| main_~head~0.base) 1), 33192#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 33193#(and (not (= |main_#t~malloc14.base| 0)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 33194#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (= main_~x~0.base main_~head~0.base)), 33195#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base |main_#t~mem16.base|))), 33196#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~x~0.base main_~head~0.base))), 33197#(not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset) 0)), 33198#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)), 33199#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)), 33200#(not (= |main_#t~mem37.base| 0)), 33201#(not (= main_~x~0.base 0))] [2018-02-02 20:52:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:38,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:52:38,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:52:38,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:52:38,513 INFO L87 Difference]: Start difference. First operand 471 states and 548 transitions. Second operand 13 states. [2018-02-02 20:52:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:38,950 INFO L93 Difference]: Finished difference Result 589 states and 677 transitions. [2018-02-02 20:52:38,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:52:38,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-02-02 20:52:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:38,951 INFO L225 Difference]: With dead ends: 589 [2018-02-02 20:52:38,951 INFO L226 Difference]: Without dead ends: 589 [2018-02-02 20:52:38,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:52:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-02-02 20:52:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 471. [2018-02-02 20:52:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-02 20:52:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 546 transitions. [2018-02-02 20:52:38,955 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 546 transitions. Word has length 60 [2018-02-02 20:52:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:38,955 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 546 transitions. [2018-02-02 20:52:38,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:52:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 546 transitions. [2018-02-02 20:52:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:52:38,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:38,956 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:38,956 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2102587071, now seen corresponding path program 1 times [2018-02-02 20:52:38,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:38,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:39,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:39,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:52:39,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:39,716 INFO L182 omatonBuilderFactory]: Interpolants [34304#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 main_~x~0.offset)), 34305#(= (select |#valid| |main_#t~mem32.base|) 1), 34280#true, 34281#false, 34282#(= 0 |main_#t~malloc0.offset|), 34283#(= main_~head~0.offset 0), 34284#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 34285#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 34286#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 34287#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4))) 1)), 34288#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 34289#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4))) 1) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 34290#(and (= 0 main_~head~0.offset) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (or (= |main_#t~malloc14.base| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)))))), 34291#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~x~0.base) 1)), 34292#(and (or (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 34293#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 34294#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 34295#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))))), 34296#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4))))), 34297#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= |main_#t~malloc14.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0) (not (= main_~head~0.base |main_#t~malloc14.base|))), 34298#(and (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 34299#(and (or (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= main_~head~0.offset 0)), 34300#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 34301#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 34302#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 34303#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0))] [2018-02-02 20:52:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:39,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:52:39,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:52:39,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:52:39,716 INFO L87 Difference]: Start difference. First operand 471 states and 546 transitions. Second operand 26 states. [2018-02-02 20:52:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:43,099 INFO L93 Difference]: Finished difference Result 1198 states and 1379 transitions. [2018-02-02 20:52:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-02 20:52:43,099 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-02 20:52:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:43,101 INFO L225 Difference]: With dead ends: 1198 [2018-02-02 20:52:43,101 INFO L226 Difference]: Without dead ends: 1198 [2018-02-02 20:52:43,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1499, Invalid=5811, Unknown=0, NotChecked=0, Total=7310 [2018-02-02 20:52:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-02-02 20:52:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 487. [2018-02-02 20:52:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-02-02 20:52:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 566 transitions. [2018-02-02 20:52:43,109 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 566 transitions. Word has length 62 [2018-02-02 20:52:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:43,109 INFO L432 AbstractCegarLoop]: Abstraction has 487 states and 566 transitions. [2018-02-02 20:52:43,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:52:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 566 transitions. [2018-02-02 20:52:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:52:43,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:43,109 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:43,109 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2102587070, now seen corresponding path program 1 times [2018-02-02 20:52:43,110 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:43,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:44,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:44,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:52:44,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:44,089 INFO L182 omatonBuilderFactory]: Interpolants [36111#true, 36112#false, 36113#(= 0 |main_#t~malloc0.offset|), 36114#(= main_~head~0.offset 0), 36115#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 36116#(and (= 12 (select |#length| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 36117#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 36118#(and (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 12 (select |#length| |main_#t~mem6.base|)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 36119#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 36120#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 36121#(and (= 0 main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base |main_#t~malloc14.base|))), 36122#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 36123#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 12 (select |#length| |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 36124#(and (= 12 (select |#length| main_~x~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))), 36125#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 36126#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~malloc20.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 36127#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 36128#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 36129#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0) (not (= main_~head~0.base |main_#t~malloc14.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4))))), 36130#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 36131#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= main_~head~0.offset 0)), 36132#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))), 36133#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) (+ main_~head~0.offset 4)))), 36134#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 36135#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 36136#(and (= |main_#t~mem32.offset| 0) (= (select |#length| |main_#t~mem32.base|) 12))] [2018-02-02 20:52:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:44,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:52:44,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:52:44,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:52:44,090 INFO L87 Difference]: Start difference. First operand 487 states and 566 transitions. Second operand 26 states. [2018-02-02 20:52:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:46,274 INFO L93 Difference]: Finished difference Result 1005 states and 1164 transitions. [2018-02-02 20:52:46,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:52:46,275 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-02 20:52:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:46,276 INFO L225 Difference]: With dead ends: 1005 [2018-02-02 20:52:46,276 INFO L226 Difference]: Without dead ends: 1005 [2018-02-02 20:52:46,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=870, Invalid=2912, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:52:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2018-02-02 20:52:46,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 487. [2018-02-02 20:52:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-02-02 20:52:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 566 transitions. [2018-02-02 20:52:46,282 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 566 transitions. Word has length 62 [2018-02-02 20:52:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:46,283 INFO L432 AbstractCegarLoop]: Abstraction has 487 states and 566 transitions. [2018-02-02 20:52:46,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:52:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 566 transitions. [2018-02-02 20:52:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:52:46,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:46,283 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:46,283 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash 601561927, now seen corresponding path program 2 times [2018-02-02 20:52:46,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:46,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:47,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:47,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:52:47,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:47,018 INFO L182 omatonBuilderFactory]: Interpolants [37701#true, 37702#false, 37703#(= 0 |main_#t~malloc0.offset|), 37704#(= main_~head~0.offset 0), 37705#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 37706#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 37707#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 37708#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem6.base| (store (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4))) 1)), 37709#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 37710#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4))) 1) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 37711#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 37712#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 37713#(and (not (= main_~head~0.base |main_#t~mem16.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 37714#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))))), 37715#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= |main_#t~malloc14.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (not (= main_~head~0.base |main_#t~malloc14.base|))), 37716#(and (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 37717#(and (or (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 37718#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 37719#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4))))) (= main_~head~0.offset 0)), 37720#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 37721#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 37722#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 37723#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 main_~x~0.offset)), 37724#(= (select |#valid| |main_#t~mem32.base|) 1)] [2018-02-02 20:52:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:47,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:52:47,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:52:47,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:52:47,018 INFO L87 Difference]: Start difference. First operand 487 states and 566 transitions. Second operand 24 states. [2018-02-02 20:52:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:49,467 INFO L93 Difference]: Finished difference Result 970 states and 1111 transitions. [2018-02-02 20:52:49,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 20:52:49,467 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 20:52:49,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:49,469 INFO L225 Difference]: With dead ends: 970 [2018-02-02 20:52:49,469 INFO L226 Difference]: Without dead ends: 970 [2018-02-02 20:52:49,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1243, Invalid=4609, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 20:52:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-02-02 20:52:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 471. [2018-02-02 20:52:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-02 20:52:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 545 transitions. [2018-02-02 20:52:49,473 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 545 transitions. Word has length 62 [2018-02-02 20:52:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:49,474 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 545 transitions. [2018-02-02 20:52:49,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:52:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 545 transitions. [2018-02-02 20:52:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:52:49,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:49,474 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:49,474 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:49,474 INFO L82 PathProgramCache]: Analyzing trace with hash 601561928, now seen corresponding path program 2 times [2018-02-02 20:52:49,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:49,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:52:50,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:50,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:52:50,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:50,307 INFO L182 omatonBuilderFactory]: Interpolants [39272#true, 39273#false, 39274#(= |main_#t~malloc0.offset| 0), 39275#(= main_~head~0.offset 0), 39276#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 39277#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= main_~head~0.offset |main_#t~malloc4.offset|) (= 12 (select |#length| |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 39278#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) 1) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 39279#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 12 (select |#length| |main_#t~mem6.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))), 39280#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) 1) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 39281#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4))) 1) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 39282#(and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~head~0.offset 4)))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc14.base|))), 39283#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~head~0.offset 4)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~head~0.offset 4))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 39284#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1)), 39285#(and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) (+ main_~head~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 39286#(and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc14.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) (+ main_~head~0.offset 4))))), 39287#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 39288#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) (+ main_~head~0.offset 4)))) (not (= main_~head~0.base |main_#t~malloc20.base|)) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) (+ main_~head~0.offset 4)))), 39289#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))))), 39290#(and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) (+ main_~head~0.offset 4))))), 39291#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))) (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))), 39292#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 39293#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= |main_#t~mem30.offset| main_~x~0.offset) (= 0 main_~x~0.offset)), 39294#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)))), 39295#(and (= |main_#t~mem32.offset| 0) (= 12 (select |#length| |main_#t~mem32.base|)))] [2018-02-02 20:52:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:52:50,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:52:50,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:52:50,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:52:50,308 INFO L87 Difference]: Start difference. First operand 471 states and 545 transitions. Second operand 24 states. [2018-02-02 20:52:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:51,966 INFO L93 Difference]: Finished difference Result 738 states and 850 transitions. [2018-02-02 20:52:51,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:52:51,966 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 20:52:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:51,967 INFO L225 Difference]: With dead ends: 738 [2018-02-02 20:52:51,967 INFO L226 Difference]: Without dead ends: 738 [2018-02-02 20:52:51,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=431, Invalid=2019, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:52:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-02-02 20:52:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 443. [2018-02-02 20:52:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:52:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 511 transitions. [2018-02-02 20:52:51,971 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 511 transitions. Word has length 62 [2018-02-02 20:52:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:51,971 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 511 transitions. [2018-02-02 20:52:51,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:52:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 511 transitions. [2018-02-02 20:52:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:52:51,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:51,972 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:51,972 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1540878592, now seen corresponding path program 1 times [2018-02-02 20:52:51,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:51,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:52,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:52,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:52:52,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:52,368 INFO L182 omatonBuilderFactory]: Interpolants [40544#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 40545#(and (= 0 |main_#t~mem37.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4))))), 40546#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 main_~x~0.offset)), 40547#(= 1 (select |#valid| |main_#t~mem32.base|)), 40529#true, 40530#false, 40531#(= 0 |main_#t~malloc0.offset|), 40532#(= main_~head~0.offset 0), 40533#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 40534#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 40535#(and (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 40536#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 40537#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem16.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 40538#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.offset main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 40539#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 40540#(and (= 1 (select |#valid| |main_#t~malloc20.base|)) (not (= main_~head~0.base |main_#t~malloc20.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc20.base|)) (= main_~head~0.offset 0)), 40541#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 40542#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 40543#(and (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))))] [2018-02-02 20:52:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:52,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:52,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:52,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:52,369 INFO L87 Difference]: Start difference. First operand 443 states and 511 transitions. Second operand 19 states. [2018-02-02 20:52:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:53,365 INFO L93 Difference]: Finished difference Result 590 states and 672 transitions. [2018-02-02 20:52:53,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:52:53,365 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-02-02 20:52:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:53,366 INFO L225 Difference]: With dead ends: 590 [2018-02-02 20:52:53,366 INFO L226 Difference]: Without dead ends: 590 [2018-02-02 20:52:53,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=377, Invalid=1603, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:52:53,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-02-02 20:52:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 443. [2018-02-02 20:52:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:52:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 509 transitions. [2018-02-02 20:52:53,370 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 509 transitions. Word has length 62 [2018-02-02 20:52:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:53,370 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 509 transitions. [2018-02-02 20:52:53,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 509 transitions. [2018-02-02 20:52:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:52:53,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:53,370 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:53,371 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:53,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1540878591, now seen corresponding path program 1 times [2018-02-02 20:52:53,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:53,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:53,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:53,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:52:53,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:53,821 INFO L182 omatonBuilderFactory]: Interpolants [41633#true, 41634#false, 41635#(= 0 |main_#t~malloc0.offset|), 41636#(= main_~head~0.offset 0), 41637#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 41638#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 41639#(and (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 41640#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 41641#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem16.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41642#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41643#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 41644#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (= 0 |main_#t~malloc20.offset|) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc20.base|)) (= main_~head~0.offset 0) (= 12 (select |#length| |main_#t~malloc20.base|))), 41645#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)))), 41646#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 41647#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))))), 41648#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4))))), 41649#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 4))) (= 0 |main_#t~mem37.offset|)), 41650#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 41651#(and (= |main_#t~mem32.offset| 0) (= 12 (select |#length| |main_#t~mem32.base|)))] [2018-02-02 20:52:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:53,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:53,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:53,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:53,821 INFO L87 Difference]: Start difference. First operand 443 states and 509 transitions. Second operand 19 states. [2018-02-02 20:52:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:54,862 INFO L93 Difference]: Finished difference Result 594 states and 674 transitions. [2018-02-02 20:52:54,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:52:54,862 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-02-02 20:52:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:54,864 INFO L225 Difference]: With dead ends: 594 [2018-02-02 20:52:54,864 INFO L226 Difference]: Without dead ends: 594 [2018-02-02 20:52:54,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:52:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-02-02 20:52:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 443. [2018-02-02 20:52:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:52:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 507 transitions. [2018-02-02 20:52:54,867 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 507 transitions. Word has length 62 [2018-02-02 20:52:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:54,867 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 507 transitions. [2018-02-02 20:52:54,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 507 transitions. [2018-02-02 20:52:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:52:54,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:54,867 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:54,868 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2039391260, now seen corresponding path program 1 times [2018-02-02 20:52:54,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:54,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:55,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:55,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:52:55,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:55,021 INFO L182 omatonBuilderFactory]: Interpolants [42729#true, 42730#false, 42731#(= (select |#valid| main_~head~0.base) 1), 42732#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 42733#(and (not (= |main_#t~malloc14.base| 0)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 42734#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 42735#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1)), 42736#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 42737#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset) 0))), 42738#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))))), 42739#(not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset) 0)), 42740#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)), 42741#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)), 42742#(not (= |main_#t~mem37.base| 0)), 42743#(not (= main_~x~0.base 0))] [2018-02-02 20:52:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:55,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:52:55,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:52:55,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:52:55,022 INFO L87 Difference]: Start difference. First operand 443 states and 507 transitions. Second operand 15 states. [2018-02-02 20:52:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:55,683 INFO L93 Difference]: Finished difference Result 549 states and 626 transitions. [2018-02-02 20:52:55,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:52:55,683 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-02-02 20:52:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:55,684 INFO L225 Difference]: With dead ends: 549 [2018-02-02 20:52:55,684 INFO L226 Difference]: Without dead ends: 549 [2018-02-02 20:52:55,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:52:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-02-02 20:52:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 443. [2018-02-02 20:52:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:52:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 505 transitions. [2018-02-02 20:52:55,688 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 505 transitions. Word has length 63 [2018-02-02 20:52:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:55,688 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 505 transitions. [2018-02-02 20:52:55,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:52:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 505 transitions. [2018-02-02 20:52:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:52:55,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:55,688 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:55,688 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:55,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2119679967, now seen corresponding path program 2 times [2018-02-02 20:52:55,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:55,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:55,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:55,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:52:55,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:55,828 INFO L182 omatonBuilderFactory]: Interpolants [43776#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))), 43777#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 43778#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 43779#(= 1 (select |#valid| |main_#t~mem37.base|)), 43780#(= 1 (select |#valid| main_~x~0.base)), 43764#true, 43765#false, 43766#(= (select |#valid| main_~head~0.base) 1), 43767#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 43768#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 43769#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 43770#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1)), 43771#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 43772#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc14.base|))), 43773#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 43774#(and (not (= main_~head~0.base |main_#t~mem16.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 43775#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)))] [2018-02-02 20:52:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:55,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:52:55,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:52:55,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:52:55,828 INFO L87 Difference]: Start difference. First operand 443 states and 505 transitions. Second operand 17 states. [2018-02-02 20:52:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:56,382 INFO L93 Difference]: Finished difference Result 660 states and 752 transitions. [2018-02-02 20:52:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:52:56,382 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-02-02 20:52:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:56,384 INFO L225 Difference]: With dead ends: 660 [2018-02-02 20:52:56,384 INFO L226 Difference]: Without dead ends: 660 [2018-02-02 20:52:56,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:52:56,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-02-02 20:52:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 526. [2018-02-02 20:52:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-02-02 20:52:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 602 transitions. [2018-02-02 20:52:56,387 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 602 transitions. Word has length 64 [2018-02-02 20:52:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:56,388 INFO L432 AbstractCegarLoop]: Abstraction has 526 states and 602 transitions. [2018-02-02 20:52:56,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:52:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 602 transitions. [2018-02-02 20:52:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:52:56,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:56,388 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:56,388 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2119679966, now seen corresponding path program 2 times [2018-02-02 20:52:56,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:56,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:56,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:56,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:52:56,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:56,833 INFO L182 omatonBuilderFactory]: Interpolants [44999#true, 45000#false, 45001#(= 12 (select |#length| |main_#t~malloc0.base|)), 45002#(= (select |#length| main_~head~0.base) 12), 45003#(and (= (select |#length| main_~head~0.base) 12) (= (select |#valid| main_~head~0.base) 1)), 45004#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1) (= (select |#length| main_~x~0.base) 12)), 45005#(and (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= (select |#length| main_~x~0.base) (select |#length| |main_#t~malloc14.base|)) (= (select |#length| main_~x~0.base) 12)), 45006#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1) (= (select |#length| main_~x~0.base) 12)), 45007#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 12 (select |#length| |main_#t~mem16.base|)) (= (select |#length| |main_#t~mem16.base|) (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 45008#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~head~0.base) (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#length| main_~x~0.base) 12) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 45009#(and (<= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc14.base|))), 45010#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 45011#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 45012#(and (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 45013#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)))), 45014#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 45015#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 45016#(and (= 0 |main_#t~mem37.offset|) (<= 12 (select |#length| |main_#t~mem37.base|))), 45017#(and (<= 12 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-02-02 20:52:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:56,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:56,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:56,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:56,833 INFO L87 Difference]: Start difference. First operand 526 states and 602 transitions. Second operand 19 states. [2018-02-02 20:52:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:57,732 INFO L93 Difference]: Finished difference Result 722 states and 820 transitions. [2018-02-02 20:52:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:52:57,732 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-02-02 20:52:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:57,733 INFO L225 Difference]: With dead ends: 722 [2018-02-02 20:52:57,733 INFO L226 Difference]: Without dead ends: 722 [2018-02-02 20:52:57,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:52:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-02-02 20:52:57,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 542. [2018-02-02 20:52:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-02-02 20:52:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 624 transitions. [2018-02-02 20:52:57,750 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 624 transitions. Word has length 64 [2018-02-02 20:52:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:57,750 INFO L432 AbstractCegarLoop]: Abstraction has 542 states and 624 transitions. [2018-02-02 20:52:57,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 624 transitions. [2018-02-02 20:52:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:52:57,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:57,751 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:57,751 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:57,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2027133485, now seen corresponding path program 1 times [2018-02-02 20:52:57,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:57,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:58,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:58,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:52:58,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:58,130 INFO L182 omatonBuilderFactory]: Interpolants [46336#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset |main_#t~mem16.offset|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)), 46337#(or (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 46338#(or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)))), 46339#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)))), 46340#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 46341#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 46342#(or (= 1 (select |#valid| |main_#t~mem37.base|)) (and (= 0 |main_#t~mem37.offset|) (= 0 |main_#t~mem37.base|))), 46343#(or (= 1 (select |#valid| main_~x~0.base)) (and (= 0 main_~x~0.base) (= 0 main_~x~0.offset))), 46344#(= 1 (select |#valid| main_~x~0.base)), 46320#true, 46321#false, 46322#(= |main_#t~malloc0.offset| 0), 46323#(= main_~head~0.offset 0), 46324#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 46325#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 46326#(and (= main_~x~0.offset main_~head~0.offset) (= |main_#t~malloc14.offset| 0) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 46327#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 46328#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 46329#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 46330#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) main_~head~0.offset) 0)), 46331#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 46332#(and (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset) 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 46333#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 46334#(and (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset |main_#t~malloc14.offset|) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset))), 46335#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:52:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:58,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:52:58,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:52:58,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:52:58,131 INFO L87 Difference]: Start difference. First operand 542 states and 624 transitions. Second operand 25 states. [2018-02-02 20:52:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:59,778 INFO L93 Difference]: Finished difference Result 755 states and 867 transitions. [2018-02-02 20:52:59,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:52:59,778 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-02-02 20:52:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:59,779 INFO L225 Difference]: With dead ends: 755 [2018-02-02 20:52:59,779 INFO L226 Difference]: Without dead ends: 755 [2018-02-02 20:52:59,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=802, Invalid=2620, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:52:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-02-02 20:52:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 637. [2018-02-02 20:52:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-02-02 20:52:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 733 transitions. [2018-02-02 20:52:59,784 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 733 transitions. Word has length 67 [2018-02-02 20:52:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:59,784 INFO L432 AbstractCegarLoop]: Abstraction has 637 states and 733 transitions. [2018-02-02 20:52:59,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:52:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 733 transitions. [2018-02-02 20:52:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:52:59,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:59,785 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:59,785 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:52:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2027133486, now seen corresponding path program 1 times [2018-02-02 20:52:59,785 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:59,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:53:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:00,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:53:00,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:53:00,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:53:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:00,100 INFO L182 omatonBuilderFactory]: Interpolants [47808#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 47809#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 47810#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 47811#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 12 (select |#length| |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47812#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 47813#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 47814#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc20.base|)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 47815#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 47816#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 47817#(and (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc14.base|))), 47818#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47819#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47820#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 47821#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 47822#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47823#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 47824#(and (= 0 |main_#t~mem37.offset|) (= 12 (select |#length| |main_#t~mem37.base|))), 47825#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 47805#true, 47806#false, 47807#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 20:53:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:00,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:53:00,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:53:00,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:53:00,100 INFO L87 Difference]: Start difference. First operand 637 states and 733 transitions. Second operand 21 states. [2018-02-02 20:53:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:53:01,186 INFO L93 Difference]: Finished difference Result 857 states and 987 transitions. [2018-02-02 20:53:01,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:53:01,186 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-02-02 20:53:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:53:01,188 INFO L225 Difference]: With dead ends: 857 [2018-02-02 20:53:01,188 INFO L226 Difference]: Without dead ends: 857 [2018-02-02 20:53:01,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:53:01,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-02-02 20:53:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 613. [2018-02-02 20:53:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-02-02 20:53:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 705 transitions. [2018-02-02 20:53:01,192 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 705 transitions. Word has length 67 [2018-02-02 20:53:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:53:01,192 INFO L432 AbstractCegarLoop]: Abstraction has 613 states and 705 transitions. [2018-02-02 20:53:01,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:53:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 705 transitions. [2018-02-02 20:53:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:53:01,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:53:01,193 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:53:01,193 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:53:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1803151029, now seen corresponding path program 3 times [2018-02-02 20:53:01,193 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:53:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:53:01,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:53:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:01,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:53:01,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:53:01,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:53:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:01,360 INFO L182 omatonBuilderFactory]: Interpolants [49344#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 49345#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))), 49346#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 49347#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 49348#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|))), 49349#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 49350#(and (= 0 |main_#t~mem37.offset|) (= 0 |main_#t~mem37.base|)), 49351#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 49336#true, 49337#false, 49338#(= (select |#valid| main_~head~0.base) 1), 49339#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 49340#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 49341#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 49342#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.offset|) (not (= main_~head~0.base |main_#t~mem16.base|))), 49343#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))] [2018-02-02 20:53:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:01,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:53:01,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:53:01,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:53:01,361 INFO L87 Difference]: Start difference. First operand 613 states and 705 transitions. Second operand 16 states. [2018-02-02 20:53:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:53:02,136 INFO L93 Difference]: Finished difference Result 673 states and 764 transitions. [2018-02-02 20:53:02,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:53:02,136 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-02 20:53:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:53:02,137 INFO L225 Difference]: With dead ends: 673 [2018-02-02 20:53:02,137 INFO L226 Difference]: Without dead ends: 673 [2018-02-02 20:53:02,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:53:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-02-02 20:53:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 637. [2018-02-02 20:53:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-02-02 20:53:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 729 transitions. [2018-02-02 20:53:02,141 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 729 transitions. Word has length 67 [2018-02-02 20:53:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:53:02,142 INFO L432 AbstractCegarLoop]: Abstraction has 637 states and 729 transitions. [2018-02-02 20:53:02,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:53:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 729 transitions. [2018-02-02 20:53:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:53:02,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:53:02,142 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:53:02,142 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:53:02,142 INFO L82 PathProgramCache]: Analyzing trace with hash 837959220, now seen corresponding path program 2 times [2018-02-02 20:53:02,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:53:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:53:02,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:53:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:02,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:53:02,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:53:02,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:53:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:02,619 INFO L182 omatonBuilderFactory]: Interpolants [50692#true, 50693#false, 50694#(= 0 |main_#t~malloc0.offset|), 50695#(= 0 main_~head~0.offset), 50696#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 50697#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 50698#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 main_~head~0.offset) (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 50699#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 50700#(and (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 12 (select |#length| |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50701#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 50702#(and (= 0 main_~head~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc14.base|)) (= (select |#length| main_~x~0.base) 12)), 50703#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~x~0.base) 12)) (and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50704#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50705#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 50706#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset))) (or (not (= main_~head~0.base |main_#t~malloc20.base|)) (= |main_#t~malloc20.offset| main_~head~0.offset))), 50707#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (or (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)) main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 50708#(or (and (= |main_#t~mem22.offset| main_~head~0.offset) (= |main_#t~mem22.base| main_~head~0.base)) (and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)))), 50709#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 50710#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 50711#(or (and (= 0 |main_#t~mem37.offset|) (= 12 (select |#length| |main_#t~mem37.base|))) (and (= 0 |main_#t~mem37.offset|) (= 0 |main_#t~mem37.base|))), 50712#(or (and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)) (and (= 0 main_~x~0.base) (= 0 main_~x~0.offset))), 50713#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 20:53:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:02,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:53:02,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:53:02,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:53:02,620 INFO L87 Difference]: Start difference. First operand 637 states and 729 transitions. Second operand 22 states. [2018-02-02 20:53:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:53:04,800 INFO L93 Difference]: Finished difference Result 1144 states and 1313 transitions. [2018-02-02 20:53:04,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:53:04,800 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-02 20:53:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:53:04,802 INFO L225 Difference]: With dead ends: 1144 [2018-02-02 20:53:04,802 INFO L226 Difference]: Without dead ends: 1144 [2018-02-02 20:53:04,802 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=756, Invalid=3026, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:53:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-02-02 20:53:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 663. [2018-02-02 20:53:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-02-02 20:53:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 757 transitions. [2018-02-02 20:53:04,808 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 757 transitions. Word has length 67 [2018-02-02 20:53:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:53:04,808 INFO L432 AbstractCegarLoop]: Abstraction has 663 states and 757 transitions. [2018-02-02 20:53:04,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:53:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 757 transitions. [2018-02-02 20:53:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:53:04,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:53:04,809 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:53:04,809 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:53:04,809 INFO L82 PathProgramCache]: Analyzing trace with hash -227937345, now seen corresponding path program 2 times [2018-02-02 20:53:04,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:53:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:53:04,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:53:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:05,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:53:05,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:53:05,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:53:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:05,082 INFO L182 omatonBuilderFactory]: Interpolants [52608#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 52609#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 52610#(and (not (= main_~head~0.base |main_#t~malloc20.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|) main_~x~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|) main_~x~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc20.base|))), 52611#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 52612#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)))), 52613#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 52614#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 52615#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|))), 52616#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 52617#(and (= 0 |main_#t~mem37.offset|) (= 0 |main_#t~mem37.base|)), 52618#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 52601#true, 52602#false, 52603#(= (select |#valid| main_~head~0.base) 1), 52604#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 52605#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 52606#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 52607#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.offset|) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1))] [2018-02-02 20:53:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:05,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:53:05,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:53:05,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:53:05,083 INFO L87 Difference]: Start difference. First operand 663 states and 757 transitions. Second operand 18 states. [2018-02-02 20:53:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:53:05,902 INFO L93 Difference]: Finished difference Result 721 states and 816 transitions. [2018-02-02 20:53:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:53:05,902 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-02 20:53:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:53:05,903 INFO L225 Difference]: With dead ends: 721 [2018-02-02 20:53:05,903 INFO L226 Difference]: Without dead ends: 721 [2018-02-02 20:53:05,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:53:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-02-02 20:53:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 669. [2018-02-02 20:53:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-02-02 20:53:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 765 transitions. [2018-02-02 20:53:05,910 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 765 transitions. Word has length 70 [2018-02-02 20:53:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:53:05,910 INFO L432 AbstractCegarLoop]: Abstraction has 669 states and 765 transitions. [2018-02-02 20:53:05,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:53:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 765 transitions. [2018-02-02 20:53:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:53:05,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:53:05,911 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:53:05,911 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:53:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1881794392, now seen corresponding path program 2 times [2018-02-02 20:53:05,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:53:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:53:05,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:53:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:06,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:53:06,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:53:06,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:53:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:06,356 INFO L182 omatonBuilderFactory]: Interpolants [54045#true, 54046#false, 54047#(= 0 |main_#t~malloc0.offset|), 54048#(= 0 main_~head~0.offset), 54049#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 54050#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 54051#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 main_~head~0.offset) (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base)), 54052#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 54053#(and (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 12 (select |#length| |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 54054#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 54055#(and (= 0 main_~head~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 54056#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc20.base|)) (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc20.base|)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 54057#(and (= 0 main_~head~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 54058#(and (= 0 main_~head~0.offset) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 54059#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (not (= main_~head~0.base |main_#t~malloc14.base|))), 54060#(and (= 0 main_~head~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 54061#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem16.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 54062#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 54063#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.offset|)) main_~head~0.base) main_~head~0.offset)) (= |main_#t~malloc20.offset| main_~head~0.offset) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) |main_#t~malloc20.base|)) main_~head~0.base) main_~head~0.offset)))), 54064#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)) main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 54065#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem22.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset)) (or (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem22.base| (store (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset| 0)) main_~head~0.base) main_~head~0.offset))) (and (= |main_#t~mem22.offset| main_~head~0.offset) (= |main_#t~mem22.base| main_~head~0.base)))), 54066#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 54067#(and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 54068#(and (or (= 0 |main_#t~mem37.base|) (= 12 (select |#length| |main_#t~mem37.base|))) (= 0 |main_#t~mem37.offset|)), 54069#(and (or (= 0 main_~x~0.base) (= (select |#length| main_~x~0.base) 12)) (= 0 main_~x~0.offset)), 54070#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 20:53:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:06,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:53:06,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:53:06,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:53:06,356 INFO L87 Difference]: Start difference. First operand 669 states and 765 transitions. Second operand 26 states. [2018-02-02 20:53:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:53:08,913 INFO L93 Difference]: Finished difference Result 1208 states and 1383 transitions. [2018-02-02 20:53:08,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 20:53:08,914 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2018-02-02 20:53:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:53:08,915 INFO L225 Difference]: With dead ends: 1208 [2018-02-02 20:53:08,915 INFO L226 Difference]: Without dead ends: 1208 [2018-02-02 20:53:08,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1121, Invalid=4885, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 20:53:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-02-02 20:53:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 584. [2018-02-02 20:53:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-02-02 20:53:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 668 transitions. [2018-02-02 20:53:08,921 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 668 transitions. Word has length 70 [2018-02-02 20:53:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:53:08,921 INFO L432 AbstractCegarLoop]: Abstraction has 584 states and 668 transitions. [2018-02-02 20:53:08,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:53:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 668 transitions. [2018-02-02 20:53:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:53:08,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:53:08,922 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:53:08,922 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:53:08,922 INFO L82 PathProgramCache]: Analyzing trace with hash 229367277, now seen corresponding path program 2 times [2018-02-02 20:53:08,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:53:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:53:08,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:53:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:09,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:53:09,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:53:09,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:53:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:09,487 INFO L182 omatonBuilderFactory]: Interpolants [55968#false, 55969#(= 0 |main_#t~malloc0.offset|), 55970#(= main_~head~0.offset 0), 55971#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 55972#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 55973#(and (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 55974#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 55975#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem16.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 55976#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 55977#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 55978#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 55979#(and (= (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~x~0.offset 4)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (not (= main_~head~0.base |main_#t~malloc14.base|))), 55980#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 55981#(and (not (= main_~head~0.base |main_#t~mem16.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 55982#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 55983#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 55984#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 55985#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 55986#(and (= 1 (select |#valid| |main_#t~mem37.base|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)) |main_#t~mem37.base|) (= 0 |main_#t~mem37.offset|)), 55987#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 55988#(and (= 1 (select |#valid| main_~x~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.offset 0) (= main_~x~0.base |main_#t~mem30.base|)), 55989#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~x~0.offset 0)), 55990#(= 1 (select |#valid| |main_#t~mem32.base|)), 55967#true] [2018-02-02 20:53:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:09,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:53:09,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:53:09,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:53:09,487 INFO L87 Difference]: Start difference. First operand 584 states and 668 transitions. Second operand 24 states. [2018-02-02 20:53:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:53:11,055 INFO L93 Difference]: Finished difference Result 922 states and 1042 transitions. [2018-02-02 20:53:11,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:53:11,056 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-02-02 20:53:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:53:11,057 INFO L225 Difference]: With dead ends: 922 [2018-02-02 20:53:11,057 INFO L226 Difference]: Without dead ends: 922 [2018-02-02 20:53:11,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=458, Invalid=2092, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 20:53:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2018-02-02 20:53:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 683. [2018-02-02 20:53:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-02-02 20:53:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 785 transitions. [2018-02-02 20:53:11,061 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 785 transitions. Word has length 72 [2018-02-02 20:53:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:53:11,061 INFO L432 AbstractCegarLoop]: Abstraction has 683 states and 785 transitions. [2018-02-02 20:53:11,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:53:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 785 transitions. [2018-02-02 20:53:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:53:11,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:53:11,062 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:53:11,062 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:53:11,062 INFO L82 PathProgramCache]: Analyzing trace with hash 229367278, now seen corresponding path program 2 times [2018-02-02 20:53:11,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:53:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:53:11,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:53:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:11,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:53:11,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:53:11,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:53:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:11,759 INFO L182 omatonBuilderFactory]: Interpolants [57664#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 57665#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 57666#(and (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 57667#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 57668#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 57669#(and (= (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)) |main_#t~mem37.base|) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 4)) |main_#t~mem37.offset|) (= 0 |main_#t~mem37.offset|)), 57670#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 57671#(and (= main_~x~0.offset 0) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base |main_#t~mem30.base|)), 57672#(and (= main_~x~0.offset 0) (not |main_#t~short31|)), 57673#(and (= main_~x~0.offset 0) (not |main_#t~short34|)), 57650#true, 57651#false, 57652#(= 0 |main_#t~malloc0.offset|), 57653#(= main_~head~0.offset 0), 57654#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 57655#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 57656#(and (= 0 |main_#t~malloc14.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc14.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 57657#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 57658#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem16.base|) (not (= main_~head~0.base |main_#t~mem16.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem16.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 57659#(and (or (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.offset main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 57660#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 57661#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 57662#(and (= (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|) (+ main_~x~0.offset 4)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~x~0.base) (+ main_~x~0.offset 4)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc14.base|)) main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base |main_#t~malloc14.base|)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (not (= main_~head~0.base |main_#t~malloc14.base|))), 57663#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:53:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:53:11,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:53:11,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:53:11,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:53:11,760 INFO L87 Difference]: Start difference. First operand 683 states and 785 transitions. Second operand 24 states. Received shutdown request... [2018-02-02 20:53:12,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:53:12,804 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:53:12,808 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:53:12,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:53:12 BoogieIcfgContainer [2018-02-02 20:53:12,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:53:12,809 INFO L168 Benchmark]: Toolchain (without parser) took 72196.49 ms. Allocated memory was 396.9 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 353.6 MB in the beginning and 471.0 MB in the end (delta: -117.4 MB). Peak memory consumption was 885.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:53:12,809 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 396.9 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:53:12,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.41 ms. Allocated memory is still 396.9 MB. Free memory was 353.6 MB in the beginning and 341.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:53:12,810 INFO L168 Benchmark]: Boogie Preprocessor took 28.98 ms. Allocated memory is still 396.9 MB. Free memory was 341.6 MB in the beginning and 339.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:53:12,810 INFO L168 Benchmark]: RCFGBuilder took 386.41 ms. Allocated memory is still 396.9 MB. Free memory was 339.0 MB in the beginning and 300.1 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:53:12,810 INFO L168 Benchmark]: TraceAbstraction took 71622.35 ms. Allocated memory was 396.9 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 300.1 MB in the beginning and 471.0 MB in the end (delta: -170.9 MB). Peak memory consumption was 831.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:53:12,811 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 396.9 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.41 ms. Allocated memory is still 396.9 MB. Free memory was 353.6 MB in the beginning and 341.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.98 ms. Allocated memory is still 396.9 MB. Free memory was 341.6 MB in the beginning and 339.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 386.41 ms. Allocated memory is still 396.9 MB. Free memory was 339.0 MB in the beginning and 300.1 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 71622.35 ms. Allocated memory was 396.9 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 300.1 MB in the beginning and 471.0 MB in the end (delta: -170.9 MB). Peak memory consumption was 831.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (683states) and interpolant automaton (currently 26 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 63 error locations. TIMEOUT Result, 71.5s OverallTime, 64 OverallIterations, 3 TraceHistogramMax, 52.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6082 SDtfs, 35680 SDslu, 41633 SDs, 0 SdLazy, 51654 SolverSat, 6209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2160 GetRequests, 127 SyntacticMatches, 133 SemanticMatches, 1899 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18659 ImplicationChecksByTransitivity, 38.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683occurred in iteration=63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 27/537 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 63 MinimizatonAttempts, 11323 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 3055 NumberOfCodeBlocks, 3055 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 3179150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 19 PerfectInterpolantSequences, 27/537 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-53-12-819.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-53-12-819.csv Completed graceful shutdown