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/dll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:44:15,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:44:15,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:44:15,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:44:15,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:44:15,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:44:15,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:44:15,737 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:44:15,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:44:15,738 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:44:15,739 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:44:15,739 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:44:15,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:44:15,744 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:44:15,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:44:15,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:44:15,746 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:44:15,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:44:15,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:44:15,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:44:15,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:44:15,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:44:15,750 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:44:15,751 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:44:15,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:44:15,752 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:44:15,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:44:15,752 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:44:15,752 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:44:15,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:44:15,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:44:15,753 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:44:15,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:44:15,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:44:15,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:44:15,762 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:44:15,762 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:44:15,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:44:15,762 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:44:15,762 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:44:15,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:44:15,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:44:15,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:44:15,763 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:44:15,763 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:44:15,763 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:44:15,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:44:15,763 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:44:15,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:44:15,764 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:44:15,764 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:44:15,764 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:44:15,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:44:15,764 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:44:15,764 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:44:15,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:44:15,794 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:44:15,797 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:44:15,798 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:44:15,798 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:44:15,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:44:15,917 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:44:15,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:44:15,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:44:15,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:44:15,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:44:15,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:44:15" (1/1) ... [2018-02-02 20:44:15,928 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:44:15, skipping insertion in model container [2018-02-02 20:44:15,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:44:15" (1/1) ... [2018-02-02 20:44:15,940 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:44:15,971 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:44:16,067 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:44:16,085 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:44:16,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16 WrapperNode [2018-02-02 20:44:16,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:44:16,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:44:16,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:44:16,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:44:16,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16" (1/1) ... [2018-02-02 20:44:16,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16" (1/1) ... [2018-02-02 20:44:16,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16" (1/1) ... [2018-02-02 20:44:16,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16" (1/1) ... [2018-02-02 20:44:16,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16" (1/1) ... [2018-02-02 20:44:16,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16" (1/1) ... [2018-02-02 20:44:16,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16" (1/1) ... [2018-02-02 20:44:16,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:44:16,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:44:16,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:44:16,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:44:16,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16" (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:44:16,175 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:44:16,175 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:44:16,175 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:44:16,175 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:44:16,175 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:44:16,175 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:44:16,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:44:16,176 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:44:16,176 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:44:16,176 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:44:16,176 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:44:16,176 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:44:16,176 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:44:16,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:44:16,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:44:16,619 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:44:16,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:44:16 BoogieIcfgContainer [2018-02-02 20:44:16,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:44:16,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:44:16,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:44:16,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:44:16,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:44:15" (1/3) ... [2018-02-02 20:44:16,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b2a864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:44:16, skipping insertion in model container [2018-02-02 20:44:16,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:16" (2/3) ... [2018-02-02 20:44:16,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b2a864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:44:16, skipping insertion in model container [2018-02-02 20:44:16,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:44:16" (3/3) ... [2018-02-02 20:44:16,624 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:44:16,630 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:44:16,634 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2018-02-02 20:44:16,658 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:44:16,658 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:44:16,658 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:44:16,658 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:44:16,658 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:44:16,658 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:44:16,658 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:44:16,659 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:44:16,659 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:44:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states. [2018-02-02 20:44:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:44:16,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:16,679 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:16,679 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1231756068, now seen corresponding path program 1 times [2018-02-02 20:44:16,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:16,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:16,786 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:44:16,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:16,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:44:16,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:16,788 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:44:16,789 INFO L182 omatonBuilderFactory]: Interpolants [198#true, 199#false, 200#(= 1 (select |#valid| |main_#t~malloc0.base|)), 201#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 20:44:16,789 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:44:16,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:44:16,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:44:16,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:44:16,865 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 4 states. [2018-02-02 20:44:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:17,051 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2018-02-02 20:44:17,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:44:17,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:44:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:17,060 INFO L225 Difference]: With dead ends: 218 [2018-02-02 20:44:17,061 INFO L226 Difference]: Without dead ends: 214 [2018-02-02 20:44:17,062 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:44:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-02 20:44:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 185. [2018-02-02 20:44:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 20:44:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-02-02 20:44:17,098 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 8 [2018-02-02 20:44:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:17,099 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-02-02 20:44:17,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:44:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-02-02 20:44:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:44:17,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:17,099 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:17,100 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1231756069, now seen corresponding path program 1 times [2018-02-02 20:44:17,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:17,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:17,177 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:44:17,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:17,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:44:17,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:17,178 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:44:17,178 INFO L182 omatonBuilderFactory]: Interpolants [608#false, 609#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 610#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 12)), 607#true] [2018-02-02 20:44:17,178 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:44:17,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:44:17,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:44:17,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:44:17,180 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 4 states. [2018-02-02 20:44:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:17,328 INFO L93 Difference]: Finished difference Result 206 states and 216 transitions. [2018-02-02 20:44:17,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:44:17,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:44:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:17,329 INFO L225 Difference]: With dead ends: 206 [2018-02-02 20:44:17,330 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 20:44:17,330 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:44:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 20:44:17,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 195. [2018-02-02 20:44:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 20:44:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-02-02 20:44:17,340 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 8 [2018-02-02 20:44:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:17,340 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-02-02 20:44:17,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:44:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-02-02 20:44:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:44:17,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:17,341 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:17,341 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash -268288902, now seen corresponding path program 1 times [2018-02-02 20:44:17,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:17,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:17,388 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:44:17,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:17,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:17,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:17,389 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:44:17,390 INFO L182 omatonBuilderFactory]: Interpolants [1014#true, 1015#false, 1016#(= 1 (select |#valid| |main_#t~malloc5.base|)), 1017#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 1018#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-02-02 20:44:17,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:44:17,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:17,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:17,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:17,390 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 5 states. [2018-02-02 20:44:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:17,615 INFO L93 Difference]: Finished difference Result 333 states and 359 transitions. [2018-02-02 20:44:17,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:17,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 20:44:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:17,617 INFO L225 Difference]: With dead ends: 333 [2018-02-02 20:44:17,617 INFO L226 Difference]: Without dead ends: 333 [2018-02-02 20:44:17,617 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:44:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-02 20:44:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 194. [2018-02-02 20:44:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:44:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2018-02-02 20:44:17,639 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 18 [2018-02-02 20:44:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:17,640 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2018-02-02 20:44:17,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2018-02-02 20:44:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:44:17,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:17,640 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:17,641 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash -268288901, now seen corresponding path program 1 times [2018-02-02 20:44:17,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:17,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:17,726 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:44:17,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:17,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:17,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:17,727 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:44:17,727 INFO L182 omatonBuilderFactory]: Interpolants [1552#true, 1553#false, 1554#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 1555#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 1556#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0))] [2018-02-02 20:44:17,727 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:44:17,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:17,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:17,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:17,727 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 5 states. [2018-02-02 20:44:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:17,972 INFO L93 Difference]: Finished difference Result 361 states and 396 transitions. [2018-02-02 20:44:17,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:17,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 20:44:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:17,973 INFO L225 Difference]: With dead ends: 361 [2018-02-02 20:44:17,973 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 20:44:17,973 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:44:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 20:44:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 193. [2018-02-02 20:44:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 20:44:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2018-02-02 20:44:17,978 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 18 [2018-02-02 20:44:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:17,979 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2018-02-02 20:44:17,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2018-02-02 20:44:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 20:44:17,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:17,979 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] [2018-02-02 20:44:17,979 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash 339478269, now seen corresponding path program 1 times [2018-02-02 20:44:17,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:17,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:44:18,075 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:44:18,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:18,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:44:18,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:18,075 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:44:18,075 INFO L182 omatonBuilderFactory]: Interpolants [2117#true, 2118#false, 2119#(= (select |#valid| main_~list~0.base) 1), 2120#(and (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 2121#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 2122#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base |main_#t~mem7.base|))), 2123#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 2124#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-02-02 20:44:18,075 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:44:18,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:44:18,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:44:18,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:44:18,076 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand 8 states. [2018-02-02 20:44:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:18,476 INFO L93 Difference]: Finished difference Result 335 states and 360 transitions. [2018-02-02 20:44:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:44:18,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 20:44:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:18,478 INFO L225 Difference]: With dead ends: 335 [2018-02-02 20:44:18,479 INFO L226 Difference]: Without dead ends: 335 [2018-02-02 20:44:18,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:44:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-02-02 20:44:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 192. [2018-02-02 20:44:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:44:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2018-02-02 20:44:18,486 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 21 [2018-02-02 20:44:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:18,486 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2018-02-02 20:44:18,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:44:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2018-02-02 20:44:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 20:44:18,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:18,487 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] [2018-02-02 20:44:18,487 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash 339478270, now seen corresponding path program 1 times [2018-02-02 20:44:18,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:18,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:18,602 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:44:18,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:18,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:44:18,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:18,603 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:44:18,603 INFO L182 omatonBuilderFactory]: Interpolants [2662#true, 2663#false, 2664#(= (select |#valid| main_~list~0.base) 1), 2665#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|))), 2666#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 2667#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base |main_#t~mem7.base|))), 2668#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 2669#(and (= (select |#length| |main_#t~mem9.base|) 12) (= |main_#t~mem9.offset| 0))] [2018-02-02 20:44:18,603 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:44:18,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:44:18,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:44:18,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:44:18,604 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 8 states. [2018-02-02 20:44:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:19,214 INFO L93 Difference]: Finished difference Result 336 states and 361 transitions. [2018-02-02 20:44:19,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:44:19,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 20:44:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:19,215 INFO L225 Difference]: With dead ends: 336 [2018-02-02 20:44:19,215 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 20:44:19,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:44:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 20:44:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 191. [2018-02-02 20:44:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 20:44:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 209 transitions. [2018-02-02 20:44:19,221 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 209 transitions. Word has length 21 [2018-02-02 20:44:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:19,222 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 209 transitions. [2018-02-02 20:44:19,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:44:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2018-02-02 20:44:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:44:19,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:19,223 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] [2018-02-02 20:44:19,223 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:19,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1615330234, now seen corresponding path program 1 times [2018-02-02 20:44:19,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:19,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:19,273 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:44:19,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:19,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:44:19,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:19,274 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:44:19,274 INFO L182 omatonBuilderFactory]: Interpolants [3207#true, 3208#false, 3209#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 3210#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)), 3211#(not |main_#t~short13|)] [2018-02-02 20:44:19,274 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:44:19,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:19,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:19,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:19,275 INFO L87 Difference]: Start difference. First operand 191 states and 209 transitions. Second operand 5 states. [2018-02-02 20:44:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:19,360 INFO L93 Difference]: Finished difference Result 283 states and 306 transitions. [2018-02-02 20:44:19,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:19,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-02 20:44:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:19,361 INFO L225 Difference]: With dead ends: 283 [2018-02-02 20:44:19,362 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 20:44:19,362 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:44:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 20:44:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 195. [2018-02-02 20:44:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 20:44:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-02-02 20:44:19,367 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 27 [2018-02-02 20:44:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:19,367 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-02-02 20:44:19,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-02-02 20:44:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:44:19,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:19,368 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:44:19,368 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash 803446251, now seen corresponding path program 1 times [2018-02-02 20:44:19,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:19,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:44:19,426 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:44:19,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:19,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:19,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:19,427 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:44:19,427 INFO L182 omatonBuilderFactory]: Interpolants [3696#(= 1 (select |#valid| |main_#t~malloc0.base|)), 3697#(= 1 (select |#valid| main_~list~0.base)), 3698#(= 1 (select |#valid| main_~end~0.base)), 3694#true, 3695#false] [2018-02-02 20:44:19,427 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:44:19,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:19,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:19,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:19,428 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 5 states. [2018-02-02 20:44:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:19,532 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-02-02 20:44:19,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:44:19,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 20:44:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:19,534 INFO L225 Difference]: With dead ends: 204 [2018-02-02 20:44:19,534 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 20:44:19,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 3 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:44:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 20:44:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 186. [2018-02-02 20:44:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 20:44:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 204 transitions. [2018-02-02 20:44:19,536 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 204 transitions. Word has length 29 [2018-02-02 20:44:19,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:19,536 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 204 transitions. [2018-02-02 20:44:19,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:19,537 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 204 transitions. [2018-02-02 20:44:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:44:19,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:19,537 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:44:19,537 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash 803446252, now seen corresponding path program 1 times [2018-02-02 20:44:19,538 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:19,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:19,598 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:44:19,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:19,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:44:19,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:19,599 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:44:19,599 INFO L182 omatonBuilderFactory]: Interpolants [4096#false, 4097#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 4098#(and (= 0 main_~list~0.offset) (= 12 (select |#length| main_~list~0.base))), 4099#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 12 (select |#length| main_~list~0.base))), 4100#(and (= main_~end~0.offset 0) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| main_~end~0.base))), 4101#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 4095#true] [2018-02-02 20:44:19,599 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:44:19,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:44:19,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:44:19,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:44:19,600 INFO L87 Difference]: Start difference. First operand 186 states and 204 transitions. Second operand 7 states. [2018-02-02 20:44:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:19,806 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2018-02-02 20:44:19,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:19,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 20:44:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:19,808 INFO L225 Difference]: With dead ends: 243 [2018-02-02 20:44:19,808 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 20:44:19,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:44:19,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 20:44:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 216. [2018-02-02 20:44:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 20:44:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 244 transitions. [2018-02-02 20:44:19,811 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 244 transitions. Word has length 29 [2018-02-02 20:44:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:19,811 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 244 transitions. [2018-02-02 20:44:19,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:44:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 244 transitions. [2018-02-02 20:44:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:44:19,812 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:19,812 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] [2018-02-02 20:44:19,812 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash -982263634, now seen corresponding path program 1 times [2018-02-02 20:44:19,813 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:19,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:19,858 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:44:19,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:19,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:19,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:19,859 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:44:19,859 INFO L182 omatonBuilderFactory]: Interpolants [4567#true, 4568#false, 4569#(= 1 (select |#valid| |main_#t~malloc15.base|)), 4570#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 4571#(= 1 (select |#valid| |main_#t~mem17.base|))] [2018-02-02 20:44:19,859 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:44:19,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:19,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:19,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:19,860 INFO L87 Difference]: Start difference. First operand 216 states and 244 transitions. Second operand 5 states. [2018-02-02 20:44:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:20,054 INFO L93 Difference]: Finished difference Result 304 states and 344 transitions. [2018-02-02 20:44:20,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:44:20,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 20:44:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:20,055 INFO L225 Difference]: With dead ends: 304 [2018-02-02 20:44:20,055 INFO L226 Difference]: Without dead ends: 304 [2018-02-02 20:44:20,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:44:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-02 20:44:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 215. [2018-02-02 20:44:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 20:44:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 242 transitions. [2018-02-02 20:44:20,060 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 242 transitions. Word has length 31 [2018-02-02 20:44:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:20,060 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 242 transitions. [2018-02-02 20:44:20,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 242 transitions. [2018-02-02 20:44:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:44:20,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:20,061 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] [2018-02-02 20:44:20,062 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash -982263633, now seen corresponding path program 1 times [2018-02-02 20:44:20,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:20,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:20,113 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:44:20,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:20,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:20,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:20,114 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:44:20,114 INFO L182 omatonBuilderFactory]: Interpolants [5095#true, 5096#false, 5097#(and (= 12 (select |#length| |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 5098#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5099#(and (= (select |#length| |main_#t~mem17.base|) 12) (= |main_#t~mem17.offset| 0))] [2018-02-02 20:44:20,114 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:44:20,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:20,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:20,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:20,115 INFO L87 Difference]: Start difference. First operand 215 states and 242 transitions. Second operand 5 states. [2018-02-02 20:44:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:20,272 INFO L93 Difference]: Finished difference Result 332 states and 378 transitions. [2018-02-02 20:44:20,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:20,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 20:44:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:20,274 INFO L225 Difference]: With dead ends: 332 [2018-02-02 20:44:20,274 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 20:44:20,274 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:44:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 20:44:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 214. [2018-02-02 20:44:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 20:44:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 240 transitions. [2018-02-02 20:44:20,279 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 240 transitions. Word has length 31 [2018-02-02 20:44:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:20,279 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 240 transitions. [2018-02-02 20:44:20,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 240 transitions. [2018-02-02 20:44:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:44:20,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:20,280 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, 1, 1] [2018-02-02 20:44:20,280 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1048421776, now seen corresponding path program 1 times [2018-02-02 20:44:20,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:20,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:20,369 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:44:20,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:20,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:44:20,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:20,370 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:44:20,370 INFO L182 omatonBuilderFactory]: Interpolants [5652#true, 5653#false, 5654#(= (select |#valid| main_~list~0.base) 1), 5655#(= (select |#valid| main_~end~0.base) 1), 5656#(and (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 1 (select |#valid| |main_#t~malloc15.base|))), 5657#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 5658#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem17.base|))), 5659#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5660#(= 1 (select |#valid| |main_#t~mem19.base|))] [2018-02-02 20:44:20,370 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:44:20,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:44:20,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:44:20,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:44:20,371 INFO L87 Difference]: Start difference. First operand 214 states and 240 transitions. Second operand 9 states. [2018-02-02 20:44:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:20,641 INFO L93 Difference]: Finished difference Result 223 states and 248 transitions. [2018-02-02 20:44:20,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:44:20,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 20:44:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:20,642 INFO L225 Difference]: With dead ends: 223 [2018-02-02 20:44:20,642 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 20:44:20,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:44:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 20:44:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 213. [2018-02-02 20:44:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 20:44:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 239 transitions. [2018-02-02 20:44:20,648 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 239 transitions. Word has length 35 [2018-02-02 20:44:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:20,648 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 239 transitions. [2018-02-02 20:44:20,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:44:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2018-02-02 20:44:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:44:20,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:20,649 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, 1, 1] [2018-02-02 20:44:20,649 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1048421775, now seen corresponding path program 1 times [2018-02-02 20:44:20,650 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:20,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:20,767 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:44:20,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:20,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:44:20,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:20,768 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:44:20,768 INFO L182 omatonBuilderFactory]: Interpolants [6112#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 6113#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 6114#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 6115#(and (= 12 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 6116#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 6107#true, 6108#false, 6109#(= (select |#valid| main_~list~0.base) 1), 6110#(= (select |#valid| main_~end~0.base) 1), 6111#(and (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 12 (select |#length| |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|))] [2018-02-02 20:44:20,768 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:44:20,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:44:20,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:44:20,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:44:20,768 INFO L87 Difference]: Start difference. First operand 213 states and 239 transitions. Second operand 10 states. [2018-02-02 20:44:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:21,189 INFO L93 Difference]: Finished difference Result 215 states and 240 transitions. [2018-02-02 20:44:21,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:44:21,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-02-02 20:44:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:21,189 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:44:21,189 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 20:44:21,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:44:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 20:44:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2018-02-02 20:44:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:44:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2018-02-02 20:44:21,192 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 35 [2018-02-02 20:44:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:21,192 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2018-02-02 20:44:21,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:44:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-02-02 20:44:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:44:21,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:21,193 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, 1, 1, 1, 1] [2018-02-02 20:44:21,193 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash -436143591, now seen corresponding path program 1 times [2018-02-02 20:44:21,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:21,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:21,215 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:44:21,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:21,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:44:21,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:21,216 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:44:21,216 INFO L182 omatonBuilderFactory]: Interpolants [6548#true, 6549#false, 6550#(not (= 0 |main_#t~malloc0.base|)), 6551#(not (= 0 main_~list~0.base)), 6552#(not (= 0 main_~end~0.base))] [2018-02-02 20:44:21,216 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:44:21,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:21,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:21,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:21,216 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand 5 states. [2018-02-02 20:44:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:21,296 INFO L93 Difference]: Finished difference Result 218 states and 231 transitions. [2018-02-02 20:44:21,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:44:21,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-02 20:44:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:21,297 INFO L225 Difference]: With dead ends: 218 [2018-02-02 20:44:21,297 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 20:44:21,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:44:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 20:44:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2018-02-02 20:44:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:44:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2018-02-02 20:44:21,301 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 37 [2018-02-02 20:44:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:21,301 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2018-02-02 20:44:21,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2018-02-02 20:44:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:44:21,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:21,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:21,302 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2094023958, now seen corresponding path program 1 times [2018-02-02 20:44:21,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:21,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:21,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:44:21,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:21,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:44:21,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:21,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:44:21,474 INFO L182 omatonBuilderFactory]: Interpolants [6976#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~end~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 6977#(and (= 0 |main_#t~mem32.offset|) (= 0 |main_#t~mem32.base|)), 6978#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base)), 6969#true, 6970#false, 6971#(= 0 |main_#t~malloc0.offset|), 6972#(= 0 main_~list~0.offset), 6973#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem11.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem11.base|) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 6974#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |main_#t~short13|) (= 0 main_~list~0.offset)), 6975#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))] [2018-02-02 20:44:21,475 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:44:21,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:44:21,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:44:21,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:44:21,475 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand 10 states. [2018-02-02 20:44:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:21,824 INFO L93 Difference]: Finished difference Result 285 states and 308 transitions. [2018-02-02 20:44:21,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:44:21,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-02-02 20:44:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:21,825 INFO L225 Difference]: With dead ends: 285 [2018-02-02 20:44:21,825 INFO L226 Difference]: Without dead ends: 285 [2018-02-02 20:44:21,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:44:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-02-02 20:44:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 210. [2018-02-02 20:44:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 20:44:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 234 transitions. [2018-02-02 20:44:21,829 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 234 transitions. Word has length 43 [2018-02-02 20:44:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:21,830 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 234 transitions. [2018-02-02 20:44:21,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:44:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 234 transitions. [2018-02-02 20:44:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:44:21,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:21,831 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] [2018-02-02 20:44:21,831 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:21,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1866790362, now seen corresponding path program 1 times [2018-02-02 20:44:21,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:21,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:21,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:21,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:44:21,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:21,936 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:44:21,936 INFO L182 omatonBuilderFactory]: Interpolants [7496#true, 7497#false, 7498#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset))), 7499#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 7500#(and (= 0 |main_#t~mem36.offset|) (= 0 |main_#t~mem36.base|)), 7501#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-02-02 20:44:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:21,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:44:21,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:44:21,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:44:21,937 INFO L87 Difference]: Start difference. First operand 210 states and 234 transitions. Second operand 6 states. [2018-02-02 20:44:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:22,066 INFO L93 Difference]: Finished difference Result 286 states and 314 transitions. [2018-02-02 20:44:22,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:44:22,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-02 20:44:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:22,066 INFO L225 Difference]: With dead ends: 286 [2018-02-02 20:44:22,067 INFO L226 Difference]: Without dead ends: 286 [2018-02-02 20:44:22,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 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:44:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-02-02 20:44:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 244. [2018-02-02 20:44:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 20:44:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 277 transitions. [2018-02-02 20:44:22,070 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 277 transitions. Word has length 45 [2018-02-02 20:44:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:22,070 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 277 transitions. [2018-02-02 20:44:22,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:44:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 277 transitions. [2018-02-02 20:44:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:44:22,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:22,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:22,071 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:22,071 INFO L82 PathProgramCache]: Analyzing trace with hash -336978579, now seen corresponding path program 1 times [2018-02-02 20:44:22,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:22,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:22,117 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:44:22,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:22,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:22,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:22,118 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:44:22,118 INFO L182 omatonBuilderFactory]: Interpolants [8038#true, 8039#false, 8040#(= 1 (select |#valid| |main_#t~malloc23.base|)), 8041#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 8042#(= 1 (select |#valid| |main_#t~mem25.base|))] [2018-02-02 20:44:22,118 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:44:22,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:22,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:22,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:22,118 INFO L87 Difference]: Start difference. First operand 244 states and 277 transitions. Second operand 5 states. [2018-02-02 20:44:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:22,280 INFO L93 Difference]: Finished difference Result 358 states and 406 transitions. [2018-02-02 20:44:22,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:22,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-02 20:44:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:22,281 INFO L225 Difference]: With dead ends: 358 [2018-02-02 20:44:22,281 INFO L226 Difference]: Without dead ends: 358 [2018-02-02 20:44:22,281 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:44:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-02 20:44:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 243. [2018-02-02 20:44:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 20:44:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 276 transitions. [2018-02-02 20:44:22,286 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 276 transitions. Word has length 47 [2018-02-02 20:44:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:22,286 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 276 transitions. [2018-02-02 20:44:22,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 276 transitions. [2018-02-02 20:44:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:44:22,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:22,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:22,287 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:22,287 INFO L82 PathProgramCache]: Analyzing trace with hash -336978578, now seen corresponding path program 1 times [2018-02-02 20:44:22,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:22,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:22,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:44:22,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:22,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:22,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:22,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:44:22,341 INFO L182 omatonBuilderFactory]: Interpolants [8650#true, 8651#false, 8652#(and (= 12 (select |#length| |main_#t~malloc23.base|)) (= 0 |main_#t~malloc23.offset|)), 8653#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))), 8654#(and (= |main_#t~mem25.offset| 0) (= (select |#length| |main_#t~mem25.base|) 12))] [2018-02-02 20:44:22,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:44:22,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:22,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:22,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:22,341 INFO L87 Difference]: Start difference. First operand 243 states and 276 transitions. Second operand 5 states. [2018-02-02 20:44:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:22,500 INFO L93 Difference]: Finished difference Result 389 states and 443 transitions. [2018-02-02 20:44:22,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:22,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-02 20:44:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:22,502 INFO L225 Difference]: With dead ends: 389 [2018-02-02 20:44:22,502 INFO L226 Difference]: Without dead ends: 389 [2018-02-02 20:44:22,502 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:44:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-02 20:44:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 242. [2018-02-02 20:44:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 20:44:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 275 transitions. [2018-02-02 20:44:22,505 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 275 transitions. Word has length 47 [2018-02-02 20:44:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:22,505 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 275 transitions. [2018-02-02 20:44:22,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 275 transitions. [2018-02-02 20:44:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:44:22,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:22,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:22,505 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:22,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1571885263, now seen corresponding path program 1 times [2018-02-02 20:44:22,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:22,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:22,753 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:44:22,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:22,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:44:22,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:22,754 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:44:22,754 INFO L182 omatonBuilderFactory]: Interpolants [9292#true, 9293#false, 9294#(= 0 |main_#t~malloc0.offset|), 9295#(= main_~list~0.offset 0), 9296#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 9297#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~list~0.base |main_#t~malloc5.base|)) (<= 0 main_~list~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (<= main_~list~0.offset 0)), 9298#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 0 main_~list~0.offset) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (<= main_~list~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 9299#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base |main_#t~mem7.base|))), 9300#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 9301#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem9.base| (store (select |#memory_$Pointer$.base| |main_#t~mem9.base|) (+ |main_#t~mem9.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (or (not (= main_~list~0.base |main_#t~mem9.base|)) (and (< |main_#t~mem9.offset| (+ main_~list~0.offset 1)) (<= main_~list~0.offset 0)))), 9302#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 9303#(or (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 9304#(or (not |main_#t~short13|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 9305#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 9306#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 9307#(= 1 (select |#valid| |main_#t~mem32.base|)), 9308#(= 1 (select |#valid| main_~inner~0.base))] [2018-02-02 20:44:22,754 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:44:22,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:44:22,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:44:22,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:44:22,755 INFO L87 Difference]: Start difference. First operand 242 states and 275 transitions. Second operand 17 states. [2018-02-02 20:44:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:23,858 INFO L93 Difference]: Finished difference Result 532 states and 572 transitions. [2018-02-02 20:44:23,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:44:23,858 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-02 20:44:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:23,861 INFO L225 Difference]: With dead ends: 532 [2018-02-02 20:44:23,861 INFO L226 Difference]: Without dead ends: 532 [2018-02-02 20:44:23,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:44:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-02-02 20:44:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 248. [2018-02-02 20:44:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 20:44:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 280 transitions. [2018-02-02 20:44:23,867 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 280 transitions. Word has length 48 [2018-02-02 20:44:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:23,867 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 280 transitions. [2018-02-02 20:44:23,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:44:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 280 transitions. [2018-02-02 20:44:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:44:23,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:23,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:23,868 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1571885264, now seen corresponding path program 1 times [2018-02-02 20:44:23,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:23,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:24,144 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:44:24,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:24,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:44:24,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:24,145 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:44:24,145 INFO L182 omatonBuilderFactory]: Interpolants [10144#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem9.base| (store (select |#memory_$Pointer$.base| |main_#t~mem9.base|) (+ |main_#t~mem9.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))))) (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (or (not (= main_~list~0.base |main_#t~mem9.base|)) (and (< |main_#t~mem9.offset| (+ main_~list~0.offset 1)) (<= main_~list~0.offset 0)))), 10145#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))), 10146#(or (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))), 10147#(or (not |main_#t~short13|) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))), 10148#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 10149#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))), 10150#(and (= 0 |main_#t~mem32.offset|) (= 12 (select |#length| |main_#t~mem32.base|))), 10151#(and (= (select |#length| main_~inner~0.base) 12) (= main_~inner~0.offset 0)), 10135#true, 10136#false, 10137#(= 0 |main_#t~malloc0.offset|), 10138#(= main_~list~0.offset 0), 10139#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 10140#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~list~0.base |main_#t~malloc5.base|)) (<= 0 main_~list~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (<= main_~list~0.offset 0)), 10141#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (<= main_~list~0.offset 0)), 10142#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (<= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~mem7.base|))), 10143#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (<= main_~list~0.offset 0))] [2018-02-02 20:44:24,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:44:24,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:44:24,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:44:24,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:44:24,146 INFO L87 Difference]: Start difference. First operand 248 states and 280 transitions. Second operand 17 states. [2018-02-02 20:44:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:25,427 INFO L93 Difference]: Finished difference Result 595 states and 636 transitions. [2018-02-02 20:44:25,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:44:25,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-02 20:44:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:25,429 INFO L225 Difference]: With dead ends: 595 [2018-02-02 20:44:25,429 INFO L226 Difference]: Without dead ends: 595 [2018-02-02 20:44:25,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=563, Invalid=1693, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:44:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-02-02 20:44:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 255. [2018-02-02 20:44:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 20:44:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 286 transitions. [2018-02-02 20:44:25,435 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 286 transitions. Word has length 48 [2018-02-02 20:44:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:25,435 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 286 transitions. [2018-02-02 20:44:25,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:44:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 286 transitions. [2018-02-02 20:44:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:44:25,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:25,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:25,436 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:25,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1590133210, now seen corresponding path program 1 times [2018-02-02 20:44:25,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:25,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:25,573 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:44:25,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:25,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:44:25,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:25,574 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:44:25,574 INFO L182 omatonBuilderFactory]: Interpolants [11072#(= (select |#valid| |main_#t~mem19.base|) 1), 11073#(and (not (= main_~end~0.base |main_#t~malloc23.base|)) (= 1 (select |#valid| |main_#t~malloc23.base|))), 11074#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))), 11075#(and (not (= main_~end~0.base |main_#t~mem25.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8))))), 11076#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 11077#(= 1 (select |#valid| |main_#t~mem27.base|)), 11064#true, 11065#false, 11066#(= (select |#valid| main_~list~0.base) 1), 11067#(= (select |#valid| main_~end~0.base) 1), 11068#(and (not (= main_~end~0.base |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1)), 11069#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 1)), 11070#(and (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset)) 1) (not (= main_~end~0.base |main_#t~mem17.base|))), 11071#(= (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 1)] [2018-02-02 20:44:25,574 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:44:25,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:44:25,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:44:25,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:44:25,574 INFO L87 Difference]: Start difference. First operand 255 states and 286 transitions. Second operand 14 states. [2018-02-02 20:44:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:26,057 INFO L93 Difference]: Finished difference Result 273 states and 306 transitions. [2018-02-02 20:44:26,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:44:26,057 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 20:44:26,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:26,058 INFO L225 Difference]: With dead ends: 273 [2018-02-02 20:44:26,058 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 20:44:26,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:44:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 20:44:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 254. [2018-02-02 20:44:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 20:44:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2018-02-02 20:44:26,061 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 50 [2018-02-02 20:44:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:26,061 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2018-02-02 20:44:26,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:44:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2018-02-02 20:44:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:44:26,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:26,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:26,062 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:26,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1590133209, now seen corresponding path program 1 times [2018-02-02 20:44:26,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:26,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:44:26,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:44:26,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:26,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:44:26,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:26,187 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:44:26,187 INFO L182 omatonBuilderFactory]: Interpolants [11633#true, 11634#false, 11635#(= (select |#valid| main_~end~0.base) 1), 11636#(and (= 12 (select |#length| |main_#t~malloc23.base|)) (not (= main_~end~0.base |main_#t~malloc23.base|)) (= 0 |main_#t~malloc23.offset|)), 11637#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))), 11638#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~end~0.base |main_#t~mem25.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8))))), 11639#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))), 11640#(and (= (select |#length| |main_#t~mem27.base|) 12) (= |main_#t~mem27.offset| 0))] [2018-02-02 20:44:26,187 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:44:26,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:44:26,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:44:26,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:44:26,188 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand 8 states. [2018-02-02 20:44:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:26,438 INFO L93 Difference]: Finished difference Result 274 states and 307 transitions. [2018-02-02 20:44:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:44:26,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-02-02 20:44:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:26,440 INFO L225 Difference]: With dead ends: 274 [2018-02-02 20:44:26,440 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 20:44:26,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:44:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 20:44:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 253. [2018-02-02 20:44:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 20:44:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2018-02-02 20:44:26,443 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 50 [2018-02-02 20:44:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:26,444 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2018-02-02 20:44:26,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:44:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2018-02-02 20:44:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:44:26,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:26,444 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, 1] [2018-02-02 20:44:26,444 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:26,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1798050227, now seen corresponding path program 1 times [2018-02-02 20:44:26,445 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:26,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:26,498 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:44:26,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:26,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:44:26,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:26,499 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:44:26,499 INFO L182 omatonBuilderFactory]: Interpolants [12179#true, 12180#false, 12181#(and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 12182#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |main_#t~short13|), 12183#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 12184#(and (= 0 |main_#t~mem37.offset|) (= 0 |main_#t~mem37.base|)), 12185#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-02-02 20:44:26,500 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:44:26,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:44:26,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:44:26,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:44:26,500 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand 7 states. [2018-02-02 20:44:26,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:26,670 INFO L93 Difference]: Finished difference Result 278 states and 309 transitions. [2018-02-02 20:44:26,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:44:26,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-02-02 20:44:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:26,671 INFO L225 Difference]: With dead ends: 278 [2018-02-02 20:44:26,671 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 20:44:26,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:44:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 20:44:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 265. [2018-02-02 20:44:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 20:44:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 296 transitions. [2018-02-02 20:44:26,673 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 296 transitions. Word has length 54 [2018-02-02 20:44:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:26,674 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 296 transitions. [2018-02-02 20:44:26,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:44:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 296 transitions. [2018-02-02 20:44:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:44:26,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:26,674 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] [2018-02-02 20:44:26,674 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash 508691472, now seen corresponding path program 1 times [2018-02-02 20:44:26,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:26,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:26,744 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:44:26,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:26,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:44:26,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:26,745 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:44:26,745 INFO L182 omatonBuilderFactory]: Interpolants [12737#true, 12738#false, 12739#(and (= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base main_~list~0.base)), 12740#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem36.base|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem36.offset|)), 12741#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base)), 12742#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 12743#(and (= 0 |main_#t~mem41.offset|) (= 0 |main_#t~mem41.base|)), 12744#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset)), 12745#(and (= 0 main_~list~0.offset) (= 0 main_~list~0.base))] [2018-02-02 20:44:26,745 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:44:26,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:44:26,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:44:26,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:44:26,746 INFO L87 Difference]: Start difference. First operand 265 states and 296 transitions. Second operand 9 states. [2018-02-02 20:44:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:26,997 INFO L93 Difference]: Finished difference Result 349 states and 376 transitions. [2018-02-02 20:44:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:44:26,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-02-02 20:44:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:26,998 INFO L225 Difference]: With dead ends: 349 [2018-02-02 20:44:26,999 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 20:44:26,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:44:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 20:44:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 292. [2018-02-02 20:44:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 20:44:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 330 transitions. [2018-02-02 20:44:27,001 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 330 transitions. Word has length 56 [2018-02-02 20:44:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:27,002 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 330 transitions. [2018-02-02 20:44:27,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:44:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 330 transitions. [2018-02-02 20:44:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:44:27,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:27,002 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:44:27,002 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:27,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1410432421, now seen corresponding path program 1 times [2018-02-02 20:44:27,003 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:27,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:44:27,041 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:44:27,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:27,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:44:27,042 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:27,042 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:44:27,042 INFO L182 omatonBuilderFactory]: Interpolants [13402#true, 13403#false, 13404#(= |#valid| |old(#valid)|), 13405#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 13406#(and (not (= 0 main_~list~0.base)) (= (store |#valid| main_~list~0.base 0) |old(#valid)|))] [2018-02-02 20:44:27,042 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:44:27,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:27,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:27,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:27,042 INFO L87 Difference]: Start difference. First operand 292 states and 330 transitions. Second operand 5 states. [2018-02-02 20:44:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:27,135 INFO L93 Difference]: Finished difference Result 331 states and 369 transitions. [2018-02-02 20:44:27,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:44:27,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-02-02 20:44:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:27,136 INFO L225 Difference]: With dead ends: 331 [2018-02-02 20:44:27,136 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 20:44:27,136 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:44:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 20:44:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-02-02 20:44:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 20:44:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 338 transitions. [2018-02-02 20:44:27,139 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 338 transitions. Word has length 57 [2018-02-02 20:44:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:27,139 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 338 transitions. [2018-02-02 20:44:27,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 338 transitions. [2018-02-02 20:44:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:44:27,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:27,140 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:27,141 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:27,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1383831736, now seen corresponding path program 1 times [2018-02-02 20:44:27,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:27,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:44:27,369 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:44:27,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:27,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:44:27,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:27,370 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:44:27,370 INFO L182 omatonBuilderFactory]: Interpolants [14048#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 14049#(and (= 0 |main_#t~malloc5.offset|) (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~malloc5.base|))), 14050#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 14051#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~mem7.base|))), 14052#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))), 14053#(and (= main_~list~0.offset 0) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~mem9.offset| 0)), 14054#(and (= main_~list~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))), 14055#(and (= main_~list~0.offset 0) (or (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))), 14056#(and (= main_~list~0.offset 0) (or (not |main_#t~short13|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))), 14057#(and (= main_~list~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 14058#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 14059#(= 1 (select |#valid| |main_#t~mem37.base|)), 14060#(= 1 (select |#valid| main_~end~0.base)), 14044#true, 14045#false, 14046#(= 0 |main_#t~malloc0.offset|), 14047#(= main_~list~0.offset 0)] [2018-02-02 20:44:27,370 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:44:27,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:44:27,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:44:27,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:44:27,370 INFO L87 Difference]: Start difference. First operand 300 states and 338 transitions. Second operand 17 states. [2018-02-02 20:44:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:28,262 INFO L93 Difference]: Finished difference Result 503 states and 553 transitions. [2018-02-02 20:44:28,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:44:28,263 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-02-02 20:44:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:28,264 INFO L225 Difference]: With dead ends: 503 [2018-02-02 20:44:28,264 INFO L226 Difference]: Without dead ends: 503 [2018-02-02 20:44:28,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=370, Invalid=1190, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:44:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-02 20:44:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 310. [2018-02-02 20:44:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 20:44:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 350 transitions. [2018-02-02 20:44:28,270 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 350 transitions. Word has length 59 [2018-02-02 20:44:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:28,270 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 350 transitions. [2018-02-02 20:44:28,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:44:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 350 transitions. [2018-02-02 20:44:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:44:28,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:28,271 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:28,271 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1383831735, now seen corresponding path program 1 times [2018-02-02 20:44:28,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:28,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:28,593 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:44:28,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:28,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:44:28,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:28,594 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:44:28,594 INFO L182 omatonBuilderFactory]: Interpolants [14920#true, 14921#false, 14922#(= 0 |main_#t~malloc0.offset|), 14923#(= main_~list~0.offset 0), 14924#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 14925#(and (= 0 |main_#t~malloc5.offset|) (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~malloc5.base|))), 14926#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 14927#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~mem7.base|))), 14928#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))), 14929#(and (= main_~list~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0)), 14930#(and (= main_~list~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))), 14931#(and (= main_~list~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)))), 14932#(and (= main_~list~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (not |main_#t~short13|))), 14933#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 14934#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 14935#(and (= 0 |main_#t~mem37.offset|) (<= 12 (select |#length| |main_#t~mem37.base|))), 14936#(and (= main_~end~0.offset 0) (<= 12 (select |#length| main_~end~0.base)))] [2018-02-02 20:44:28,594 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:44:28,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:44:28,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:44:28,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:44:28,595 INFO L87 Difference]: Start difference. First operand 310 states and 350 transitions. Second operand 17 states. [2018-02-02 20:44:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:29,427 INFO L93 Difference]: Finished difference Result 504 states and 554 transitions. [2018-02-02 20:44:29,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:44:29,427 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-02-02 20:44:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:29,428 INFO L225 Difference]: With dead ends: 504 [2018-02-02 20:44:29,428 INFO L226 Difference]: Without dead ends: 504 [2018-02-02 20:44:29,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=368, Invalid=1114, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:44:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-02-02 20:44:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 317. [2018-02-02 20:44:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-02 20:44:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 356 transitions. [2018-02-02 20:44:29,433 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 356 transitions. Word has length 59 [2018-02-02 20:44:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:29,433 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 356 transitions. [2018-02-02 20:44:29,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:44:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 356 transitions. [2018-02-02 20:44:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:44:29,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:29,434 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, 1, 1, 1, 1, 1] [2018-02-02 20:44:29,434 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:29,434 INFO L82 PathProgramCache]: Analyzing trace with hash -868408448, now seen corresponding path program 1 times [2018-02-02 20:44:29,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:29,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:44:29,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:29,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:44:29,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:29,509 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:44:29,509 INFO L182 omatonBuilderFactory]: Interpolants [15808#(or (not (= main_~end~0.offset 0)) (not (= main_~end~0.base 0))), 15802#true, 15803#false, 15804#(and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 15805#(or (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)) 0)) (not |main_#t~short13|) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) 0))), 15806#(or (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) 0))), 15807#(or (not (= |main_#t~mem37.base| 0)) (not (= |main_#t~mem37.offset| 0)))] [2018-02-02 20:44:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:44:29,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:44:29,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:44:29,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:44:29,510 INFO L87 Difference]: Start difference. First operand 317 states and 356 transitions. Second operand 7 states. [2018-02-02 20:44:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:29,677 INFO L93 Difference]: Finished difference Result 339 states and 373 transitions. [2018-02-02 20:44:29,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:44:29,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-02-02 20:44:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:29,678 INFO L225 Difference]: With dead ends: 339 [2018-02-02 20:44:29,678 INFO L226 Difference]: Without dead ends: 339 [2018-02-02 20:44:29,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:44:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-02-02 20:44:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 317. [2018-02-02 20:44:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-02 20:44:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 355 transitions. [2018-02-02 20:44:29,681 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 355 transitions. Word has length 62 [2018-02-02 20:44:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:29,681 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 355 transitions. [2018-02-02 20:44:29,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:44:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 355 transitions. [2018-02-02 20:44:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:44:29,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:29,681 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-02-02 20:44:29,682 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:29,682 INFO L82 PathProgramCache]: Analyzing trace with hash -64861364, now seen corresponding path program 1 times [2018-02-02 20:44:29,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:29,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:29,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:29,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:44:29,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:29,748 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:44:29,748 INFO L182 omatonBuilderFactory]: Interpolants [16473#true, 16474#false, 16475#(and (= (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8)) |main_#t~mem33.base|) (= (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8)) |main_#t~mem33.offset|)), 16476#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8)))), 16477#(and (= 0 |main_#t~mem35.offset|) (= 0 |main_#t~mem35.base|)), 16478#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))] [2018-02-02 20:44:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:29,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:44:29,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:44:29,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:44:29,749 INFO L87 Difference]: Start difference. First operand 317 states and 355 transitions. Second operand 6 states. [2018-02-02 20:44:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:29,849 INFO L93 Difference]: Finished difference Result 308 states and 340 transitions. [2018-02-02 20:44:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:29,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-02-02 20:44:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:29,850 INFO L225 Difference]: With dead ends: 308 [2018-02-02 20:44:29,850 INFO L226 Difference]: Without dead ends: 308 [2018-02-02 20:44:29,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:44:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-02 20:44:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-02-02 20:44:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-02 20:44:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 340 transitions. [2018-02-02 20:44:29,854 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 340 transitions. Word has length 64 [2018-02-02 20:44:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:29,854 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 340 transitions. [2018-02-02 20:44:29,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:44:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 340 transitions. [2018-02-02 20:44:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:44:29,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:29,855 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:29,855 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1078175451, now seen corresponding path program 1 times [2018-02-02 20:44:29,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:29,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:44:29,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:29,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:44:29,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:29,980 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:44:29,980 INFO L182 omatonBuilderFactory]: Interpolants [17104#(or (and (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= 0 |main_#t~mem9.base|))) (= 0 (select |#valid| |main_#t~mem9.base|))), 17105#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 17106#(not (= 0 |main_#t~mem11.base|)), 17107#|main_#t~short13|, 17097#true, 17098#false, 17099#(= 0 (select |#valid| 0)), 17100#(and (= 0 (select |#valid| 0)) (= (select |#valid| main_~list~0.base) 1)), 17101#(and (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 0 (select |#valid| 0))), 17102#(and (= 0 (select |#valid| 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 17103#(and (= 0 (select |#valid| 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base |main_#t~mem7.base|)))] [2018-02-02 20:44:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:44:29,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:44:29,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:44:29,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:44:29,981 INFO L87 Difference]: Start difference. First operand 308 states and 340 transitions. Second operand 11 states. [2018-02-02 20:44:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:30,372 INFO L93 Difference]: Finished difference Result 457 states and 507 transitions. [2018-02-02 20:44:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:44:30,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-02-02 20:44:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:30,373 INFO L225 Difference]: With dead ends: 457 [2018-02-02 20:44:30,373 INFO L226 Difference]: Without dead ends: 457 [2018-02-02 20:44:30,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:44:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-02 20:44:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 278. [2018-02-02 20:44:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-02 20:44:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 308 transitions. [2018-02-02 20:44:30,376 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 308 transitions. Word has length 64 [2018-02-02 20:44:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:30,376 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 308 transitions. [2018-02-02 20:44:30,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:44:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 308 transitions. [2018-02-02 20:44:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:44:30,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:30,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:30,377 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1463894548, now seen corresponding path program 1 times [2018-02-02 20:44:30,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:30,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:30,540 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:44:30,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:30,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:44:30,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:30,540 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:44:30,540 INFO L182 omatonBuilderFactory]: Interpolants [17872#(and (not (= main_~list~0.base |main_#t~mem37.base|)) (= 1 (select |#valid| main_~list~0.base))), 17873#(and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~list~0.base main_~end~0.base))), 17874#(and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~list~0.base main_~end~0.base)) (or (not (= main_~end~0.offset 0)) (not (= main_~end~0.base 0)))), 17865#true, 17866#false, 17867#(= (select |#valid| main_~list~0.base) 1), 17868#(not (= |main_#t~malloc5.base| main_~list~0.base)), 17869#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)) (= 1 (select |#valid| main_~list~0.base))), 17870#(and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~list~0.base |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 17871#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| main_~list~0.base)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))] [2018-02-02 20:44:30,541 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:44:30,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:44:30,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:44:30,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:44:30,541 INFO L87 Difference]: Start difference. First operand 278 states and 308 transitions. Second operand 10 states. [2018-02-02 20:44:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:30,757 INFO L93 Difference]: Finished difference Result 435 states and 485 transitions. [2018-02-02 20:44:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:44:30,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-02-02 20:44:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:30,759 INFO L225 Difference]: With dead ends: 435 [2018-02-02 20:44:30,759 INFO L226 Difference]: Without dead ends: 435 [2018-02-02 20:44:30,759 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:44:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-02 20:44:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 279. [2018-02-02 20:44:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-02 20:44:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 309 transitions. [2018-02-02 20:44:30,762 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 309 transitions. Word has length 67 [2018-02-02 20:44:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:30,763 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 309 transitions. [2018-02-02 20:44:30,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:44:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 309 transitions. [2018-02-02 20:44:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:44:30,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:30,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:30,763 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1469129984, now seen corresponding path program 1 times [2018-02-02 20:44:30,764 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:30,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:30,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:30,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:44:30,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:30,798 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:44:30,798 INFO L182 omatonBuilderFactory]: Interpolants [18608#false, 18609#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 18610#(and (= 0 |main_#t~mem29.offset|) (= |main_#t~mem29.base| 0)), 18611#(not |main_#t~short31|), 18607#true] [2018-02-02 20:44:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:30,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:30,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:30,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:30,799 INFO L87 Difference]: Start difference. First operand 279 states and 309 transitions. Second operand 5 states. [2018-02-02 20:44:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:30,863 INFO L93 Difference]: Finished difference Result 295 states and 326 transitions. [2018-02-02 20:44:30,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:30,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-02-02 20:44:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:30,864 INFO L225 Difference]: With dead ends: 295 [2018-02-02 20:44:30,864 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 20:44:30,864 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:44:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 20:44:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 283. [2018-02-02 20:44:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 20:44:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2018-02-02 20:44:30,867 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 69 [2018-02-02 20:44:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:30,867 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2018-02-02 20:44:30,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2018-02-02 20:44:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:44:30,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:30,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:30,868 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:30,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1957356603, now seen corresponding path program 1 times [2018-02-02 20:44:30,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:30,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:31,393 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:44:31,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:31,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:44:31,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:31,394 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:44:31,394 INFO L182 omatonBuilderFactory]: Interpolants [19200#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem11.offset|) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 19201#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |main_#t~short13|)), 19202#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 19203#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= (select |#valid| main_~end~0.base) 1) (< main_~end~0.offset (+ main_~list~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 19204#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= (select |#memory_$Pointer$.offset| main_~list~0.base) (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.offset|)) main_~end~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.base|) (+ main_~list~0.offset 8))) (not (= main_~end~0.base |main_#t~malloc15.base|)) (< main_~end~0.offset (+ main_~list~0.offset 1))), 19205#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (< main_~end~0.offset (+ main_~list~0.offset 1)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 19206#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (< main_~end~0.offset (+ main_~list~0.offset 1)) (not (= main_~end~0.base |main_#t~mem17.base|))), 19207#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 19208#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 19209#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 19210#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 19211#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 19212#(and (= 0 |main_#t~mem32.offset|) (= 0 |main_#t~mem32.base|)), 19213#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base)), 19194#true, 19195#false, 19196#(= 0 |main_#t~malloc0.offset|), 19197#(= 0 main_~list~0.offset), 19198#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 19199#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))] [2018-02-02 20:44:31,394 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:44:31,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:44:31,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:44:31,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:44:31,395 INFO L87 Difference]: Start difference. First operand 283 states and 313 transitions. Second operand 20 states. [2018-02-02 20:44:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:32,529 INFO L93 Difference]: Finished difference Result 473 states and 510 transitions. [2018-02-02 20:44:32,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:44:32,529 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2018-02-02 20:44:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:32,530 INFO L225 Difference]: With dead ends: 473 [2018-02-02 20:44:32,530 INFO L226 Difference]: Without dead ends: 473 [2018-02-02 20:44:32,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=444, Invalid=1626, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:44:32,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-02 20:44:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 331. [2018-02-02 20:44:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-02 20:44:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 364 transitions. [2018-02-02 20:44:32,533 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 364 transitions. Word has length 71 [2018-02-02 20:44:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:32,533 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 364 transitions. [2018-02-02 20:44:32,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:44:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 364 transitions. [2018-02-02 20:44:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:44:32,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:32,534 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:32,534 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:32,534 INFO L82 PathProgramCache]: Analyzing trace with hash -291827989, now seen corresponding path program 1 times [2018-02-02 20:44:32,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:32,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:32,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:32,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:44:32,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:32,691 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:44:32,691 INFO L182 omatonBuilderFactory]: Interpolants [20070#true, 20071#false, 20072#(= (select |#valid| main_~list~0.base) 1), 20073#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 20074#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 1 (select |#valid| |main_#t~malloc15.base|))), 20075#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 20076#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~mem17.base|))), 20077#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 20078#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 20079#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset))), 20080#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 20081#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 20082#(= 1 (select |#valid| |main_#t~mem36.base|)), 20083#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 20:44:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:32,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:44:32,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:44:32,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:44:32,692 INFO L87 Difference]: Start difference. First operand 331 states and 364 transitions. Second operand 14 states. [2018-02-02 20:44:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:33,134 INFO L93 Difference]: Finished difference Result 507 states and 551 transitions. [2018-02-02 20:44:33,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:44:33,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-02-02 20:44:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:33,136 INFO L225 Difference]: With dead ends: 507 [2018-02-02 20:44:33,136 INFO L226 Difference]: Without dead ends: 507 [2018-02-02 20:44:33,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:44:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-02 20:44:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 408. [2018-02-02 20:44:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-02 20:44:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 452 transitions. [2018-02-02 20:44:33,140 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 452 transitions. Word has length 73 [2018-02-02 20:44:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:33,141 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 452 transitions. [2018-02-02 20:44:33,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:44:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 452 transitions. [2018-02-02 20:44:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:44:33,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:33,142 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:33,142 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash -291827988, now seen corresponding path program 1 times [2018-02-02 20:44:33,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:33,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:33,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:33,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:44:33,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:33,386 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:44:33,387 INFO L182 omatonBuilderFactory]: Interpolants [21025#true, 21026#false, 21027#(= (select |#valid| main_~list~0.base) 1), 21028#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 21029#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 12 (select |#length| |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 21030#(and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 21031#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~list~0.offset))) (not (= main_~end~0.base |main_#t~mem17.base|))), 21032#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 21033#(and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 21034#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)))), 21035#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 21036#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 21037#(and (= 0 |main_#t~mem36.offset|) (= 12 (select |#length| |main_#t~mem36.base|))), 21038#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12))] [2018-02-02 20:44:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:33,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:44:33,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:44:33,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:44:33,387 INFO L87 Difference]: Start difference. First operand 408 states and 452 transitions. Second operand 14 states. [2018-02-02 20:44:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:34,165 INFO L93 Difference]: Finished difference Result 535 states and 582 transitions. [2018-02-02 20:44:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:44:34,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-02-02 20:44:34,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:34,167 INFO L225 Difference]: With dead ends: 535 [2018-02-02 20:44:34,167 INFO L226 Difference]: Without dead ends: 535 [2018-02-02 20:44:34,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:44:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-02 20:44:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 431. [2018-02-02 20:44:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-02-02 20:44:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 480 transitions. [2018-02-02 20:44:34,173 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 480 transitions. Word has length 73 [2018-02-02 20:44:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:34,173 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 480 transitions. [2018-02-02 20:44:34,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:44:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 480 transitions. [2018-02-02 20:44:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:44:34,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:34,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:34,174 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash -702455777, now seen corresponding path program 1 times [2018-02-02 20:44:34,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:34,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:34,716 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:44:34,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:34,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:44:34,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:34,717 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:44:34,717 INFO L182 omatonBuilderFactory]: Interpolants [22025#true, 22026#false, 22027#(= |#valid| |old(#valid)|), 22028#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 22029#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= (store |#valid| main_~list~0.base 0) |old(#valid)|)), 22030#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= (store |#valid| main_~list~0.base 0) |old(#valid)|) (= (select |#valid| main_~list~0.base) 1)), 22031#(and (= 0 |main_#t~malloc5.offset|) (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (not (= main_~list~0.base |main_#t~malloc5.base|)) (= |old(#valid)| (store (store |#valid| main_~list~0.base 0) |main_#t~malloc5.base| 0))), 22032#(and (= main_~list~0.offset 0) (= (store (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) 0) |old(#valid)|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= 0 main_~list~0.base)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 22033#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= 0 main_~list~0.base)) (or (= (store (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) 0) |old(#valid)|) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base |main_#t~mem7.base|))), 22034#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= 0 main_~list~0.base)) (or (= (store (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) 0) |old(#valid)|) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 22035#(and (= main_~list~0.offset 0) (or (and (= (store (store |#valid| main_~list~0.base 0) (select (select (store |#memory_$Pointer$.base| |main_#t~mem9.base| (store (select |#memory_$Pointer$.base| |main_#t~mem9.base|) (+ |main_#t~mem9.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)) 0) |old(#valid)|) (not (= 0 main_~list~0.base)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0)), 22036#(and (= main_~list~0.offset 0) (or (and (= (store (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) 0) |old(#valid)|) (not (= 0 main_~list~0.base)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 22037#(and (= main_~list~0.offset 0) (or (and (not (= main_~list~0.base |main_#t~mem37.base|)) (not (= 0 main_~list~0.base)) (= (store (store |#valid| main_~list~0.base 0) |main_#t~mem37.base| 0) |old(#valid)|)) (= 0 |main_#t~mem37.base|))), 22038#(and (= main_~list~0.offset 0) (or (and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (= |old(#valid)| (store (store |#valid| main_~end~0.base 0) main_~list~0.base 0))) (= main_~end~0.base 0))), 22039#(and (or (not (= main_~end~0.offset 0)) (not (= main_~end~0.base 0))) (or (= main_~end~0.base 0) (and (= main_~list~0.offset 0) (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (= |old(#valid)| (store (store |#valid| main_~end~0.base 0) main_~list~0.base 0)))))] [2018-02-02 20:44:34,717 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:44:34,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:44:34,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:44:34,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:44:34,717 INFO L87 Difference]: Start difference. First operand 431 states and 480 transitions. Second operand 15 states. [2018-02-02 20:44:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:35,606 INFO L93 Difference]: Finished difference Result 439 states and 487 transitions. [2018-02-02 20:44:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:44:35,607 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-02-02 20:44:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:35,607 INFO L225 Difference]: With dead ends: 439 [2018-02-02 20:44:35,607 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 20:44:35,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:44:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 20:44:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-02-02 20:44:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 20:44:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 426 transitions. [2018-02-02 20:44:35,610 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 426 transitions. Word has length 75 [2018-02-02 20:44:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:35,610 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 426 transitions. [2018-02-02 20:44:35,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:44:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 426 transitions. [2018-02-02 20:44:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:44:35,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:35,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:35,611 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash -285073248, now seen corresponding path program 1 times [2018-02-02 20:44:35,611 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:35,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:36,196 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:44:36,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:36,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:44:36,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:36,197 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:44:36,197 INFO L182 omatonBuilderFactory]: Interpolants [22912#(= 1 (select |#valid| |main_#t~mem32.base|)), 22913#(= 1 (select |#valid| main_~inner~0.base)), 22889#true, 22890#false, 22891#(= 0 |main_#t~malloc0.offset|), 22892#(= 0 main_~list~0.offset), 22893#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 22894#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~list~0.base |main_#t~malloc5.base|)) (<= 0 main_~list~0.offset) (= (select |#valid| |main_#t~malloc5.base|) 1) (<= main_~list~0.offset 0)), 22895#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (<= 0 main_~list~0.offset) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (<= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 22896#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~mem7.base|))), 22897#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 22898#(and (= 0 main_~list~0.offset) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~list~0.base) 1) (or (= main_~list~0.base |main_#t~mem9.base|) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem9.base| (store (select |#memory_$Pointer$.base| |main_#t~mem9.base|) (+ |main_#t~mem9.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) 1))), 22899#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 22900#(and (= 0 main_~list~0.offset) (or (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= (select |#valid| main_~list~0.base) 1)), 22901#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (or (not |main_#t~short13|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))), 22902#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 22903#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= main_~end~0.base main_~list~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset))), 22904#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.base|) (+ main_~list~0.offset 8)))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset))), 22905#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset))), 22906#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8)))) (not (= main_~end~0.base |main_#t~mem17.base|))), 22907#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 22908#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))))), 22909#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 22910#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 22911#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))] [2018-02-02 20:44:36,197 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:44:36,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:44:36,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:44:36,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:44:36,197 INFO L87 Difference]: Start difference. First operand 380 states and 426 transitions. Second operand 25 states. [2018-02-02 20:44:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:37,844 INFO L93 Difference]: Finished difference Result 827 states and 919 transitions. [2018-02-02 20:44:37,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:44:37,845 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-02-02 20:44:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:37,846 INFO L225 Difference]: With dead ends: 827 [2018-02-02 20:44:37,846 INFO L226 Difference]: Without dead ends: 827 [2018-02-02 20:44:37,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=706, Invalid=2374, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:44:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-02-02 20:44:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 380. [2018-02-02 20:44:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 20:44:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 425 transitions. [2018-02-02 20:44:37,850 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 425 transitions. Word has length 76 [2018-02-02 20:44:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:37,850 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 425 transitions. [2018-02-02 20:44:37,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:44:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 425 transitions. [2018-02-02 20:44:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:44:37,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:37,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:37,851 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash -285073247, now seen corresponding path program 1 times [2018-02-02 20:44:37,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:37,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:38,693 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:44:38,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:38,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:44:38,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:38,693 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:44:38,693 INFO L182 omatonBuilderFactory]: Interpolants [24192#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem9.base| (store (select |#memory_$Pointer$.base| |main_#t~mem9.base|) (+ |main_#t~mem9.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem9.base| (store (select |#memory_$Pointer$.base| |main_#t~mem9.base|) (+ |main_#t~mem9.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) 1)) (= main_~list~0.base |main_#t~mem9.base|)) (= 0 main_~list~0.offset) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~list~0.base) 1)), 24193#(and (= 0 main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= (select |#valid| main_~list~0.base) 1)), 24194#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 24195#(and (= 0 main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (not |main_#t~short13|)) (= (select |#valid| main_~list~0.base) 1)), 24196#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~end~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1) (< main_~end~0.offset (+ main_~list~0.offset 1))), 24197#(and (= main_~end~0.base main_~list~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.offset|)) main_~end~0.base) (+ main_~list~0.offset 8))) (< main_~end~0.offset (+ main_~list~0.offset 1)) (not (= main_~list~0.base |main_#t~malloc15.base|)) (<= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.base|) (+ main_~list~0.offset 8))))), 24198#(and (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (< main_~end~0.offset (+ main_~list~0.offset 1))), 24199#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (< main_~end~0.offset (+ main_~list~0.offset 1)) (not (= main_~end~0.base |main_#t~mem17.base|))), 24200#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 24201#(and (not (= main_~end~0.base main_~list~0.base)) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 24202#(and (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 24203#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 24204#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))), 24205#(and (= 0 |main_#t~mem32.offset|) (<= 12 (select |#length| |main_#t~mem32.base|))), 24206#(and (= main_~inner~0.offset 0) (<= 12 (select |#length| main_~inner~0.base))), 24183#true, 24184#false, 24185#(= 0 |main_#t~malloc0.offset|), 24186#(= 0 main_~list~0.offset), 24187#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 24188#(and (= 0 |main_#t~malloc5.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc5.base|)) (<= 0 main_~list~0.offset) (= (select |#valid| |main_#t~malloc5.base|) 1) (= 12 (select |#length| |main_#t~malloc5.base|)) (<= main_~list~0.offset 0)), 24189#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (<= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (<= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 24190#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#length| |main_#t~mem7.base|) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 24191#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))] [2018-02-02 20:44:38,694 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:44:38,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:44:38,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:44:38,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:44:38,694 INFO L87 Difference]: Start difference. First operand 380 states and 425 transitions. Second operand 24 states. [2018-02-02 20:44:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:40,649 INFO L93 Difference]: Finished difference Result 560 states and 615 transitions. [2018-02-02 20:44:40,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:44:40,649 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-02-02 20:44:40,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:40,650 INFO L225 Difference]: With dead ends: 560 [2018-02-02 20:44:40,650 INFO L226 Difference]: Without dead ends: 560 [2018-02-02 20:44:40,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=502, Invalid=2578, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:44:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-02-02 20:44:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 380. [2018-02-02 20:44:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 20:44:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 422 transitions. [2018-02-02 20:44:40,653 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 422 transitions. Word has length 76 [2018-02-02 20:44:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:40,653 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 422 transitions. [2018-02-02 20:44:40,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:44:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 422 transitions. [2018-02-02 20:44:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:44:40,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:40,654 INFO L351 BasicCegarLoop]: trace histogram [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, 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:44:40,654 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1493495196, now seen corresponding path program 1 times [2018-02-02 20:44:40,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:40,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:41,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:41,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:44:41,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:41,236 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:44:41,236 INFO L182 omatonBuilderFactory]: Interpolants [25216#(and (= main_~end~0.offset 0) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 25217#(and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 25218#(or (and (= main_~end~0.base main_~list~0.base) (not (= (+ main_~end~0.offset 8) main_~list~0.offset)) (= main_~list~0.base (select (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0) main_~list~0.offset))) (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)) (<= (+ main_~end~0.offset 8) 0) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 25219#(and (or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base) (not (= (+ main_~end~0.offset 8) main_~list~0.offset)))) (= (select |#valid| main_~end~0.base) 1)), 25220#(and (or (and (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc23.base|))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|) main_~end~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|) main_~end~0.offset)))) (not (= main_~end~0.base |main_#t~malloc23.base|))), 25221#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (or (and (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1)))), 25222#(and (or (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 1 (select |#valid| main_~end~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset))) (and (or (and (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8)))))) (not (= main_~end~0.base |main_#t~mem25.base|))), 25223#(or (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))) (and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (or (and (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))))), 25224#(or (and (not (= main_~end~0.base |main_#t~mem27.base|)) (or (and (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))) (and (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base)))), 25225#(or (and (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base)) (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 25226#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 25227#(or (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 25228#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 25229#(or (= 1 (select |#valid| |main_#t~mem36.base|)) (and (= 0 |main_#t~mem36.offset|) (= 0 |main_#t~mem36.base|))), 25230#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (= 1 (select |#valid| main_~end~0.base))), 25231#(= 1 (select |#valid| main_~end~0.base)), 25211#true, 25212#false, 25213#(= 0 |main_#t~malloc0.offset|), 25214#(= 0 main_~list~0.offset), 25215#(and (= main_~end~0.offset 0) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base))] [2018-02-02 20:44:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:41,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:44:41,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:44:41,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:44:41,237 INFO L87 Difference]: Start difference. First operand 380 states and 422 transitions. Second operand 21 states. [2018-02-02 20:44:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:42,578 INFO L93 Difference]: Finished difference Result 543 states and 590 transitions. [2018-02-02 20:44:42,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:44:42,578 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-02-02 20:44:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:42,579 INFO L225 Difference]: With dead ends: 543 [2018-02-02 20:44:42,580 INFO L226 Difference]: Without dead ends: 543 [2018-02-02 20:44:42,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=444, Invalid=1536, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:44:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-02 20:44:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 433. [2018-02-02 20:44:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-02 20:44:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 485 transitions. [2018-02-02 20:44:42,583 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 485 transitions. Word has length 78 [2018-02-02 20:44:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:42,583 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 485 transitions. [2018-02-02 20:44:42,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:44:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 485 transitions. [2018-02-02 20:44:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:44:42,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:42,584 INFO L351 BasicCegarLoop]: trace histogram [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, 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:44:42,584 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1493495197, now seen corresponding path program 1 times [2018-02-02 20:44:42,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:42,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:43,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:43,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:44:43,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:43,209 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:44:43,209 INFO L182 omatonBuilderFactory]: Interpolants [26272#(and (not (= main_~end~0.base |main_#t~mem27.base|)) (or (and (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 26273#(or (and (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 26274#(or (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 26275#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 26276#(or (and (<= (+ |main_#t~mem36.offset| 12) (select |#length| |main_#t~mem36.base|)) (<= 0 |main_#t~mem36.offset|)) (and (= 0 |main_#t~mem36.offset|) (= 0 |main_#t~mem36.base|))), 26277#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (and (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (<= 0 main_~end~0.offset))), 26278#(and (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (<= 0 main_~end~0.offset)), 26256#true, 26257#false, 26258#(= |main_#t~malloc0.offset| 0), 26259#(= main_~list~0.offset 0), 26260#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 26261#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 26262#(and (= main_~list~0.offset |main_#t~malloc15.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|))), 26263#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 26264#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem17.base|))), 26265#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 26266#(and (= main_~list~0.offset |main_#t~mem19.offset|) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem19.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 26267#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 26268#(and (or (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= (select |#valid| main_~end~0.base) 1)), 26269#(and (not (= main_~end~0.base |main_#t~malloc23.base|)) (or (and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc23.base|)) (<= 0 main_~end~0.offset)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|) main_~end~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|) main_~end~0.offset))))), 26270#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (or (and (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 26271#(and (or (and (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem25.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (<= 0 main_~end~0.offset) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))) (not (= main_~end~0.base |main_#t~mem25.base|)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8)))))] [2018-02-02 20:44:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:43,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:44:43,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:44:43,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:44:43,210 INFO L87 Difference]: Start difference. First operand 433 states and 485 transitions. Second operand 23 states. [2018-02-02 20:44:44,018 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 98 DAG size of output 80 [2018-02-02 20:44:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:44,984 INFO L93 Difference]: Finished difference Result 586 states and 637 transitions. [2018-02-02 20:44:44,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:44:44,984 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-02-02 20:44:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:44,986 INFO L225 Difference]: With dead ends: 586 [2018-02-02 20:44:44,986 INFO L226 Difference]: Without dead ends: 586 [2018-02-02 20:44:44,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=503, Invalid=2149, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:44:44,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-02-02 20:44:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 407. [2018-02-02 20:44:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-02 20:44:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 456 transitions. [2018-02-02 20:44:44,989 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 456 transitions. Word has length 78 [2018-02-02 20:44:44,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:44,989 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 456 transitions. [2018-02-02 20:44:44,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:44:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 456 transitions. [2018-02-02 20:44:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:44:44,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:44,990 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, 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:44:44,990 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1138128359, now seen corresponding path program 1 times [2018-02-02 20:44:44,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:45,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:45,538 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:44:45,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:45,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:44:45,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:45,539 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:44:45,539 INFO L182 omatonBuilderFactory]: Interpolants [27330#true, 27331#false, 27332#(= 0 |main_#t~malloc0.offset|), 27333#(= 0 main_~list~0.offset), 27334#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 27335#(and (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 0 main_~list~0.offset) (= (select |#valid| |main_#t~malloc5.base|) 1)), 27336#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 27337#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~mem7.base|))), 27338#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 27339#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 27340#(and (= main_~end~0.base main_~list~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 27341#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc15.base|)) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 27342#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= main_~end~0.base main_~list~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset))), 27343#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8)))) (not (= main_~end~0.base |main_#t~mem17.base|))), 27344#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 27345#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 27346#(and (not (= main_~end~0.base main_~list~0.base)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 27347#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base |main_#t~malloc23.base|)) (not (= main_~end~0.base |main_#t~malloc23.base|))), 27348#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 27349#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~end~0.base |main_#t~mem25.base|)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8))))), 27350#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 27351#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 27352#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 27353#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 27354#(= 1 (select |#valid| |main_#t~mem32.base|)), 27355#(= 1 (select |#valid| main_~inner~0.base))] [2018-02-02 20:44:45,539 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:44:45,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:44:45,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:44:45,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:44:45,540 INFO L87 Difference]: Start difference. First operand 407 states and 456 transitions. Second operand 26 states. [2018-02-02 20:44:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:47,738 INFO L93 Difference]: Finished difference Result 1037 states and 1152 transitions. [2018-02-02 20:44:47,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 20:44:47,739 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-02-02 20:44:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:47,740 INFO L225 Difference]: With dead ends: 1037 [2018-02-02 20:44:47,741 INFO L226 Difference]: Without dead ends: 1037 [2018-02-02 20:44:47,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=963, Invalid=4007, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 20:44:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-02-02 20:44:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 407. [2018-02-02 20:44:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-02 20:44:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 455 transitions. [2018-02-02 20:44:47,746 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 455 transitions. Word has length 81 [2018-02-02 20:44:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:47,746 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 455 transitions. [2018-02-02 20:44:47,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:44:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 455 transitions. [2018-02-02 20:44:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:44:47,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:47,747 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, 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:44:47,747 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1138128360, now seen corresponding path program 1 times [2018-02-02 20:44:47,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:47,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:48,584 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:44:48,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:48,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:44:48,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:48,585 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:44:48,585 INFO L182 omatonBuilderFactory]: Interpolants [28890#true, 28891#false, 28892#(= 0 |main_#t~malloc0.offset|), 28893#(= 0 main_~list~0.offset), 28894#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 28895#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 0 main_~list~0.offset) (= (select |#valid| |main_#t~malloc5.base|) 1) (= 12 (select |#length| |main_#t~malloc5.base|))), 28896#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 28897#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~mem7.base|))), 28898#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 28899#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 28900#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.offset (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 28901#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.offset (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 28902#(and (not (= main_~end~0.offset (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 28903#(and (not (= main_~end~0.offset (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base |main_#t~mem17.base|))), 28904#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 28905#(and (not (= main_~end~0.base main_~list~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~list~0.base) 1)), 28906#(and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 28907#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|)) main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~malloc23.base|)) (not (= main_~end~0.base |main_#t~malloc23.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) (+ main_~list~0.offset 8))))), 28908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 28909#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem25.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~end~0.base |main_#t~mem25.base|)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8))))), 28910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 28911#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))))), 28912#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 28913#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))), 28914#(and (= 0 |main_#t~mem32.offset|) (= 12 (select |#length| |main_#t~mem32.base|))), 28915#(and (= (select |#length| main_~inner~0.base) 12) (= main_~inner~0.offset 0))] [2018-02-02 20:44:48,585 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:44:48,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:44:48,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:44:48,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:44:48,586 INFO L87 Difference]: Start difference. First operand 407 states and 455 transitions. Second operand 26 states. [2018-02-02 20:44:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:51,608 INFO L93 Difference]: Finished difference Result 1042 states and 1157 transitions. [2018-02-02 20:44:51,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 20:44:51,609 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-02-02 20:44:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:51,610 INFO L225 Difference]: With dead ends: 1042 [2018-02-02 20:44:51,610 INFO L226 Difference]: Without dead ends: 1042 [2018-02-02 20:44:51,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1007, Invalid=4395, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 20:44:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2018-02-02 20:44:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 377. [2018-02-02 20:44:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-02 20:44:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 419 transitions. [2018-02-02 20:44:51,614 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 419 transitions. Word has length 81 [2018-02-02 20:44:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:51,615 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 419 transitions. [2018-02-02 20:44:51,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:44:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 419 transitions. [2018-02-02 20:44:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:44:51,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:51,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:51,615 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1529509980, now seen corresponding path program 1 times [2018-02-02 20:44:51,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:51,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:51,768 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:44:51,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:51,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:44:51,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:51,769 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:44:51,769 INFO L182 omatonBuilderFactory]: Interpolants [30432#false, 30433#(= (select |#valid| main_~list~0.base) 1), 30434#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 30435#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|)) (not (= 0 |main_#t~malloc15.base|))), 30436#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 30437#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~mem17.base|)) (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~list~0.offset)))), 30438#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 30439#(and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 30440#(not (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset))), 30441#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 30442#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 30443#(not (= 0 |main_#t~mem36.base|)), 30444#(not (= 0 main_~end~0.base)), 30431#true] [2018-02-02 20:44:51,770 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:44:51,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:44:51,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:44:51,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:44:51,770 INFO L87 Difference]: Start difference. First operand 377 states and 419 transitions. Second operand 14 states. [2018-02-02 20:44:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:52,255 INFO L93 Difference]: Finished difference Result 530 states and 578 transitions. [2018-02-02 20:44:52,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:44:52,255 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 82 [2018-02-02 20:44:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:52,256 INFO L225 Difference]: With dead ends: 530 [2018-02-02 20:44:52,256 INFO L226 Difference]: Without dead ends: 530 [2018-02-02 20:44:52,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:44:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-02 20:44:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 432. [2018-02-02 20:44:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-02-02 20:44:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 478 transitions. [2018-02-02 20:44:52,260 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 478 transitions. Word has length 82 [2018-02-02 20:44:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:52,260 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 478 transitions. [2018-02-02 20:44:52,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:44:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 478 transitions. [2018-02-02 20:44:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:44:52,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:52,261 INFO L351 BasicCegarLoop]: trace histogram [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, 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:44:52,261 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:52,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1616595328, now seen corresponding path program 1 times [2018-02-02 20:44:52,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:52,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:52,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:52,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:44:52,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:52,750 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:44:52,750 INFO L182 omatonBuilderFactory]: Interpolants [31425#true, 31426#false, 31427#(= 0 |main_#t~malloc0.offset|), 31428#(= main_~list~0.offset 0), 31429#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 31430#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (<= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (<= main_~list~0.offset 0)), 31431#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|)) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 0 |main_#t~malloc15.offset|)), 31432#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (<= 0 main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (<= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 31433#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (not (= main_~end~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 31434#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 0 |main_#t~mem19.offset|)), 31435#(and (<= main_~list~0.offset 0) (or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1))) (< main_~end~0.offset main_~list~0.offset))), 31436#(and (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (<= main_~list~0.offset main_~end~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (< main_~end~0.offset (+ main_~list~0.offset 1))), 31437#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)) |main_#t~mem29.base|) (<= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) |main_#t~mem29.offset|) (<= main_~list~0.offset 0) (< main_~end~0.offset (+ main_~list~0.offset 1))), 31438#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= main_~list~0.offset main_~end~0.offset) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (< main_~end~0.offset (+ main_~list~0.offset 1)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) |main_#t~short31|)), 31439#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (<= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (< main_~end~0.offset (+ main_~list~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 31440#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 31441#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 31442#(and (= 0 |main_#t~mem36.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem36.base|) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) (+ 0 8)))), 31443#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~end~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 31444#(and (= 0 |main_#t~mem32.offset|) (= 0 |main_#t~mem32.base|)), 31445#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))] [2018-02-02 20:44:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:52,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:44:52,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:44:52,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:44:52,751 INFO L87 Difference]: Start difference. First operand 432 states and 478 transitions. Second operand 21 states. [2018-02-02 20:44:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:53,848 INFO L93 Difference]: Finished difference Result 518 states and 559 transitions. [2018-02-02 20:44:53,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:44:53,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-02 20:44:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:53,849 INFO L225 Difference]: With dead ends: 518 [2018-02-02 20:44:53,849 INFO L226 Difference]: Without dead ends: 518 [2018-02-02 20:44:53,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=322, Invalid=1484, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:44:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-02-02 20:44:53,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 434. [2018-02-02 20:44:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 20:44:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 480 transitions. [2018-02-02 20:44:53,853 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 480 transitions. Word has length 82 [2018-02-02 20:44:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:53,853 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 480 transitions. [2018-02-02 20:44:53,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:44:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 480 transitions. [2018-02-02 20:44:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:44:53,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:53,854 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, 1, 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:44:53,854 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:53,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1114203120, now seen corresponding path program 2 times [2018-02-02 20:44:53,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:53,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:54,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:54,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:44:54,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:54,113 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:44:54,113 INFO L182 omatonBuilderFactory]: Interpolants [32448#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem17.base|))), 32449#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem19.base|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem19.offset|)), 32450#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 32451#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0) main_~end~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0) main_~end~0.offset))), 32452#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 32453#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 32454#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 32455#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) |main_#t~mem36.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem36.base|) |main_#t~mem36.offset|))), 32456#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 32457#(and (= 0 |main_#t~mem36.offset|) (= 0 |main_#t~mem36.base|)), 32458#(and (= main_~end~0.offset 0) (= main_~end~0.base 0)), 32442#true, 32443#false, 32444#(= (select |#valid| main_~list~0.base) 1), 32445#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 32446#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|))), 32447#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))] [2018-02-02 20:44:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:54,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:44:54,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:44:54,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:44:54,114 INFO L87 Difference]: Start difference. First operand 434 states and 480 transitions. Second operand 17 states. [2018-02-02 20:44:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:54,854 INFO L93 Difference]: Finished difference Result 490 states and 533 transitions. [2018-02-02 20:44:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:44:54,854 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-02 20:44:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:54,855 INFO L225 Difference]: With dead ends: 490 [2018-02-02 20:44:54,855 INFO L226 Difference]: Without dead ends: 490 [2018-02-02 20:44:54,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:44:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-02-02 20:44:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 443. [2018-02-02 20:44:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:44:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 489 transitions. [2018-02-02 20:44:54,859 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 489 transitions. Word has length 84 [2018-02-02 20:44:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:54,859 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 489 transitions. [2018-02-02 20:44:54,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:44:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 489 transitions. [2018-02-02 20:44:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:44:54,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:54,860 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, 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:44:54,860 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash 767660235, now seen corresponding path program 1 times [2018-02-02 20:44:54,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:54,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:55,799 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:44:55,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:55,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:44:55,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:55,800 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:44:55,800 INFO L182 omatonBuilderFactory]: Interpolants [33440#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 33441#(= 1 (select |#valid| |main_#t~mem37.base|)), 33442#(= 1 (select |#valid| main_~end~0.base)), 33420#true, 33421#false, 33422#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 33423#(and (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset)), 33424#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (not (= 0 main_~end~0.base)) (= 0 main_~end~0.offset)), 33425#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (not (= 0 main_~end~0.base)) (= (select |#valid| main_~end~0.base) 1) (= 0 main_~end~0.offset)), 33426#(and (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem19.base|) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem19.offset|) (= (select |#valid| main_~list~0.base) 1)), 33427#(or (and (not (= main_~end~0.base main_~list~0.base)) (or (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.offset 0))) (= (select |#valid| main_~list~0.base) 1) (or (= main_~end~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset) main_~end~0.offset))) (and (or (= main_~list~0.offset main_~end~0.offset) (and (= main_~list~0.offset 0) (or (<= (+ main_~end~0.offset 8) 0) (and (= main_~end~0.base main_~list~0.base) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0) main_~list~0.offset))))))) (or (= main_~end~0.base main_~list~0.base) (not (= main_~list~0.offset main_~end~0.offset))))), 33428#(and (or (and (= main_~end~0.base main_~list~0.base) (or (= main_~list~0.offset main_~end~0.offset) (and (= main_~list~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (<= 0 main_~end~0.offset)))) (and (not (= main_~end~0.base main_~list~0.base)) (or (not (= main_~end~0.offset 0)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (= (select |#valid| main_~list~0.base) 1))) (= (select |#valid| main_~end~0.base) 1)), 33429#(and (= (select |#valid| main_~end~0.base) 1) (or (and (not (= main_~end~0.base main_~list~0.base)) (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (or (not (= main_~end~0.offset 0)) (and (not (= main_~end~0.base 0)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base))) (= (select |#valid| main_~list~0.base) 1)) (and (or (= main_~list~0.offset main_~end~0.offset) (and (not (= main_~end~0.offset 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (not (= (+ main_~end~0.offset 8) main_~list~0.offset)))) (= main_~end~0.base main_~list~0.base)))), 33430#(and (= (select |#valid| main_~end~0.base) 1) (or (and (not (= main_~end~0.base main_~list~0.base)) (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (= (select |#valid| main_~list~0.base) 1) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~end~0.offset 0)))) (and (or (= main_~list~0.offset main_~end~0.offset) (and (not (= main_~end~0.offset 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (not (= (+ main_~end~0.offset 8) main_~list~0.offset)))) (= main_~end~0.base main_~list~0.base)))), 33431#(and (or (and (or (= (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|)) main_~list~0.base) main_~list~0.offset) main_~end~0.offset) (= main_~end~0.offset 0)) (not (= main_~list~0.base |main_#t~malloc23.base|)) (or (not (= main_~end~0.offset 0)) (not (= (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) main_~list~0.offset) 0)))) (and (or (= main_~list~0.offset main_~end~0.offset) (and (= main_~end~0.base main_~list~0.base) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|) main_~list~0.offset))))) (or (and (= main_~end~0.base main_~list~0.base) (= 1 (select |#valid| |main_#t~malloc23.base|))) (not (= main_~list~0.offset main_~end~0.offset))))) (not (= main_~end~0.base |main_#t~malloc23.base|))), 33432#(and (or (and (or (= main_~list~0.offset main_~end~0.offset) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base))) (or (not (= main_~list~0.offset main_~end~0.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base main_~list~0.base)))) (and (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~end~0.offset 0))))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))), 33433#(and (or (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (or (not (= main_~end~0.offset 0)) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset) 0))) (or (= main_~end~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem25.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset) main_~end~0.offset))) (and (or (and (= main_~end~0.base main_~list~0.base) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8))))) (not (= main_~list~0.offset main_~end~0.offset))) (or (= main_~list~0.offset main_~end~0.offset) (and (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base))))) (not (= main_~end~0.base |main_#t~mem25.base|)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8))))), 33434#(and (not (= main_~end~0.base |main_#t~mem27.base|)) (or (and (or (= main_~list~0.offset main_~end~0.offset) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base))) (or (not (= main_~list~0.offset main_~end~0.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base main_~list~0.base)))) (and (or (= main_~end~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (or (not (= main_~end~0.offset 0)) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset) 0)))))), 33435#(or (and (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~end~0.offset 0)))) (and (or (= main_~list~0.offset main_~end~0.offset) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base))) (or (not (= main_~list~0.offset main_~end~0.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base main_~list~0.base))))), 33436#(or (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 33437#(or (not (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 33438#(or (not (= 0 |main_#t~mem36.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= |main_#t~mem36.offset| 0))), 33439#(or (not (= main_~end~0.offset 0)) (not (= 0 main_~end~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))] [2018-02-02 20:44:55,800 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:44:55,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:44:55,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:44:55,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:44:55,801 INFO L87 Difference]: Start difference. First operand 443 states and 489 transitions. Second operand 23 states. [2018-02-02 20:44:56,351 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 100 DAG size of output 64 [2018-02-02 20:44:56,527 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 117 DAG size of output 77 [2018-02-02 20:44:56,779 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 138 DAG size of output 93 [2018-02-02 20:44:57,090 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 139 DAG size of output 92 [2018-02-02 20:44:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:57,885 INFO L93 Difference]: Finished difference Result 543 states and 585 transitions. [2018-02-02 20:44:57,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:44:57,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2018-02-02 20:44:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:57,886 INFO L225 Difference]: With dead ends: 543 [2018-02-02 20:44:57,886 INFO L226 Difference]: Without dead ends: 543 [2018-02-02 20:44:57,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=461, Invalid=1795, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:44:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-02 20:44:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 453. [2018-02-02 20:44:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-02-02 20:44:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 501 transitions. [2018-02-02 20:44:57,890 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 501 transitions. Word has length 87 [2018-02-02 20:44:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:57,890 INFO L432 AbstractCegarLoop]: Abstraction has 453 states and 501 transitions. [2018-02-02 20:44:57,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:44:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 501 transitions. [2018-02-02 20:44:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:44:57,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:57,891 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, 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:44:57,891 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash 767660236, now seen corresponding path program 1 times [2018-02-02 20:44:57,891 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:57,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:58,298 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:44:58,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:58,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:44:58,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:58,299 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:44:58,299 INFO L182 omatonBuilderFactory]: Interpolants [34496#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem19.base|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem19.offset|) (= (select |#valid| main_~list~0.base) 1)), 34497#(and (not (= main_~end~0.base main_~list~0.base)) (or (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.offset 0))) (= (select |#valid| main_~list~0.base) 1) (or (= main_~end~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset) main_~end~0.offset))), 34498#(and (not (= main_~end~0.base main_~list~0.base)) (or (not (= main_~end~0.offset 0)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 34499#(and (not (= main_~end~0.base main_~list~0.base)) (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (= (select |#valid| main_~end~0.base) 1) (or (not (= main_~end~0.offset 0)) (and (not (= main_~end~0.base 0)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base))) (= (select |#valid| main_~list~0.base) 1)), 34500#(and (not (= main_~end~0.base main_~list~0.base)) (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~end~0.offset 0)))), 34501#(and (or (= (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|)) main_~list~0.base) main_~list~0.offset) main_~end~0.offset) (= main_~end~0.offset 0)) (not (= main_~list~0.base |main_#t~malloc23.base|)) (not (= main_~end~0.base |main_#t~malloc23.base|)) (or (not (= main_~end~0.offset 0)) (not (= (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) main_~list~0.offset) 0)))), 34502#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~end~0.offset 0)))), 34503#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (or (not (= main_~end~0.offset 0)) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset) 0))) (or (= main_~end~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem25.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem25.base|))), 34504#(and (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~end~0.offset 0)))), 34505#(and (or (= main_~end~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (or (not (= main_~end~0.offset 0)) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset) 0)))), 34506#(and (or (= main_~end~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~end~0.offset)) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~end~0.offset 0)))), 34507#(or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0))), 34508#(or (not (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 0))), 34509#(or (not (= |main_#t~mem36.base| 0)) (not (= |main_#t~mem36.offset| 0))), 34510#(or (not (= main_~end~0.offset 0)) (not (= main_~end~0.base 0))), 34489#true, 34490#false, 34491#(= (select |#valid| main_~list~0.base) 1), 34492#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 34493#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|))), 34494#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 34495#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base |main_#t~mem17.base|)))] [2018-02-02 20:44:58,299 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:44:58,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:44:58,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:44:58,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:44:58,299 INFO L87 Difference]: Start difference. First operand 453 states and 501 transitions. Second operand 22 states. [2018-02-02 20:44:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:59,332 INFO L93 Difference]: Finished difference Result 532 states and 577 transitions. [2018-02-02 20:44:59,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:44:59,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-02-02 20:44:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:59,333 INFO L225 Difference]: With dead ends: 532 [2018-02-02 20:44:59,333 INFO L226 Difference]: Without dead ends: 532 [2018-02-02 20:44:59,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=1223, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:44:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-02-02 20:44:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 443. [2018-02-02 20:44:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:44:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 488 transitions. [2018-02-02 20:44:59,336 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 488 transitions. Word has length 87 [2018-02-02 20:44:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:59,336 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 488 transitions. [2018-02-02 20:44:59,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:44:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 488 transitions. [2018-02-02 20:44:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:44:59,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:59,337 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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:44:59,337 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:59,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1916522223, now seen corresponding path program 1 times [2018-02-02 20:44:59,337 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:59,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:59,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:44:59,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:44:59,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:59,865 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:44:59,865 INFO L182 omatonBuilderFactory]: Interpolants [35520#true, 35521#false, 35522#(= 0 |main_#t~malloc0.offset|), 35523#(= main_~list~0.offset 0), 35524#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 35525#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (<= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (<= main_~list~0.offset 0)), 35526#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|)) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 0 |main_#t~malloc15.offset|)), 35527#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (<= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (<= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 35528#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (<= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (<= main_~list~0.offset 0) (not (= main_~end~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 35529#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= 0 |main_#t~mem19.offset|)), 35530#(and (= main_~list~0.offset main_~end~0.offset) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 35531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~end~0.offset) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 35532#(and (= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc23.base|)) (not (= main_~end~0.base |main_#t~malloc23.base|)) (= 1 (select |#valid| |main_#t~malloc23.base|))), 35533#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.offset 0) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 35534#(and (= main_~list~0.offset main_~end~0.offset) (= main_~end~0.offset 0) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem25.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem25.base|)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8)))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset))), 35535#(and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~end~0.base |main_#t~mem27.base|)) (= main_~end~0.offset 0) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset))), 35536#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 35537#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8)))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 35538#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 35539#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) (+ 0 8)))) (= 0 |main_#t~mem36.offset|)), 35540#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 35541#(= 1 (select |#valid| |main_#t~mem32.base|)), 35542#(= 1 (select |#valid| main_~inner~0.base))] [2018-02-02 20:44:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:59,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:44:59,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:44:59,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:44:59,865 INFO L87 Difference]: Start difference. First operand 443 states and 488 transitions. Second operand 23 states. [2018-02-02 20:45:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:01,341 INFO L93 Difference]: Finished difference Result 564 states and 602 transitions. [2018-02-02 20:45:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:45:01,341 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2018-02-02 20:45:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:01,342 INFO L225 Difference]: With dead ends: 564 [2018-02-02 20:45:01,342 INFO L226 Difference]: Without dead ends: 564 [2018-02-02 20:45:01,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:45:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-02-02 20:45:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 443. [2018-02-02 20:45:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:45:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 487 transitions. [2018-02-02 20:45:01,347 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 487 transitions. Word has length 87 [2018-02-02 20:45:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:01,347 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 487 transitions. [2018-02-02 20:45:01,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:45:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 487 transitions. [2018-02-02 20:45:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:45:01,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:01,347 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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:45:01,347 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:01,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1916522224, now seen corresponding path program 1 times [2018-02-02 20:45:01,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:01,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:02,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:02,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:45:02,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:02,244 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:45:02,244 INFO L182 omatonBuilderFactory]: Interpolants [36608#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|)) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 0 |main_#t~malloc15.offset|)), 36609#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (<= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (<= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 36610#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (<= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (<= main_~list~0.offset 0) (not (= main_~end~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 36611#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= 0 |main_#t~mem19.offset|)), 36612#(and (or (not (= main_~list~0.offset main_~end~0.offset)) (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))) (< main_~end~0.offset (+ main_~list~0.offset 1)) (<= main_~list~0.offset 0)), 36613#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (<= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (< main_~end~0.offset (+ main_~list~0.offset 1)) (<= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 36614#(and (= 12 (select |#length| |main_#t~malloc23.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) main_~list~0.offset)) (<= main_~list~0.offset main_~end~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc23.base|)) (not (= main_~end~0.base |main_#t~malloc23.base|)) (<= 0 main_~list~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1)) (<= main_~list~0.offset 0) (= 0 |main_#t~malloc23.offset|)), 36615#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (<= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (< main_~end~0.offset (+ main_~list~0.offset 1))), 36616#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (<= main_~list~0.offset main_~end~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem25.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset)) (<= 0 main_~list~0.offset) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~end~0.base |main_#t~mem25.base|)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8)))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset)) (<= main_~list~0.offset 0) (< main_~end~0.offset (+ main_~list~0.offset 1))), 36617#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~end~0.base |main_#t~mem27.base|)) (<= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (<= 0 main_~list~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset)) (<= main_~list~0.offset 0) (< main_~end~0.offset (+ main_~list~0.offset 1))), 36618#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (<= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (< main_~end~0.offset (+ main_~list~0.offset 1))), 36619#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8)))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 36620#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 36621#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) (+ 0 8)))) (= 0 |main_#t~mem36.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem36.base|) (+ 0 8)))), 36622#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~end~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))), 36623#(and (= 0 |main_#t~mem32.offset|) (= 12 (select |#length| |main_#t~mem32.base|))), 36624#(and (= main_~inner~0.offset 0) (= 12 (select |#length| main_~inner~0.base))), 36602#true, 36603#false, 36604#(= 0 |main_#t~malloc0.offset|), 36605#(= main_~list~0.offset 0), 36606#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 36607#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (<= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (<= main_~list~0.offset 0))] [2018-02-02 20:45:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:02,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:45:02,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:45:02,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:45:02,245 INFO L87 Difference]: Start difference. First operand 443 states and 487 transitions. Second operand 23 states. [2018-02-02 20:45:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:04,219 INFO L93 Difference]: Finished difference Result 604 states and 643 transitions. [2018-02-02 20:45:04,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:45:04,219 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2018-02-02 20:45:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:04,220 INFO L225 Difference]: With dead ends: 604 [2018-02-02 20:45:04,220 INFO L226 Difference]: Without dead ends: 604 [2018-02-02 20:45:04,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=382, Invalid=1970, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:45:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-02-02 20:45:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 443. [2018-02-02 20:45:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 20:45:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 484 transitions. [2018-02-02 20:45:04,223 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 484 transitions. Word has length 87 [2018-02-02 20:45:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:04,223 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 484 transitions. [2018-02-02 20:45:04,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:45:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 484 transitions. [2018-02-02 20:45:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:45:04,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:04,224 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, 1, 1, 1, 1, 1, 1, 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:45:04,224 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:04,225 INFO L82 PathProgramCache]: Analyzing trace with hash -878961505, now seen corresponding path program 2 times [2018-02-02 20:45:04,225 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:04,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:04,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:04,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:45:04,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:04,654 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:45:04,654 INFO L182 omatonBuilderFactory]: Interpolants [37728#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|))), 37729#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 37730#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base |main_#t~mem17.base|))), 37731#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem19.offset|) (= (select |#valid| main_~list~0.base) 1)), 37732#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 37733#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 37734#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|) main_~end~0.offset)) (not (= main_~list~0.base |main_#t~malloc23.base|)) (not (= main_~end~0.base |main_#t~malloc23.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|) main_~end~0.offset))), 37735#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 37736#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem25.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem25.base|)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 37737#(and (not (= main_~end~0.base |main_#t~mem27.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 37738#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 37739#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 37740#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 37741#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem36.base|) |main_#t~mem36.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem36.base|) |main_#t~mem36.offset|))), 37742#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 37743#(and (= 0 |main_#t~mem36.offset|) (= 0 |main_#t~mem36.base|)), 37744#(and (= main_~end~0.offset 0) (= main_~end~0.base 0)), 37724#true, 37725#false, 37726#(= (select |#valid| main_~list~0.base) 1), 37727#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1))] [2018-02-02 20:45:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:04,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:45:04,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:45:04,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:45:04,654 INFO L87 Difference]: Start difference. First operand 443 states and 484 transitions. Second operand 21 states. [2018-02-02 20:45:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:05,589 INFO L93 Difference]: Finished difference Result 495 states and 533 transitions. [2018-02-02 20:45:05,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:45:05,589 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-02-02 20:45:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:05,590 INFO L225 Difference]: With dead ends: 495 [2018-02-02 20:45:05,590 INFO L226 Difference]: Without dead ends: 495 [2018-02-02 20:45:05,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=1126, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:45:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-02-02 20:45:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 437. [2018-02-02 20:45:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-02 20:45:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 478 transitions. [2018-02-02 20:45:05,593 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 478 transitions. Word has length 89 [2018-02-02 20:45:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:05,594 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 478 transitions. [2018-02-02 20:45:05,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:45:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 478 transitions. [2018-02-02 20:45:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 20:45:05,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:05,595 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:05,595 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1759840009, now seen corresponding path program 2 times [2018-02-02 20:45:05,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:05,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:06,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:06,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:45:06,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:06,019 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:45:06,019 INFO L182 omatonBuilderFactory]: Interpolants [38720#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 38721#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 38722#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 38723#(and (= 0 |main_#t~mem37.offset|) (= 0 |main_#t~mem37.base|)), 38724#(and (= main_~end~0.offset 0) (= main_~end~0.base 0)), 38709#true, 38710#false, 38711#(= 0 |main_#t~malloc0.offset|), 38712#(= 0 main_~list~0.offset), 38713#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 38714#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 38715#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~end~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset))), 38716#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.offset|) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 0 (select (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.base|) (+ main_~list~0.offset 8))) (not (= main_~end~0.base |main_#t~malloc15.base|)) (not (= (+ main_~list~0.offset 8) main_~end~0.offset))), 38717#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset))), 38718#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem17.base|))), 38719#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))] [2018-02-02 20:45:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:06,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:45:06,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:45:06,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:45:06,020 INFO L87 Difference]: Start difference. First operand 437 states and 478 transitions. Second operand 16 states. [2018-02-02 20:45:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:06,609 INFO L93 Difference]: Finished difference Result 517 states and 551 transitions. [2018-02-02 20:45:06,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:45:06,609 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2018-02-02 20:45:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:06,610 INFO L225 Difference]: With dead ends: 517 [2018-02-02 20:45:06,610 INFO L226 Difference]: Without dead ends: 517 [2018-02-02 20:45:06,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:45:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-02 20:45:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 489. [2018-02-02 20:45:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-02-02 20:45:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 532 transitions. [2018-02-02 20:45:06,614 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 532 transitions. Word has length 93 [2018-02-02 20:45:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:06,614 INFO L432 AbstractCegarLoop]: Abstraction has 489 states and 532 transitions. [2018-02-02 20:45:06,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:45:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 532 transitions. [2018-02-02 20:45:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:45:06,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:06,614 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:06,615 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1425994694, now seen corresponding path program 1 times [2018-02-02 20:45:06,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:06,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:06,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:06,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:45:06,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:06,980 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:45:06,981 INFO L182 omatonBuilderFactory]: Interpolants [39776#(and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) main_~list~0.offset) (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 39777#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) main_~list~0.offset) (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~mem17.base|))), 39778#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~list~0.offset)), 39779#(and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (= (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset) main_~list~0.offset)), 39780#(and (not (= 0 main_~list~0.base)) (= (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset) main_~list~0.offset)), 39781#(and (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~list~0.offset)), 39782#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 39783#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem36.base|) (not (= 0 main_~list~0.base)) (= |main_#t~mem36.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) |main_#t~mem36.offset|))), 39784#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (or (= main_~end~0.base main_~list~0.base) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 39785#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (or (= main_~end~0.base main_~list~0.base) (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))))), 39786#(and (not (= 0 main_~list~0.base)) (or (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= 0 |main_#t~mem36.base|)))), 39787#(and (not (= 0 main_~list~0.base)) (or (not (= 0 main_~end~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 39788#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 39789#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) |main_#t~mem41.base|))), 39790#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~end~0.base))), 39791#(= 1 (select |#valid| main_~end~0.base)), 39792#(= 1 (select |#valid| main_~list~0.base)), 39769#true, 39770#false, 39771#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 39772#(and (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset)), 39773#(and (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 39774#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~end~0.base))), 39775#(and (not (= 0 main_~list~0.base)) (= |main_#t~malloc15.offset| main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|)))] [2018-02-02 20:45:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:06,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:45:06,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:45:06,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:45:06,981 INFO L87 Difference]: Start difference. First operand 489 states and 532 transitions. Second operand 24 states. [2018-02-02 20:45:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:08,418 INFO L93 Difference]: Finished difference Result 611 states and 649 transitions. [2018-02-02 20:45:08,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 20:45:08,418 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-02-02 20:45:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:08,419 INFO L225 Difference]: With dead ends: 611 [2018-02-02 20:45:08,419 INFO L226 Difference]: Without dead ends: 611 [2018-02-02 20:45:08,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=773, Invalid=2649, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:45:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-02-02 20:45:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 501. [2018-02-02 20:45:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-02-02 20:45:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 547 transitions. [2018-02-02 20:45:08,423 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 547 transitions. Word has length 95 [2018-02-02 20:45:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:08,423 INFO L432 AbstractCegarLoop]: Abstraction has 501 states and 547 transitions. [2018-02-02 20:45:08,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:45:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 547 transitions. [2018-02-02 20:45:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:45:08,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:08,424 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:08,424 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:08,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1425994693, now seen corresponding path program 1 times [2018-02-02 20:45:08,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:08,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:08,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:08,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:45:08,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:08,623 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:45:08,623 INFO L182 omatonBuilderFactory]: Interpolants [40992#(and (<= 12 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset)), 40993#(and (<= 12 (select |#length| main_~list~0.base)) (= 0 main_~list~0.offset)), 40975#true, 40976#false, 40977#(= (select |#valid| main_~list~0.base) 1), 40978#(and (= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base main_~list~0.base) (= (select |#valid| main_~end~0.base) 1)), 40979#(and (= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 40980#(and (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 40981#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem17.base|))), 40982#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 40983#(and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 40984#(= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)), 40985#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)), 40986#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset))), 40987#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem36.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 40988#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 40989#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 40990#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 40991#(and (= 0 |main_#t~mem41.offset|) (<= 12 (select |#length| |main_#t~mem41.base|)))] [2018-02-02 20:45:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:08,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:45:08,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:45:08,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:45:08,624 INFO L87 Difference]: Start difference. First operand 501 states and 547 transitions. Second operand 19 states. [2018-02-02 20:45:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:09,240 INFO L93 Difference]: Finished difference Result 562 states and 604 transitions. [2018-02-02 20:45:09,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:45:09,240 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 95 [2018-02-02 20:45:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:09,241 INFO L225 Difference]: With dead ends: 562 [2018-02-02 20:45:09,241 INFO L226 Difference]: Without dead ends: 562 [2018-02-02 20:45:09,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:45:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-02-02 20:45:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 520. [2018-02-02 20:45:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-02-02 20:45:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 572 transitions. [2018-02-02 20:45:09,244 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 572 transitions. Word has length 95 [2018-02-02 20:45:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:09,244 INFO L432 AbstractCegarLoop]: Abstraction has 520 states and 572 transitions. [2018-02-02 20:45:09,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:45:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 572 transitions. [2018-02-02 20:45:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 20:45:09,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:09,245 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:09,245 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1256161423, now seen corresponding path program 1 times [2018-02-02 20:45:09,246 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:09,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:09,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:09,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:45:09,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:09,298 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:45:09,298 INFO L182 omatonBuilderFactory]: Interpolants [42114#true, 42115#false, 42116#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base)), 42117#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem36.base|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem36.offset|)), 42118#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 42119#(or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0))), 42120#(or (not (= |main_#t~mem41.base| 0)) (not (= |main_#t~mem41.offset| 0))), 42121#(or (not (= main_~end~0.offset 0)) (not (= main_~end~0.base 0))), 42122#(or (not (= main_~list~0.offset 0)) (not (= main_~list~0.base 0)))] [2018-02-02 20:45:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:09,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:45:09,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:45:09,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:45:09,298 INFO L87 Difference]: Start difference. First operand 520 states and 572 transitions. Second operand 9 states. [2018-02-02 20:45:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:09,534 INFO L93 Difference]: Finished difference Result 592 states and 641 transitions. [2018-02-02 20:45:09,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:45:09,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-02-02 20:45:09,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:09,535 INFO L225 Difference]: With dead ends: 592 [2018-02-02 20:45:09,535 INFO L226 Difference]: Without dead ends: 592 [2018-02-02 20:45:09,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:45:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-02-02 20:45:09,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 542. [2018-02-02 20:45:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-02-02 20:45:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 598 transitions. [2018-02-02 20:45:09,538 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 598 transitions. Word has length 96 [2018-02-02 20:45:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:09,538 INFO L432 AbstractCegarLoop]: Abstraction has 542 states and 598 transitions. [2018-02-02 20:45:09,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:45:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 598 transitions. [2018-02-02 20:45:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 20:45:09,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:09,539 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:09,539 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1951487076, now seen corresponding path program 1 times [2018-02-02 20:45:09,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:09,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:10,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:10,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:45:10,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:10,711 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:45:10,711 INFO L182 omatonBuilderFactory]: Interpolants [43277#true, 43278#false, 43279#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 43280#(and (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset)), 43281#(and (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 43282#(and (= 0 |main_#t~malloc5.offset|) (not (= 0 main_~list~0.base)) (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 0 main_~list~0.offset)), 43283#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 43284#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem7.base|))), 43285#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 43286#(and (= 0 main_~list~0.offset) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~list~0.base) 1) (or (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~list~0.base |main_#t~mem9.base|))), 43287#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 43288#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= (select |#valid| main_~list~0.base) 1) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 43289#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (or (= |main_#t~malloc15.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base |main_#t~malloc15.base|)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~malloc15.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |main_#t~malloc15.offset|)), 43290#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (or (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8)))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 43291#(and (= main_~list~0.offset 0) (or (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8))))) (= main_~end~0.base main_~list~0.base) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem17.base|)) (or (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset) (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 43292#(and (= main_~list~0.offset 0) (= main_~list~0.base main_~end~0.base) (or (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (or (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8)))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 43293#(and (= main_~list~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem19.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |main_#t~mem19.offset|)), 43294#(and (= main_~list~0.offset 0) (= main_~end~0.offset 0) (or (and (or (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))))) (or (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))))) (= main_~end~0.base main_~list~0.base))), 43295#(and (= main_~list~0.offset 0) (= main_~end~0.offset 0) (or (= main_~end~0.base main_~list~0.base) (and (= (select |#valid| main_~end~0.base) 1) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))))))), 43296#(and (= main_~list~0.offset 0) (= main_~end~0.offset 0) (or (= main_~end~0.base main_~list~0.base) (and (or (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (and (not (= main_~end~0.base 0)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))))) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))))) (= (select |#valid| main_~end~0.base) 1) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))))))), 43297#(and (= main_~list~0.offset 0) (or (and (= main_~end~0.base main_~list~0.base) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1))) (and (= (select |#valid| main_~end~0.base) 1) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))))))), 43298#(and (= main_~list~0.offset 0) (or (and (= main_~end~0.base main_~list~0.base) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1))) (and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))))), 43299#(and (= main_~list~0.offset 0) (or (and (= main_~end~0.base main_~list~0.base) (<= 0 main_~end~0.offset) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (< main_~end~0.offset (+ main_~list~0.offset 1)) (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))))), 43300#(and (= main_~list~0.offset 0) (or |main_#t~short31| (and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))))), 43301#(and (= main_~list~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 43302#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 43303#(and (or (= 1 (select |#valid| |main_#t~mem37.base|)) (= 0 |main_#t~mem37.offset|)) (or (= 1 (select |#valid| |main_#t~mem37.base|)) (= 0 |main_#t~mem37.base|))), 43304#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (= 1 (select |#valid| main_~end~0.base))), 43305#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 20:45:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:10,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:45:10,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:45:10,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:45:10,712 INFO L87 Difference]: Start difference. First operand 542 states and 598 transitions. Second operand 29 states. [2018-02-02 20:45:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:15,965 INFO L93 Difference]: Finished difference Result 1585 states and 1720 transitions. [2018-02-02 20:45:15,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-02-02 20:45:15,965 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 98 [2018-02-02 20:45:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:15,967 INFO L225 Difference]: With dead ends: 1585 [2018-02-02 20:45:15,967 INFO L226 Difference]: Without dead ends: 1585 [2018-02-02 20:45:15,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4431 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2929, Invalid=9953, Unknown=0, NotChecked=0, Total=12882 [2018-02-02 20:45:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2018-02-02 20:45:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 742. [2018-02-02 20:45:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-02-02 20:45:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 830 transitions. [2018-02-02 20:45:15,975 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 830 transitions. Word has length 98 [2018-02-02 20:45:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:15,975 INFO L432 AbstractCegarLoop]: Abstraction has 742 states and 830 transitions. [2018-02-02 20:45:15,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:45:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 830 transitions. [2018-02-02 20:45:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 20:45:15,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:15,976 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:15,976 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1951487075, now seen corresponding path program 1 times [2018-02-02 20:45:15,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:15,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:16,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:16,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:45:16,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:16,904 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:45:16,904 INFO L182 omatonBuilderFactory]: Interpolants [45824#(and (= main_~list~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~end~0.base main_~list~0.base) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))))), 45825#(and (= main_~list~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))))), 45826#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))), 45827#(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|))), 45828#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12))), 45829#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 45803#true, 45804#false, 45805#(= 0 |main_#t~malloc0.offset|), 45806#(= 0 main_~list~0.offset), 45807#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 45808#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 0 main_~list~0.offset) (= (select |#valid| |main_#t~malloc5.base|) 1) (= 12 (select |#length| |main_#t~malloc5.base|))), 45809#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 45810#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~mem7.base|))), 45811#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem9.base| (store (select |#memory_$Pointer$.base| |main_#t~mem9.base|) (+ |main_#t~mem9.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 main_~list~0.offset) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~list~0.base) 1) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem9.base| (store (select |#memory_$Pointer$.base| |main_#t~mem9.base|) (+ |main_#t~mem9.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) 1)), 45812#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 45813#(and (= |main_#t~mem11.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) 1) (= 0 main_~list~0.offset) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 45814#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) 1) (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 45815#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~list~0.base main_~end~0.base) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (not (= main_~list~0.base |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.base|) (+ main_~list~0.offset 8))))), 45816#(and (= main_~list~0.offset 0) (= main_~list~0.base main_~end~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 45817#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 45818#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 45819#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 |main_#t~mem19.offset|)), 45820#(and (= main_~list~0.offset 0) (or (and (= main_~end~0.base main_~list~0.base) (< main_~end~0.offset (+ main_~list~0.offset 1))) (and (not (= main_~end~0.base main_~list~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (< main_~end~0.offset main_~list~0.offset))), 45821#(and (= main_~list~0.offset 0) (or (and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (and (= main_~end~0.base main_~list~0.base) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1))))), 45822#(and (= main_~list~0.offset 0) (or (and (= main_~end~0.base main_~list~0.base) (<= 0 main_~end~0.offset) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (< main_~end~0.offset (+ main_~list~0.offset 1)) (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))))), 45823#(and (= main_~list~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~end~0.base main_~list~0.base) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) |main_#t~short31| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))))] [2018-02-02 20:45:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:16,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:45:16,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:45:16,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:45:16,905 INFO L87 Difference]: Start difference. First operand 742 states and 830 transitions. Second operand 27 states. [2018-02-02 20:45:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:18,898 INFO L93 Difference]: Finished difference Result 1089 states and 1208 transitions. [2018-02-02 20:45:18,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:45:18,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 98 [2018-02-02 20:45:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:18,900 INFO L225 Difference]: With dead ends: 1089 [2018-02-02 20:45:18,900 INFO L226 Difference]: Without dead ends: 1089 [2018-02-02 20:45:18,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=799, Invalid=2861, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:45:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-02-02 20:45:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 768. [2018-02-02 20:45:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-02-02 20:45:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 857 transitions. [2018-02-02 20:45:18,904 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 857 transitions. Word has length 98 [2018-02-02 20:45:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:18,905 INFO L432 AbstractCegarLoop]: Abstraction has 768 states and 857 transitions. [2018-02-02 20:45:18,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:45:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 857 transitions. [2018-02-02 20:45:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:45:18,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:18,905 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:18,905 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1920607732, now seen corresponding path program 2 times [2018-02-02 20:45:18,906 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:18,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:19,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:19,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:45:19,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:19,635 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:45:19,635 INFO L182 omatonBuilderFactory]: Interpolants [47755#true, 47756#false, 47757#(= 0 |main_#t~malloc0.offset|), 47758#(= 0 main_~list~0.offset), 47759#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 47760#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 47761#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem11.offset|) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 47762#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |main_#t~short13|)), 47763#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 47764#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= (select |#valid| main_~end~0.base) 1) (< main_~end~0.offset (+ main_~list~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 47765#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= (select |#memory_$Pointer$.offset| main_~list~0.base) (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.offset|)) main_~end~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.base|) (+ main_~list~0.offset 8))) (not (= main_~end~0.base |main_#t~malloc15.base|)) (< main_~end~0.offset (+ main_~list~0.offset 1))), 47766#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (< main_~end~0.offset (+ main_~list~0.offset 1))), 47767#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~end~0.base) 1) (< main_~end~0.offset (+ main_~list~0.offset 1)) (not (= main_~end~0.base |main_#t~mem17.base|))), 47768#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 47769#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~list~0.base) 1)), 47770#(and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 47771#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.offset|)) main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.base|)) main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~malloc15.base|))), 47772#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 47773#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.offset)) main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem17.base|))), 47774#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 47775#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 47776#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 47777#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8)))), 47778#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 47779#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 47780#(and (= 0 |main_#t~mem32.offset|) (= 0 |main_#t~mem32.base|)), 47781#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))] [2018-02-02 20:45:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:19,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:45:19,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:45:19,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:45:19,635 INFO L87 Difference]: Start difference. First operand 768 states and 857 transitions. Second operand 27 states. [2018-02-02 20:45:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:21,822 INFO L93 Difference]: Finished difference Result 1092 states and 1208 transitions. [2018-02-02 20:45:21,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 20:45:21,823 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2018-02-02 20:45:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:21,824 INFO L225 Difference]: With dead ends: 1092 [2018-02-02 20:45:21,825 INFO L226 Difference]: Without dead ends: 1092 [2018-02-02 20:45:21,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=951, Invalid=4161, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 20:45:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2018-02-02 20:45:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 864. [2018-02-02 20:45:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-02-02 20:45:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 959 transitions. [2018-02-02 20:45:21,830 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 959 transitions. Word has length 99 [2018-02-02 20:45:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:21,830 INFO L432 AbstractCegarLoop]: Abstraction has 864 states and 959 transitions. [2018-02-02 20:45:21,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:45:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 959 transitions. [2018-02-02 20:45:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:45:21,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:21,831 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:21,831 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:21,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1016059004, now seen corresponding path program 3 times [2018-02-02 20:45:21,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:21,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:22,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:22,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:45:22,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:22,119 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:45:22,119 INFO L182 omatonBuilderFactory]: Interpolants [49828#true, 49829#false, 49830#(= (select |#valid| main_~list~0.base) 1), 49831#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 49832#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|))), 49833#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 49834#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base |main_#t~mem17.base|))), 49835#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 49836#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 49837#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 49838#(and (not (= main_~end~0.base |main_#t~malloc15.base|)) (not (= main_~list~0.base |main_#t~malloc15.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.base|)) main_~list~0.base) main_~list~0.offset))), 49839#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 49840#(and (= (select |#valid| main_~end~0.base) 1) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem17.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset))), 49841#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1)), 49842#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 49843#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 49844#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset))), 49845#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 49846#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 49847#(= 1 (select |#valid| |main_#t~mem36.base|)), 49848#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 20:45:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:22,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:45:22,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:45:22,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:45:22,119 INFO L87 Difference]: Start difference. First operand 864 states and 959 transitions. Second operand 21 states. [2018-02-02 20:45:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:22,929 INFO L93 Difference]: Finished difference Result 1089 states and 1195 transitions. [2018-02-02 20:45:22,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:45:22,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 101 [2018-02-02 20:45:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:22,931 INFO L225 Difference]: With dead ends: 1089 [2018-02-02 20:45:22,932 INFO L226 Difference]: Without dead ends: 1089 [2018-02-02 20:45:22,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=359, Invalid=1363, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:45:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-02-02 20:45:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 962. [2018-02-02 20:45:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-02-02 20:45:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1069 transitions. [2018-02-02 20:45:22,937 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1069 transitions. Word has length 101 [2018-02-02 20:45:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:22,937 INFO L432 AbstractCegarLoop]: Abstraction has 962 states and 1069 transitions. [2018-02-02 20:45:22,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:45:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1069 transitions. [2018-02-02 20:45:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:45:22,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:22,938 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:22,938 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:22,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1016059005, now seen corresponding path program 2 times [2018-02-02 20:45:22,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:22,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:23,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:23,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:45:23,339 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:23,339 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:45:23,339 INFO L182 omatonBuilderFactory]: Interpolants [51942#true, 51943#false, 51944#(= (select |#valid| main_~list~0.base) 1), 51945#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 51946#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 51947#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 51948#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base |main_#t~mem17.base|))), 51949#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem19.base|) (= (select |#valid| main_~list~0.base) 1)), 51950#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 51951#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (<= 0 main_~end~0.offset) (= (select |#valid| main_~list~0.base) 1)), 51952#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 51953#(and (<= 12 (select |#length| main_~end~0.base)) (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc15.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc15.base|)) main_~list~0.base) main_~list~0.offset))), 51954#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 51955#(and (<= 12 (select |#length| main_~end~0.base)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem17.base|))), 51956#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base))), 51957#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 51958#(and (not (= main_~end~0.base main_~list~0.base)) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 51959#(and (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset))), 51960#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 51961#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 51962#(and (= 0 |main_#t~mem36.offset|) (<= 12 (select |#length| |main_#t~mem36.base|))), 51963#(and (= main_~end~0.offset 0) (<= 12 (select |#length| main_~end~0.base)))] [2018-02-02 20:45:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:23,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:45:23,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:45:23,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:45:23,340 INFO L87 Difference]: Start difference. First operand 962 states and 1069 transitions. Second operand 22 states. [2018-02-02 20:45:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:24,424 INFO L93 Difference]: Finished difference Result 1119 states and 1229 transitions. [2018-02-02 20:45:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:45:24,424 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 101 [2018-02-02 20:45:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:24,427 INFO L225 Difference]: With dead ends: 1119 [2018-02-02 20:45:24,427 INFO L226 Difference]: Without dead ends: 1119 [2018-02-02 20:45:24,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1245, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:45:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-02-02 20:45:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 985. [2018-02-02 20:45:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2018-02-02 20:45:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1097 transitions. [2018-02-02 20:45:24,435 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1097 transitions. Word has length 101 [2018-02-02 20:45:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:24,436 INFO L432 AbstractCegarLoop]: Abstraction has 985 states and 1097 transitions. [2018-02-02 20:45:24,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:45:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1097 transitions. [2018-02-02 20:45:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 20:45:24,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:24,436 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:24,436 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash -964583394, now seen corresponding path program 1 times [2018-02-02 20:45:24,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:24,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:25,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:25,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:45:25,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:25,049 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:45:25,049 INFO L182 omatonBuilderFactory]: Interpolants [54112#(and (= main_~list~0.offset 0) (not (= main_~end~0.base main_~list~0.base)) (or (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (< main_~end~0.offset main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (< main_~end~0.offset (+ main_~list~0.offset 1))), 54113#(and (= main_~list~0.offset 0) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) 0)) main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1))), 54114#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (< main_~end~0.offset (+ main_~list~0.offset 1)) (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 54115#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) |main_#t~short31|)), 54116#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))), 54117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8)))), 54118#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8))) (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8)))), 54119#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem41.base|) (+ main_~list~0.offset 8))) (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem41.base|) (+ main_~list~0.offset 8)))), 54120#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 54121#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ 0 8))) (= 0 main_~end~0.offset)), 54122#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 54123#(and (= 0 |main_#t~mem37.offset|) (= 0 |main_#t~mem37.base|)), 54124#(and (= main_~end~0.offset 0) (= main_~end~0.base 0)), 54102#true, 54103#false, 54104#(= 0 |main_#t~malloc0.offset|), 54105#(= main_~list~0.offset 0), 54106#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 54107#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 54108#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 54109#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 54110#(and (= main_~list~0.offset 0) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 54111#(and (not (= main_~list~0.base |main_#t~mem19.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 |main_#t~mem19.offset|))] [2018-02-02 20:45:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:25,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:45:25,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:45:25,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:45:25,049 INFO L87 Difference]: Start difference. First operand 985 states and 1097 transitions. Second operand 23 states. [2018-02-02 20:45:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:26,521 INFO L93 Difference]: Finished difference Result 1054 states and 1157 transitions. [2018-02-02 20:45:26,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 20:45:26,521 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-02 20:45:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:26,523 INFO L225 Difference]: With dead ends: 1054 [2018-02-02 20:45:26,523 INFO L226 Difference]: Without dead ends: 1054 [2018-02-02 20:45:26,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=666, Invalid=3366, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 20:45:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-02-02 20:45:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1016. [2018-02-02 20:45:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-02-02 20:45:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1130 transitions. [2018-02-02 20:45:26,531 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1130 transitions. Word has length 102 [2018-02-02 20:45:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:26,532 INFO L432 AbstractCegarLoop]: Abstraction has 1016 states and 1130 transitions. [2018-02-02 20:45:26,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:45:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1130 transitions. [2018-02-02 20:45:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 20:45:26,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:26,533 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:26,533 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash -718880349, now seen corresponding path program 1 times [2018-02-02 20:45:26,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:26,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:27,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:27,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:45:27,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:27,266 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:45:27,266 INFO L182 omatonBuilderFactory]: Interpolants [56277#true, 56278#false, 56279#(= 0 |main_#t~malloc0.offset|), 56280#(= 0 main_~list~0.offset), 56281#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 56282#(and (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 0 main_~list~0.offset)), 56283#(and (= 0 main_~list~0.offset) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 56284#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~mem7.base|))), 56285#(and (= 0 main_~list~0.offset) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 56286#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 56287#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 56288#(and (= main_~list~0.offset 0) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 56289#(and (= main_~list~0.offset 0) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base |main_#t~malloc15.base|)) (or (= |main_#t~malloc15.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 0 |main_#t~malloc15.offset|)), 56290#(and (= main_~list~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 56291#(and (= main_~list~0.offset 0) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset) (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8)))))), 56292#(and (= main_~list~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 56293#(and (= main_~list~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1) (= 0 |main_#t~mem19.offset|)), 56294#(and (= main_~list~0.offset 0) (or (and (or (= main_~end~0.base main_~list~0.base) (< main_~end~0.offset main_~list~0.offset)) (< main_~end~0.offset (+ main_~list~0.offset 1))) (and (not (= main_~end~0.base main_~list~0.base)) (or (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))))) (= (select |#valid| main_~list~0.base) 1)))), 56295#(and (= main_~list~0.offset 0) (= (select |#valid| main_~end~0.base) 1) (or (and (not (= main_~end~0.base main_~list~0.base)) (= (select |#valid| main_~list~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (and (= main_~end~0.base main_~list~0.base) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1))))), 56296#(and (= main_~list~0.offset 0) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base |main_#t~malloc23.base|)) (not (= main_~end~0.base |main_#t~malloc23.base|))), 56297#(and (= main_~list~0.offset 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 56298#(and (= main_~list~0.offset 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~end~0.base |main_#t~mem25.base|)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8))))), 56299#(and (= main_~list~0.offset 0) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 56300#(and (= main_~list~0.offset 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))))), 56301#(and (= main_~list~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 56302#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 56303#(= 1 (select |#valid| |main_#t~mem37.base|)), 56304#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 20:45:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:27,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:45:27,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:45:27,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:45:27,266 INFO L87 Difference]: Start difference. First operand 1016 states and 1130 transitions. Second operand 28 states. [2018-02-02 20:45:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:29,449 INFO L93 Difference]: Finished difference Result 1226 states and 1359 transitions. [2018-02-02 20:45:29,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:45:29,449 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 103 [2018-02-02 20:45:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:29,451 INFO L225 Difference]: With dead ends: 1226 [2018-02-02 20:45:29,451 INFO L226 Difference]: Without dead ends: 1226 [2018-02-02 20:45:29,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=921, Invalid=3239, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:45:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2018-02-02 20:45:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 946. [2018-02-02 20:45:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-02-02 20:45:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1053 transitions. [2018-02-02 20:45:29,457 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1053 transitions. Word has length 103 [2018-02-02 20:45:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:29,457 INFO L432 AbstractCegarLoop]: Abstraction has 946 states and 1053 transitions. [2018-02-02 20:45:29,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:45:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1053 transitions. [2018-02-02 20:45:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 20:45:29,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:29,457 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:29,458 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr70EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:29,458 INFO L82 PathProgramCache]: Analyzing trace with hash -718880348, now seen corresponding path program 1 times [2018-02-02 20:45:29,458 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:29,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:30,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:30,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:45:30,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:30,433 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:45:30,433 INFO L182 omatonBuilderFactory]: Interpolants [58560#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 58561#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~list~0.base main_~end~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset))), 58562#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~list~0.base main_~end~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (not (= main_~list~0.base |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 58563#(and (= main_~list~0.offset 0) (= main_~list~0.base main_~end~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 58564#(and (= main_~list~0.offset 0) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem17.base| (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) main_~end~0.base)) main_~end~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.base main_~end~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~end~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 58565#(and (= main_~list~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.base main_~end~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~end~0.base) 1) (not (= (+ main_~list~0.offset 8) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 58566#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1) (= 0 |main_#t~mem19.offset|)), 58567#(and (= main_~list~0.offset 0) (or (and (not (= main_~end~0.base main_~list~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= (select |#valid| main_~list~0.base) 1)) (and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base)))), 58568#(and (= main_~list~0.offset 0) (or (and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)) (and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))) (= (select |#valid| main_~end~0.base) 1)), 58569#(and (= main_~list~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.offset|)) main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base |main_#t~malloc23.base|)) (not (= main_~end~0.base |main_#t~malloc23.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8) |main_#t~malloc23.base|)) main_~list~0.base) (+ main_~list~0.offset 8))))), 58570#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 58571#(and (= main_~list~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem25.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem25.base| (store (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset| 0)) main_~end~0.base) (+ main_~end~0.offset 8)))) (not (= main_~end~0.base |main_#t~mem25.base|))), 58572#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 58573#(and (= main_~list~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) (+ |main_#t~mem27.offset| 8) 0)) main_~list~0.base) (+ main_~list~0.offset 8))))), 58574#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 58575#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))), 58576#(and (= 0 |main_#t~mem37.offset|) (= 12 (select |#length| |main_#t~mem37.base|))), 58577#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 58551#true, 58552#false, 58553#(= 0 |main_#t~malloc0.offset|), 58554#(= 0 main_~list~0.offset), 58555#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 58556#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~list~0.base |main_#t~malloc5.base|)) (= 0 main_~list~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|))), 58557#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1)), 58558#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))), 58559#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (= (select |#valid| main_~list~0.base) 1))] [2018-02-02 20:45:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:45:30,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:45:30,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:45:30,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:45:30,434 INFO L87 Difference]: Start difference. First operand 946 states and 1053 transitions. Second operand 27 states. Received shutdown request... [2018-02-02 20:45:32,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 20:45:32,691 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:45:32,695 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:45:32,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:45:32 BoogieIcfgContainer [2018-02-02 20:45:32,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:45:32,696 INFO L168 Benchmark]: Toolchain (without parser) took 76779.20 ms. Allocated memory was 398.5 MB in the beginning and 1.3 GB in the end (delta: 881.3 MB). Free memory was 355.3 MB in the beginning and 1.1 GB in the end (delta: -745.2 MB). Peak memory consumption was 136.1 MB. Max. memory is 5.3 GB. [2018-02-02 20:45:32,697 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:45:32,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.75 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 342.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:45:32,697 INFO L168 Benchmark]: Boogie Preprocessor took 37.47 ms. Allocated memory is still 398.5 MB. Free memory was 342.1 MB in the beginning and 340.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:45:32,697 INFO L168 Benchmark]: RCFGBuilder took 489.43 ms. Allocated memory is still 398.5 MB. Free memory was 340.8 MB in the beginning and 293.6 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:45:32,698 INFO L168 Benchmark]: TraceAbstraction took 76075.65 ms. Allocated memory was 398.5 MB in the beginning and 1.3 GB in the end (delta: 881.3 MB). Free memory was 293.6 MB in the beginning and 1.1 GB in the end (delta: -807.0 MB). Peak memory consumption was 74.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:45:32,699 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.10 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.75 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 342.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.47 ms. Allocated memory is still 398.5 MB. Free memory was 342.1 MB in the beginning and 340.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 489.43 ms. Allocated memory is still 398.5 MB. Free memory was 340.8 MB in the beginning and 293.6 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76075.65 ms. Allocated memory was 398.5 MB in the beginning and 1.3 GB in the end (delta: 881.3 MB). Free memory was 293.6 MB in the beginning and 1.1 GB in the end (delta: -807.0 MB). Peak memory consumption was 74.3 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 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (946states) and interpolant automaton (currently 38 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (915 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 195 locations, 71 error locations. TIMEOUT Result, 76.0s OverallTime, 62 OverallIterations, 3 TraceHistogramMax, 55.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9015 SDtfs, 46162 SDslu, 66408 SDs, 0 SdLazy, 56709 SolverSat, 4560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2049 GetRequests, 133 SyntacticMatches, 82 SemanticMatches, 1834 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21244 ImplicationChecksByTransitivity, 41.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1016occurred in iteration=60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 118/447 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, 61 MinimizatonAttempts, 8398 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 3968 NumberOfCodeBlocks, 3968 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 3906 ConstructedInterpolants, 0 QuantifiedInterpolants, 5771735 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 29 PerfectInterpolantSequences, 118/447 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/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-45-32-706.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-45-32-706.csv Completed graceful shutdown