java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:51:17,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:51:17,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:51:17,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:51:17,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:51:17,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:51:17,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:51:17,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:51:17,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:51:17,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:51:17,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:51:17,339 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:51:17,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:51:17,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:51:17,341 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:51:17,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:51:17,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:51:17,346 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:51:17,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:51:17,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:51:17,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:51:17,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:51:17,349 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:51:17,350 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:51:17,351 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:51:17,352 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:51:17,352 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:51:17,353 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:51:17,353 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:51:17,353 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:51:17,354 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:51:17,354 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:51:17,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:51:17,364 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:51:17,364 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:51:17,365 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:51:17,365 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:51:17,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:51:17,365 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:51:17,365 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:51:17,365 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:51:17,365 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:51:17,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:51:17,366 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:51:17,366 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:51:17,366 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:51:17,366 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:51:17,366 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:51:17,366 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:51:17,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:51:17,367 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:51:17,367 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:51:17,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:51:17,367 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:51:17,367 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:51:17,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:51:17,403 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:51:17,406 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:51:17,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:51:17,408 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:51:17,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:51:17,593 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:51:17,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:51:17,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:51:17,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:51:17,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:51:17,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:51:17" (1/1) ... [2018-02-02 20:51:17,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56610e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17, skipping insertion in model container [2018-02-02 20:51:17,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:51:17" (1/1) ... [2018-02-02 20:51:17,619 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:51:17,650 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:51:17,734 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:51:17,746 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:51:17,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17 WrapperNode [2018-02-02 20:51:17,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:51:17,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:51:17,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:51:17,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:51:17,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17" (1/1) ... [2018-02-02 20:51:17,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17" (1/1) ... [2018-02-02 20:51:17,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17" (1/1) ... [2018-02-02 20:51:17,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17" (1/1) ... [2018-02-02 20:51:17,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17" (1/1) ... [2018-02-02 20:51:17,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17" (1/1) ... [2018-02-02 20:51:17,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17" (1/1) ... [2018-02-02 20:51:17,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:51:17,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:51:17,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:51:17,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:51:17,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17" (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:51:17,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:51:17,820 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:51:17,820 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:51:17,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:51:17,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:51:17,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:51:17,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:51:17,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:51:17,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:51:17,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:51:17,820 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:51:17,820 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:51:17,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:51:17,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:51:17,821 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:51:17,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:51:17,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:51:18,095 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:51:18,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:51:18 BoogieIcfgContainer [2018-02-02 20:51:18,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:51:18,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:51:18,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:51:18,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:51:18,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:51:17" (1/3) ... [2018-02-02 20:51:18,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11952d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:51:18, skipping insertion in model container [2018-02-02 20:51:18,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:51:17" (2/3) ... [2018-02-02 20:51:18,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11952d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:51:18, skipping insertion in model container [2018-02-02 20:51:18,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:51:18" (3/3) ... [2018-02-02 20:51:18,100 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:51:18,105 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:51:18,109 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-02 20:51:18,131 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:51:18,132 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:51:18,132 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:51:18,132 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:51:18,132 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:51:18,132 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:51:18,132 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:51:18,132 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:51:18,133 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:51:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-02-02 20:51:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:51:18,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:18,151 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:18,151 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:18,154 INFO L82 PathProgramCache]: Analyzing trace with hash -414871971, now seen corresponding path program 1 times [2018-02-02 20:51:18,186 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:18,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:18,259 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:51:18,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:18,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:51:18,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:18,262 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:51:18,262 INFO L182 omatonBuilderFactory]: Interpolants [106#true, 107#false, 108#(= 1 (select |#valid| |main_#t~malloc0.base|)), 109#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 20:51:18,262 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:51:18,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:51:18,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:51:18,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:51:18,273 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2018-02-02 20:51:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:18,454 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-02-02 20:51:18,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:51:18,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:51:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:18,462 INFO L225 Difference]: With dead ends: 114 [2018-02-02 20:51:18,462 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 20:51:18,463 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:51:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 20:51:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2018-02-02 20:51:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 20:51:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-02-02 20:51:18,492 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 8 [2018-02-02 20:51:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:18,492 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-02-02 20:51:18,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:51:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-02-02 20:51:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:51:18,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:18,493 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:18,493 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash -414871970, now seen corresponding path program 1 times [2018-02-02 20:51:18,494 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:18,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:18,552 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:51:18,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:18,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:51:18,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:18,553 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:51:18,553 INFO L182 omatonBuilderFactory]: Interpolants [322#true, 323#false, 324#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 325#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0))] [2018-02-02 20:51:18,554 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:51:18,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:51:18,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:51:18,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:51:18,556 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2018-02-02 20:51:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:18,652 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-02-02 20:51:18,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:51:18,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:51:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:18,654 INFO L225 Difference]: With dead ends: 103 [2018-02-02 20:51:18,654 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 20:51:18,655 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:51:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 20:51:18,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2018-02-02 20:51:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 20:51:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-02-02 20:51:18,661 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 8 [2018-02-02 20:51:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:18,662 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-02-02 20:51:18,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:51:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-02-02 20:51:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:51:18,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:18,662 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:18,662 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:18,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1612643290, now seen corresponding path program 1 times [2018-02-02 20:51:18,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:18,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:18,709 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:51:18,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:18,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:51:18,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:18,710 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:51:18,710 INFO L182 omatonBuilderFactory]: Interpolants [523#true, 524#false, 525#(= 1 (select |#valid| main_~head~0.base)), 526#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:51:18,710 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:51:18,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:51:18,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:51:18,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:51:18,711 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 4 states. [2018-02-02 20:51:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:18,829 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-02-02 20:51:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:51:18,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 20:51:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:18,831 INFO L225 Difference]: With dead ends: 88 [2018-02-02 20:51:18,831 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 20:51:18,831 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:51:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 20:51:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-02-02 20:51:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 20:51:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-02 20:51:18,836 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 14 [2018-02-02 20:51:18,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:18,837 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-02 20:51:18,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:51:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-02 20:51:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:51:18,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:18,838 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:18,838 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1612643291, now seen corresponding path program 1 times [2018-02-02 20:51:18,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:18,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:18,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:51:18,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:18,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:51:18,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:18,905 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:51:18,905 INFO L182 omatonBuilderFactory]: Interpolants [698#true, 699#false, 700#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 701#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 702#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 20:51:18,905 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:51:18,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:51:18,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:51:18,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:51:18,907 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 5 states. [2018-02-02 20:51:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:19,010 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-02-02 20:51:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:51:19,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:51:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:19,011 INFO L225 Difference]: With dead ends: 101 [2018-02-02 20:51:19,011 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 20:51:19,012 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:51:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 20:51:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2018-02-02 20:51:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 20:51:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-02-02 20:51:19,015 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 14 [2018-02-02 20:51:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:19,015 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-02-02 20:51:19,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:51:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-02-02 20:51:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:51:19,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:19,016 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:51:19,016 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash -22797273, now seen corresponding path program 1 times [2018-02-02 20:51:19,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:19,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:19,063 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:51:19,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:19,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:51:19,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:19,064 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:51:19,064 INFO L182 omatonBuilderFactory]: Interpolants [896#true, 897#false, 898#(= 1 (select |#valid| |main_#t~malloc4.base|)), 899#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 900#(= 1 (select |#valid| |main_#t~mem6.base|)), 901#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:51:19,064 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:51:19,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:51:19,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:51:19,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:51:19,065 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 6 states. [2018-02-02 20:51:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:19,235 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2018-02-02 20:51:19,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:51:19,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 20:51:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:19,236 INFO L225 Difference]: With dead ends: 132 [2018-02-02 20:51:19,236 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 20:51:19,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:51:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 20:51:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2018-02-02 20:51:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 20:51:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-02-02 20:51:19,241 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 18 [2018-02-02 20:51:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:19,241 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-02-02 20:51:19,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:51:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-02-02 20:51:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:51:19,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:19,242 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:51:19,242 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:19,242 INFO L82 PathProgramCache]: Analyzing trace with hash -22797272, now seen corresponding path program 1 times [2018-02-02 20:51:19,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:19,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:19,305 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:51:19,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:19,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:51:19,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:19,306 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:51:19,307 INFO L182 omatonBuilderFactory]: Interpolants [1128#true, 1129#false, 1130#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1131#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 1132#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 1133#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 20:51:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:19,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:51:19,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:51:19,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:51:19,307 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-02-02 20:51:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:19,548 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-02-02 20:51:19,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:51:19,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 20:51:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:19,549 INFO L225 Difference]: With dead ends: 131 [2018-02-02 20:51:19,549 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 20:51:19,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:51:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 20:51:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2018-02-02 20:51:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 20:51:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-02 20:51:19,554 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 18 [2018-02-02 20:51:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:19,554 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-02 20:51:19,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:51:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-02 20:51:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 20:51:19,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:19,555 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:51:19,555 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:19,555 INFO L82 PathProgramCache]: Analyzing trace with hash -152886338, now seen corresponding path program 1 times [2018-02-02 20:51:19,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:19,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:19,692 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:51:19,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:19,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:51:19,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:19,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:51:19,693 INFO L182 omatonBuilderFactory]: Interpolants [1351#true, 1352#false, 1353#(= 0 |main_#t~malloc0.offset|), 1354#(= main_~head~0.offset 0), 1355#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 1356#(and (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 1357#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 1358#(= 1 (select |#valid| |main_#t~mem11.base|)), 1359#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:51:19,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:51:19,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:51:19,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:51:19,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:51:19,694 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2018-02-02 20:51:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:19,893 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-02 20:51:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:51:19,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 20:51:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:19,894 INFO L225 Difference]: With dead ends: 127 [2018-02-02 20:51:19,894 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 20:51:19,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:51:19,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 20:51:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2018-02-02 20:51:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 20:51:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-02-02 20:51:19,900 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 21 [2018-02-02 20:51:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:19,900 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-02-02 20:51:19,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:51:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-02-02 20:51:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 20:51:19,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:19,901 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:51:19,901 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:19,902 INFO L82 PathProgramCache]: Analyzing trace with hash -152886337, now seen corresponding path program 1 times [2018-02-02 20:51:19,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:19,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:20,080 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:51:20,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:20,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:51:20,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:20,081 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:51:20,081 INFO L182 omatonBuilderFactory]: Interpolants [1589#true, 1590#false, 1591#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 1592#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 1593#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 1594#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 1595#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 1596#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 1597#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 20:51:20,081 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:51:20,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:51:20,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:51:20,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:51:20,082 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 9 states. [2018-02-02 20:51:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:20,291 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-02-02 20:51:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:51:20,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 20:51:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:20,292 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:51:20,292 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 20:51:20,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:51:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 20:51:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 99. [2018-02-02 20:51:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 20:51:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2018-02-02 20:51:20,297 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 21 [2018-02-02 20:51:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:20,297 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2018-02-02 20:51:20,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:51:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-02-02 20:51:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:51:20,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:20,298 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:20,298 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash -986431451, now seen corresponding path program 1 times [2018-02-02 20:51:20,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:20,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:20,417 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:51:20,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:20,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:51:20,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:20,418 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:51:20,418 INFO L182 omatonBuilderFactory]: Interpolants [1872#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 1873#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 1874#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 1875#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1876#(= 1 (select |#valid| |main_#t~mem13.base|)), 1867#true, 1868#false, 1869#(= 0 |main_#t~malloc0.offset|), 1870#(= main_~head~0.offset 0), 1871#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0))] [2018-02-02 20:51:20,418 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:51:20,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:51:20,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:51:20,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:51:20,418 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 10 states. [2018-02-02 20:51:20,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:20,692 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2018-02-02 20:51:20,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:51:20,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-02-02 20:51:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:20,693 INFO L225 Difference]: With dead ends: 145 [2018-02-02 20:51:20,693 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 20:51:20,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:51:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 20:51:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2018-02-02 20:51:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 20:51:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-02-02 20:51:20,697 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 25 [2018-02-02 20:51:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:20,697 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-02-02 20:51:20,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:51:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-02-02 20:51:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:51:20,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:20,698 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:20,698 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash -986431450, now seen corresponding path program 1 times [2018-02-02 20:51:20,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:20,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:20,854 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:51:20,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:20,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:51:20,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:20,856 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:51:20,856 INFO L182 omatonBuilderFactory]: Interpolants [2144#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 2145#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 2146#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2147#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0)), 2139#true, 2140#false, 2141#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 2142#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 2143#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:51:20,856 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:51:20,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:51:20,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:51:20,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:51:20,857 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 9 states. [2018-02-02 20:51:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:21,179 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-02-02 20:51:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:51:21,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-02 20:51:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:21,181 INFO L225 Difference]: With dead ends: 154 [2018-02-02 20:51:21,181 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 20:51:21,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:51:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 20:51:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 99. [2018-02-02 20:51:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 20:51:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-02-02 20:51:21,184 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 25 [2018-02-02 20:51:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:21,185 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-02-02 20:51:21,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:51:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-02-02 20:51:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:51:21,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:21,186 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] [2018-02-02 20:51:21,186 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:21,186 INFO L82 PathProgramCache]: Analyzing trace with hash -515063564, now seen corresponding path program 1 times [2018-02-02 20:51:21,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:21,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:21,228 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:51:21,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:21,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:51:21,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:21,229 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:51:21,229 INFO L182 omatonBuilderFactory]: Interpolants [2416#false, 2417#(= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 2418#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 2419#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 2420#(= 1 (select |#valid| |main_#t~mem20.base|)), 2421#(= 1 (select |#valid| main_~x~0.base)), 2415#true] [2018-02-02 20:51:21,229 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:51:21,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:51:21,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:51:21,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:51:21,230 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 7 states. [2018-02-02 20:51:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:21,394 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2018-02-02 20:51:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:51:21,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 20:51:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:21,395 INFO L225 Difference]: With dead ends: 135 [2018-02-02 20:51:21,395 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 20:51:21,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:51:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 20:51:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 101. [2018-02-02 20:51:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 20:51:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-02-02 20:51:21,398 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 26 [2018-02-02 20:51:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:21,399 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-02-02 20:51:21,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:51:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-02-02 20:51:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:51:21,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:21,399 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] [2018-02-02 20:51:21,400 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash -515063563, now seen corresponding path program 1 times [2018-02-02 20:51:21,400 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:21,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:21,646 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:51:21,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:21,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:51:21,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:21,647 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:51:21,647 INFO L182 omatonBuilderFactory]: Interpolants [2672#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2673#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 2674#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2675#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 |main_#t~mem11.offset|) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2676#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~x~0.offset)), 2677#(and (= 8 (select |#length| |main_#t~mem20.base|)) (<= |main_#t~mem20.offset| 0) (<= 0 |main_#t~mem20.offset|)), 2678#(and (= (select |#length| main_~x~0.base) 8) (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)), 2668#true, 2669#false, 2670#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 2671#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0))] [2018-02-02 20:51:21,647 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:51:21,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:51:21,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:51:21,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:51:21,648 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 11 states. [2018-02-02 20:51:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:21,947 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2018-02-02 20:51:21,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:51:21,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-02-02 20:51:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:21,948 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:51:21,948 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 20:51:21,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:51:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 20:51:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-02-02 20:51:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 20:51:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2018-02-02 20:51:21,951 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 26 [2018-02-02 20:51:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:21,952 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2018-02-02 20:51:21,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:51:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2018-02-02 20:51:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:51:21,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:21,953 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:21,953 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash -90305214, now seen corresponding path program 1 times [2018-02-02 20:51:21,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:21,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:22,185 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:51:22,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:22,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:51:22,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:22,185 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:51:22,185 INFO L182 omatonBuilderFactory]: Interpolants [2981#true, 2982#false, 2983#(= |#valid| |old(#valid)|), 2984#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (= 0 |main_#t~malloc0.offset|)), 2985#(and (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0)), 2986#(and (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2987#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~head~0.base main_~x~0.base) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 2988#(and (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2989#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 |main_#t~mem11.offset|) (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))), 2990#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 0 main_~x~0.offset)), 2991#(and (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 2992#(and (not (= 0 |main_#t~mem20.base|)) (= (store |#valid| |main_#t~mem20.base| 0) |old(#valid)|)), 2993#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|))] [2018-02-02 20:51:22,185 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:51:22,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:51:22,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:51:22,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:51:22,186 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand 13 states. [2018-02-02 20:51:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:22,665 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-02-02 20:51:22,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:51:22,665 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 20:51:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:22,666 INFO L225 Difference]: With dead ends: 144 [2018-02-02 20:51:22,666 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 20:51:22,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:51:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 20:51:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2018-02-02 20:51:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 20:51:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2018-02-02 20:51:22,675 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 30 [2018-02-02 20:51:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:22,675 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2018-02-02 20:51:22,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:51:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2018-02-02 20:51:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:51:22,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:22,675 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:22,675 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash -709364135, now seen corresponding path program 1 times [2018-02-02 20:51:22,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:22,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:22,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:22,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:51:22,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:22,804 INFO L182 omatonBuilderFactory]: Interpolants [3296#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 3297#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3298#(= 1 (select |#valid| |main_#t~mem15.base|)), 3289#true, 3290#false, 3291#(= 0 |main_#t~malloc0.offset|), 3292#(= main_~head~0.offset 0), 3293#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 3294#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 3295#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:51:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:22,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:51:22,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:51:22,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:51:22,805 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand 10 states. [2018-02-02 20:51:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:23,067 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-02-02 20:51:23,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:51:23,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-02-02 20:51:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:23,068 INFO L225 Difference]: With dead ends: 144 [2018-02-02 20:51:23,068 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 20:51:23,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:51:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 20:51:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2018-02-02 20:51:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 20:51:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2018-02-02 20:51:23,071 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 30 [2018-02-02 20:51:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:23,071 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2018-02-02 20:51:23,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:51:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2018-02-02 20:51:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:51:23,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:23,072 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:23,072 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash -709364134, now seen corresponding path program 1 times [2018-02-02 20:51:23,073 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:23,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:51:23,182 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:51:23,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:23,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:51:23,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:23,183 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:51:23,183 INFO L182 omatonBuilderFactory]: Interpolants [3584#true, 3585#false, 3586#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 3587#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 3588#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3589#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 3590#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 3591#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3592#(and (= (select |#length| |main_#t~mem15.base|) 8) (= |main_#t~mem15.offset| 0))] [2018-02-02 20:51:23,183 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:51:23,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:51:23,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:51:23,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:51:23,184 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 9 states. [2018-02-02 20:51:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:23,387 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-02-02 20:51:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:51:23,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-02 20:51:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:23,388 INFO L225 Difference]: With dead ends: 148 [2018-02-02 20:51:23,388 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 20:51:23,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:51:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 20:51:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 125. [2018-02-02 20:51:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 20:51:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2018-02-02 20:51:23,392 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 30 [2018-02-02 20:51:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:23,392 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2018-02-02 20:51:23,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:51:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2018-02-02 20:51:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:51:23,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:23,393 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:23,393 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1139830908, now seen corresponding path program 1 times [2018-02-02 20:51:23,394 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:23,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:23,420 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:51:23,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:23,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:51:23,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:23,420 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:51:23,420 INFO L182 omatonBuilderFactory]: Interpolants [3880#true, 3881#false, 3882#(= main_~state~0 1)] [2018-02-02 20:51:23,421 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:51:23,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:51:23,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:51:23,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:51:23,421 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand 3 states. [2018-02-02 20:51:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:23,432 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2018-02-02 20:51:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:51:23,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-02 20:51:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:23,435 INFO L225 Difference]: With dead ends: 191 [2018-02-02 20:51:23,435 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 20:51:23,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:51:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 20:51:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 140. [2018-02-02 20:51:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 20:51:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-02-02 20:51:23,439 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 30 [2018-02-02 20:51:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:23,439 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-02-02 20:51:23,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:51:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-02-02 20:51:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:51:23,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:23,440 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] [2018-02-02 20:51:23,440 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash -836244840, now seen corresponding path program 1 times [2018-02-02 20:51:23,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:23,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:23,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:23,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:51:23,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:23,645 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:51:23,645 INFO L182 omatonBuilderFactory]: Interpolants [4224#(and (= 0 |main_#t~mem20.offset|) (= 0 (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)))), 4225#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))), 4226#(= 0 |main_#t~mem21|), 4214#true, 4215#false, 4216#(= 0 |main_#t~malloc0.offset|), 4217#(= main_~head~0.offset 0), 4218#(and (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4219#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.offset 0) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 4220#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 |main_#t~mem11.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4221#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4222#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) |main_#t~mem12|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4223#(and (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))))] [2018-02-02 20:51:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:23,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:51:23,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:51:23,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:51:23,645 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 13 states. [2018-02-02 20:51:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:23,890 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2018-02-02 20:51:23,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:51:23,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 20:51:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:23,891 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:51:23,891 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 20:51:23,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:51:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 20:51:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2018-02-02 20:51:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 20:51:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2018-02-02 20:51:23,894 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 32 [2018-02-02 20:51:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:23,894 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2018-02-02 20:51:23,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:51:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2018-02-02 20:51:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:51:23,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:23,895 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] [2018-02-02 20:51:23,895 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:23,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1537011505, now seen corresponding path program 1 times [2018-02-02 20:51:23,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:23,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:24,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:24,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:51:24,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:24,044 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:51:24,044 INFO L182 omatonBuilderFactory]: Interpolants [4545#true, 4546#false, 4547#(= 0 |main_#t~malloc0.offset|), 4548#(= main_~head~0.offset 0), 4549#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 4550#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 4551#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4552#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 4553#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4554#(= 1 (select |#valid| |main_#t~mem19.base|)), 4555#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:51:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:24,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:51:24,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:51:24,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:51:24,045 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand 11 states. [2018-02-02 20:51:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:24,426 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-02-02 20:51:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:51:24,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-02 20:51:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:24,427 INFO L225 Difference]: With dead ends: 156 [2018-02-02 20:51:24,427 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 20:51:24,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:51:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 20:51:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2018-02-02 20:51:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 20:51:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2018-02-02 20:51:24,430 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 33 [2018-02-02 20:51:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:24,431 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2018-02-02 20:51:24,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:51:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2018-02-02 20:51:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:51:24,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:24,431 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] [2018-02-02 20:51:24,431 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1537011506, now seen corresponding path program 1 times [2018-02-02 20:51:24,432 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:24,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:24,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:24,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:51:24,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:24,614 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:51:24,615 INFO L182 omatonBuilderFactory]: Interpolants [4880#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 4881#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 4882#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4883#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 4884#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 4875#true, 4876#false, 4877#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 4878#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 4879#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:51:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:24,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:51:24,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:51:24,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:51:24,615 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand 10 states. [2018-02-02 20:51:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:25,021 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2018-02-02 20:51:25,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:51:25,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-02-02 20:51:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:25,023 INFO L225 Difference]: With dead ends: 184 [2018-02-02 20:51:25,023 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 20:51:25,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:51:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 20:51:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 156. [2018-02-02 20:51:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 20:51:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 185 transitions. [2018-02-02 20:51:25,026 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 185 transitions. Word has length 33 [2018-02-02 20:51:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:25,026 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 185 transitions. [2018-02-02 20:51:25,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:51:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 185 transitions. [2018-02-02 20:51:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:51:25,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:25,027 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] [2018-02-02 20:51:25,027 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash 416235869, now seen corresponding path program 1 times [2018-02-02 20:51:25,028 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:25,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:25,134 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:51:25,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:25,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:51:25,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:25,135 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:51:25,135 INFO L182 omatonBuilderFactory]: Interpolants [5248#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 5249#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 5250#(and (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 5251#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base))), 5252#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 5253#(= 1 (select |#valid| |main_#t~mem11.base|)), 5254#(= 1 (select |#valid| main_~x~0.base)), 5243#true, 5244#false, 5245#(= (select |#valid| main_~head~0.base) 1), 5246#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5247#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base))] [2018-02-02 20:51:25,135 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:51:25,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:51:25,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:51:25,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:51:25,136 INFO L87 Difference]: Start difference. First operand 156 states and 185 transitions. Second operand 12 states. [2018-02-02 20:51:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:25,413 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2018-02-02 20:51:25,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:51:25,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-02 20:51:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:25,414 INFO L225 Difference]: With dead ends: 245 [2018-02-02 20:51:25,414 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 20:51:25,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:51:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 20:51:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 186. [2018-02-02 20:51:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 20:51:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 219 transitions. [2018-02-02 20:51:25,417 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 219 transitions. Word has length 35 [2018-02-02 20:51:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:25,417 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 219 transitions. [2018-02-02 20:51:25,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:51:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 219 transitions. [2018-02-02 20:51:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:51:25,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:25,417 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] [2018-02-02 20:51:25,417 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash 416235870, now seen corresponding path program 1 times [2018-02-02 20:51:25,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:25,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:25,545 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:51:25,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:25,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:51:25,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:25,545 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:51:25,545 INFO L182 omatonBuilderFactory]: Interpolants [5712#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 5713#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 5714#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5715#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 5716#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5717#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 5718#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset)), 5708#true, 5709#false, 5710#(= (select |#valid| main_~head~0.base) 1), 5711#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:51:25,545 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:51:25,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:51:25,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:51:25,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:51:25,552 INFO L87 Difference]: Start difference. First operand 186 states and 219 transitions. Second operand 11 states. [2018-02-02 20:51:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:25,898 INFO L93 Difference]: Finished difference Result 257 states and 293 transitions. [2018-02-02 20:51:25,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:51:25,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-02 20:51:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:25,899 INFO L225 Difference]: With dead ends: 257 [2018-02-02 20:51:25,899 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 20:51:25,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:51:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 20:51:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 199. [2018-02-02 20:51:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:51:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2018-02-02 20:51:25,902 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 35 [2018-02-02 20:51:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:25,902 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2018-02-02 20:51:25,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:51:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2018-02-02 20:51:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:51:25,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:25,902 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:25,902 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:25,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1483020824, now seen corresponding path program 1 times [2018-02-02 20:51:25,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:25,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:26,027 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:51:26,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:26,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:51:26,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:26,028 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:51:26,028 INFO L182 omatonBuilderFactory]: Interpolants [6192#(= main_~head~0.offset 0), 6193#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 6194#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 6195#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6196#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 6197#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 6198#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 6199#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6200#(= 1 (select |#valid| |main_#t~mem13.base|)), 6189#true, 6190#false, 6191#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 20:51:26,028 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:51:26,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:51:26,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:51:26,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:51:26,029 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand 12 states. [2018-02-02 20:51:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:26,338 INFO L93 Difference]: Finished difference Result 215 states and 239 transitions. [2018-02-02 20:51:26,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:51:26,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-02-02 20:51:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:26,340 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:51:26,340 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 20:51:26,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:51:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 20:51:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-02-02 20:51:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:51:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2018-02-02 20:51:26,344 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 37 [2018-02-02 20:51:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:26,344 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2018-02-02 20:51:26,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:51:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2018-02-02 20:51:26,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:51:26,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:26,345 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:26,345 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1483020825, now seen corresponding path program 1 times [2018-02-02 20:51:26,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:26,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:26,561 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:51:26,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:26,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:51:26,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:26,562 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:51:26,562 INFO L182 omatonBuilderFactory]: Interpolants [6640#false, 6641#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 6642#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 6643#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6644#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 6645#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 6646#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 6647#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 6648#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6649#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0)), 6639#true] [2018-02-02 20:51:26,563 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:51:26,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:51:26,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:51:26,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:51:26,563 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand 11 states. [2018-02-02 20:51:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:26,919 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2018-02-02 20:51:26,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:51:26,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-02 20:51:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:26,920 INFO L225 Difference]: With dead ends: 221 [2018-02-02 20:51:26,920 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 20:51:26,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:51:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 20:51:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 199. [2018-02-02 20:51:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:51:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 235 transitions. [2018-02-02 20:51:26,924 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 235 transitions. Word has length 37 [2018-02-02 20:51:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:26,924 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 235 transitions. [2018-02-02 20:51:26,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:51:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 235 transitions. [2018-02-02 20:51:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:51:26,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:26,925 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] [2018-02-02 20:51:26,925 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1299548604, now seen corresponding path program 1 times [2018-02-02 20:51:26,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:26,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:27,087 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:51:27,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:27,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:51:27,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:27,087 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:51:27,087 INFO L182 omatonBuilderFactory]: Interpolants [7088#true, 7089#false, 7090#(= (select |#valid| main_~head~0.base) 1), 7091#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7092#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 7093#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 7094#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 7095#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 7096#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 7097#(= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7098#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 7099#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7100#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 20:51:27,088 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:51:27,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:51:27,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:51:27,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:51:27,088 INFO L87 Difference]: Start difference. First operand 199 states and 235 transitions. Second operand 13 states. [2018-02-02 20:51:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:27,457 INFO L93 Difference]: Finished difference Result 254 states and 288 transitions. [2018-02-02 20:51:27,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:51:27,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-02-02 20:51:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:27,458 INFO L225 Difference]: With dead ends: 254 [2018-02-02 20:51:27,458 INFO L226 Difference]: Without dead ends: 254 [2018-02-02 20:51:27,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:51:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-02 20:51:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 199. [2018-02-02 20:51:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:51:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 234 transitions. [2018-02-02 20:51:27,463 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 234 transitions. Word has length 39 [2018-02-02 20:51:27,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:27,463 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 234 transitions. [2018-02-02 20:51:27,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:51:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 234 transitions. [2018-02-02 20:51:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:51:27,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:27,463 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] [2018-02-02 20:51:27,464 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1299548603, now seen corresponding path program 1 times [2018-02-02 20:51:27,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:27,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:27,760 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:51:27,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:27,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:51:27,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:27,795 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:51:27,795 INFO L182 omatonBuilderFactory]: Interpolants [7584#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= (select |#length| main_~head~0.base) 8) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 7585#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= (select |#length| main_~head~0.base) 8) (= main_~x~0.base main_~head~0.base)), 7586#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~head~0.base) 8) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 7587#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~head~0.base) 8) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 7588#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select |#length| main_~head~0.base) 8) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 7589#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#length| main_~head~0.base) 8)), 7590#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 7591#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 7592#(and (= |main_#t~mem13.offset| 0) (<= 8 (select |#length| |main_#t~mem13.base|))), 7578#true, 7579#false, 7580#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 7581#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 7582#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 7583#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:51:27,795 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:51:27,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:51:27,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:51:27,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:51:27,796 INFO L87 Difference]: Start difference. First operand 199 states and 234 transitions. Second operand 15 states. [2018-02-02 20:51:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:28,414 INFO L93 Difference]: Finished difference Result 256 states and 289 transitions. [2018-02-02 20:51:28,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:51:28,414 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-02-02 20:51:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:28,415 INFO L225 Difference]: With dead ends: 256 [2018-02-02 20:51:28,415 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 20:51:28,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:51:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 20:51:28,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2018-02-02 20:51:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:51:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2018-02-02 20:51:28,417 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 39 [2018-02-02 20:51:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:28,417 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2018-02-02 20:51:28,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:51:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2018-02-02 20:51:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:51:28,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:28,418 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] [2018-02-02 20:51:28,418 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:28,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1631760714, now seen corresponding path program 1 times [2018-02-02 20:51:28,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:28,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:28,625 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:51:28,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:28,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:51:28,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:28,625 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:51:28,626 INFO L182 omatonBuilderFactory]: Interpolants [8076#true, 8077#false, 8078#(= (select |#valid| main_~head~0.base) 1), 8079#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8080#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 8081#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 8082#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8083#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 8084#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 8085#(and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8086#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 8087#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8088#(and (<= 0 |main_#t~mem20.offset|) (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|))), 8089#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 20:51:28,626 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:51:28,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:51:28,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:51:28,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:51:28,626 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand 14 states. [2018-02-02 20:51:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:29,079 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2018-02-02 20:51:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:51:29,080 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-02-02 20:51:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:29,080 INFO L225 Difference]: With dead ends: 256 [2018-02-02 20:51:29,080 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 20:51:29,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:51:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 20:51:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 221. [2018-02-02 20:51:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 20:51:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2018-02-02 20:51:29,083 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 40 [2018-02-02 20:51:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:29,083 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2018-02-02 20:51:29,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:51:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2018-02-02 20:51:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:51:29,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:29,083 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] [2018-02-02 20:51:29,083 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:29,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1429185466, now seen corresponding path program 1 times [2018-02-02 20:51:29,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:29,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:51:29,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:29,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:51:29,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:29,115 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:51:29,115 INFO L182 omatonBuilderFactory]: Interpolants [8595#true, 8596#false, 8597#(= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 8598#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8599#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-02 20:51:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:51:29,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:51:29,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:51:29,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:51:29,116 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 5 states. [2018-02-02 20:51:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:29,202 INFO L93 Difference]: Finished difference Result 226 states and 269 transitions. [2018-02-02 20:51:29,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:51:29,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-02 20:51:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:29,203 INFO L225 Difference]: With dead ends: 226 [2018-02-02 20:51:29,203 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 20:51:29,203 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:51:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 20:51:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2018-02-02 20:51:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 20:51:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2018-02-02 20:51:29,206 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 42 [2018-02-02 20:51:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:29,206 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2018-02-02 20:51:29,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:51:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2018-02-02 20:51:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:51:29,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:29,207 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] [2018-02-02 20:51:29,207 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1429185465, now seen corresponding path program 1 times [2018-02-02 20:51:29,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:29,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:29,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:29,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:51:29,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:29,472 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:51:29,472 INFO L182 omatonBuilderFactory]: Interpolants [9056#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 9057#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 9058#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 9059#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 9060#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 9061#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 9062#(and (<= 0 |main_#t~mem15.offset|) (<= |main_#t~mem15.offset| 0) (= (select |#length| |main_#t~mem15.base|) 8)), 9051#true, 9052#false, 9053#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 9054#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 9055#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:51:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:29,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:51:29,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:51:29,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:51:29,473 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand 12 states. [2018-02-02 20:51:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:29,869 INFO L93 Difference]: Finished difference Result 240 states and 272 transitions. [2018-02-02 20:51:29,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:51:29,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 20:51:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:29,869 INFO L225 Difference]: With dead ends: 240 [2018-02-02 20:51:29,870 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 20:51:29,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:51:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 20:51:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2018-02-02 20:51:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 20:51:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2018-02-02 20:51:29,873 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 42 [2018-02-02 20:51:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:29,873 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2018-02-02 20:51:29,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:51:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2018-02-02 20:51:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:51:29,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:29,874 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] [2018-02-02 20:51:29,874 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash -458979518, now seen corresponding path program 1 times [2018-02-02 20:51:29,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:29,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:30,073 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:51:30,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:30,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:51:30,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:30,074 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:51:30,074 INFO L182 omatonBuilderFactory]: Interpolants [9543#true, 9544#false, 9545#(= (select |#valid| main_~head~0.base) 1), 9546#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9547#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 9548#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 9549#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9550#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 9551#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9552#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9553#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 9554#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9555#(and (= 8 (select |#length| |main_#t~mem20.base|)) (<= 0 |main_#t~mem20.offset|)), 9556#(and (= (select |#length| main_~x~0.base) 8) (<= 0 main_~x~0.offset)), 9557#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset))] [2018-02-02 20:51:30,074 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:51:30,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:51:30,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:51:30,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:51:30,075 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 15 states. [2018-02-02 20:51:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:30,482 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2018-02-02 20:51:30,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:51:30,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-02-02 20:51:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:30,483 INFO L225 Difference]: With dead ends: 252 [2018-02-02 20:51:30,483 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 20:51:30,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:51:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 20:51:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 221. [2018-02-02 20:51:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 20:51:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 263 transitions. [2018-02-02 20:51:30,487 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 263 transitions. Word has length 42 [2018-02-02 20:51:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:30,487 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 263 transitions. [2018-02-02 20:51:30,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:51:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 263 transitions. [2018-02-02 20:51:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:51:30,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:30,488 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] [2018-02-02 20:51:30,488 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1094809275, now seen corresponding path program 1 times [2018-02-02 20:51:30,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:30,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:51:30,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:30,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:51:30,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:30,847 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:51:30,847 INFO L182 omatonBuilderFactory]: Interpolants [10057#true, 10058#false, 10059#(= 0 |main_#t~malloc0.offset|), 10060#(= main_~head~0.offset 0), 10061#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 10063#(and (= main_~head~0.base |main_#t~mem11.base|) (= main_~head~0.offset |main_#t~mem11.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem11.offset|) |main_#t~mem11.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10064#(and (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10065#(and (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem12| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10066#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10067#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= main_~head~0.offset |main_#t~mem13.offset|)), 10068#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~x~0.offset 4)) |main_#t~mem14|) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 10069#(and (not |main_#t~short18|) (= main_~head~0.offset 0))] [2018-02-02 20:51:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:51:30,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:51:30,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:51:30,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:51:30,847 INFO L87 Difference]: Start difference. First operand 221 states and 263 transitions. Second operand 13 states. [2018-02-02 20:51:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:31,095 INFO L93 Difference]: Finished difference Result 230 states and 262 transitions. [2018-02-02 20:51:31,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:51:31,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-02-02 20:51:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:31,095 INFO L225 Difference]: With dead ends: 230 [2018-02-02 20:51:31,096 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 20:51:31,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:51:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 20:51:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2018-02-02 20:51:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 20:51:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 262 transitions. [2018-02-02 20:51:31,098 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 262 transitions. Word has length 44 [2018-02-02 20:51:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:31,098 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 262 transitions. [2018-02-02 20:51:31,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:51:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 262 transitions. [2018-02-02 20:51:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:51:31,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:31,098 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] [2018-02-02 20:51:31,098 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1302319747, now seen corresponding path program 1 times [2018-02-02 20:51:31,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:31,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:31,365 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:51:31,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:31,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:51:31,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:31,366 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:51:31,366 INFO L182 omatonBuilderFactory]: Interpolants [10543#true, 10544#false, 10545#(= 0 |main_#t~malloc0.offset|), 10546#(= main_~head~0.offset 0), 10547#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 10548#(and (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 10549#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 10550#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 10551#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= main_~state~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 10552#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 10553#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10554#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 1) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10555#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~x~0.offset 4)) 1) (= main_~head~0.offset 0)), 10556#(and (= |main_#t~mem12| 1) (= main_~head~0.offset 0))] [2018-02-02 20:51:31,366 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:51:31,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:51:31,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:51:31,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:51:31,366 INFO L87 Difference]: Start difference. First operand 221 states and 262 transitions. Second operand 14 states. [2018-02-02 20:51:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:31,751 INFO L93 Difference]: Finished difference Result 287 states and 331 transitions. [2018-02-02 20:51:31,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:51:31,751 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 20:51:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:31,752 INFO L225 Difference]: With dead ends: 287 [2018-02-02 20:51:31,752 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 20:51:31,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:51:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 20:51:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 230. [2018-02-02 20:51:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 20:51:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 271 transitions. [2018-02-02 20:51:31,755 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 271 transitions. Word has length 44 [2018-02-02 20:51:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:31,755 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 271 transitions. [2018-02-02 20:51:31,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:51:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 271 transitions. [2018-02-02 20:51:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:51:31,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:31,755 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] [2018-02-02 20:51:31,756 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:31,756 INFO L82 PathProgramCache]: Analyzing trace with hash 683260827, now seen corresponding path program 1 times [2018-02-02 20:51:31,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:31,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:31,939 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:51:31,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:31,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:51:31,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:31,940 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:51:31,940 INFO L182 omatonBuilderFactory]: Interpolants [11104#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 11105#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 11106#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 11107#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 11108#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11109#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11110#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)), 11111#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 11112#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11113#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11114#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 8) (select |#length| |main_#t~mem15.base|))), 11098#true, 11099#false, 11100#(= 0 |main_#t~malloc0.offset|), 11101#(= 0 main_~head~0.offset), 11102#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 11103#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:51:31,940 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:51:31,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:51:31,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:51:31,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:51:31,940 INFO L87 Difference]: Start difference. First operand 230 states and 271 transitions. Second operand 17 states. [2018-02-02 20:51:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:32,482 INFO L93 Difference]: Finished difference Result 258 states and 288 transitions. [2018-02-02 20:51:32,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:51:32,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-02-02 20:51:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:32,482 INFO L225 Difference]: With dead ends: 258 [2018-02-02 20:51:32,483 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 20:51:32,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:51:32,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 20:51:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 230. [2018-02-02 20:51:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 20:51:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 270 transitions. [2018-02-02 20:51:32,486 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 270 transitions. Word has length 44 [2018-02-02 20:51:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:32,486 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 270 transitions. [2018-02-02 20:51:32,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:51:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 270 transitions. [2018-02-02 20:51:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:51:32,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:32,487 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:51:32,487 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 385787049, now seen corresponding path program 1 times [2018-02-02 20:51:32,487 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:32,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:32,792 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:51:32,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:32,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:51:32,792 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:32,793 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:51:32,793 INFO L182 omatonBuilderFactory]: Interpolants [11648#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11649#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11650#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~x~0.offset 4)) 0))), 11651#(and (= main_~head~0.offset 0) (not (= |main_#t~mem12| 0))), 11637#true, 11638#false, 11639#(= 0 |main_#t~malloc0.offset|), 11640#(= main_~head~0.offset 0), 11641#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 11642#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 11643#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 11644#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 11645#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 11646#(and (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 11647#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~state~0 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:51:32,793 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:51:32,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:51:32,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:51:32,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:51:32,793 INFO L87 Difference]: Start difference. First operand 230 states and 270 transitions. Second operand 15 states. [2018-02-02 20:51:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:33,275 INFO L93 Difference]: Finished difference Result 290 states and 332 transitions. [2018-02-02 20:51:33,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:51:33,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 20:51:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:33,276 INFO L225 Difference]: With dead ends: 290 [2018-02-02 20:51:33,276 INFO L226 Difference]: Without dead ends: 290 [2018-02-02 20:51:33,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:51:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-02 20:51:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 221. [2018-02-02 20:51:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 20:51:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 260 transitions. [2018-02-02 20:51:33,278 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 260 transitions. Word has length 45 [2018-02-02 20:51:33,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:33,279 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 260 transitions. [2018-02-02 20:51:33,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:51:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 260 transitions. [2018-02-02 20:51:33,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:51:33,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:33,279 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:51:33,279 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1615923171, now seen corresponding path program 1 times [2018-02-02 20:51:33,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:33,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:33,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:33,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:51:33,295 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:33,295 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:51:33,295 INFO L182 omatonBuilderFactory]: Interpolants [12189#true, 12190#false, 12191#(= main_~state~0 2)] [2018-02-02 20:51:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:33,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:51:33,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:51:33,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:51:33,295 INFO L87 Difference]: Start difference. First operand 221 states and 260 transitions. Second operand 3 states. [2018-02-02 20:51:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:33,314 INFO L93 Difference]: Finished difference Result 331 states and 388 transitions. [2018-02-02 20:51:33,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:51:33,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-02-02 20:51:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:33,315 INFO L225 Difference]: With dead ends: 331 [2018-02-02 20:51:33,315 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 20:51:33,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:51:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 20:51:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-02-02 20:51:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 20:51:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 278 transitions. [2018-02-02 20:51:33,319 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 278 transitions. Word has length 45 [2018-02-02 20:51:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:33,319 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 278 transitions. [2018-02-02 20:51:33,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:51:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2018-02-02 20:51:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:51:33,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:33,320 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:33,320 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash -156854704, now seen corresponding path program 1 times [2018-02-02 20:51:33,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:33,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:51:33,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:51:33,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:51:33,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:33,359 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:51:33,359 INFO L182 omatonBuilderFactory]: Interpolants [12760#true, 12761#false, 12762#(= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 12763#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12764#(= 1 (select |#valid| |main_#t~mem19.base|)), 12765#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:51:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:51:33,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:51:33,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:51:33,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:51:33,360 INFO L87 Difference]: Start difference. First operand 237 states and 278 transitions. Second operand 6 states. [2018-02-02 20:51:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:33,453 INFO L93 Difference]: Finished difference Result 240 states and 279 transitions. [2018-02-02 20:51:33,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:51:33,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-02 20:51:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:33,454 INFO L225 Difference]: With dead ends: 240 [2018-02-02 20:51:33,454 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 20:51:33,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:51:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 20:51:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2018-02-02 20:51:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 20:51:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 279 transitions. [2018-02-02 20:51:33,456 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 279 transitions. Word has length 47 [2018-02-02 20:51:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:33,456 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 279 transitions. [2018-02-02 20:51:33,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:51:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 279 transitions. [2018-02-02 20:51:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:51:33,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:33,456 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:33,456 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash -156854703, now seen corresponding path program 1 times [2018-02-02 20:51:33,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:33,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:33,654 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:51:33,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:33,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:51:33,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:33,655 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:51:33,655 INFO L182 omatonBuilderFactory]: Interpolants [13253#true, 13254#false, 13255#(= 0 |main_#t~malloc0.offset|), 13256#(= 0 main_~head~0.offset), 13257#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 13258#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 13259#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 13260#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 13261#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 13262#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 13263#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13264#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13265#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)), 13266#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 13267#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 13268#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13269#(and (<= 0 |main_#t~mem19.offset|) (<= (+ |main_#t~mem19.offset| 8) (select |#length| |main_#t~mem19.base|))), 13270#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 20:51:33,655 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:51:33,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:51:33,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:51:33,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:51:33,655 INFO L87 Difference]: Start difference. First operand 239 states and 279 transitions. Second operand 18 states. [2018-02-02 20:51:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:34,284 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2018-02-02 20:51:34,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:51:34,284 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-02 20:51:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:34,285 INFO L225 Difference]: With dead ends: 284 [2018-02-02 20:51:34,285 INFO L226 Difference]: Without dead ends: 284 [2018-02-02 20:51:34,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:51:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-02-02 20:51:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 255. [2018-02-02 20:51:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 20:51:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 300 transitions. [2018-02-02 20:51:34,288 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 300 transitions. Word has length 47 [2018-02-02 20:51:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:34,288 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 300 transitions. [2018-02-02 20:51:34,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:51:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 300 transitions. [2018-02-02 20:51:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:51:34,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:34,289 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] [2018-02-02 20:51:34,289 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:34,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1047954627, now seen corresponding path program 1 times [2018-02-02 20:51:34,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:34,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:51:34,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:34,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:51:34,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:34,672 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:51:34,672 INFO L182 omatonBuilderFactory]: Interpolants [13856#(and (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem12| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13857#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13858#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem19.offset|) (not (= 0 (select (select |#memory_int| |main_#t~mem19.base|) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13859#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 13860#(and (= main_~head~0.offset 0) (not (= 0 |main_#t~mem12|))), 13848#true, 13849#false, 13850#(= 0 |main_#t~malloc0.offset|), 13851#(= main_~head~0.offset 0), 13852#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13853#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 13854#(and (= main_~head~0.base |main_#t~mem11.base|) (= main_~head~0.offset |main_#t~mem11.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem11.offset|) |main_#t~mem11.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13855#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:51:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:51:34,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:51:34,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:51:34,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:51:34,673 INFO L87 Difference]: Start difference. First operand 255 states and 300 transitions. Second operand 13 states. [2018-02-02 20:51:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:34,913 INFO L93 Difference]: Finished difference Result 264 states and 300 transitions. [2018-02-02 20:51:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:51:34,913 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 20:51:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:34,914 INFO L225 Difference]: With dead ends: 264 [2018-02-02 20:51:34,914 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 20:51:34,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:51:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 20:51:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2018-02-02 20:51:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 20:51:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 299 transitions. [2018-02-02 20:51:34,917 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 299 transitions. Word has length 48 [2018-02-02 20:51:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:34,917 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 299 transitions. [2018-02-02 20:51:34,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:51:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 299 transitions. [2018-02-02 20:51:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:51:34,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:34,918 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:34,918 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash -731024595, now seen corresponding path program 1 times [2018-02-02 20:51:34,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:34,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:35,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:35,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:51:35,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:35,106 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:51:35,106 INFO L182 omatonBuilderFactory]: Interpolants [14400#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 14401#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 14402#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14403#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 14404#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 14405#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 14406#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 14407#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14408#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14409#(and (<= 0 |main_#t~mem19.offset|) (= 8 (select |#length| |main_#t~mem19.base|)) (<= |main_#t~mem19.offset| 0)), 14410#(and (= (select |#length| main_~x~0.base) 8) (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)), 14398#true, 14399#false] [2018-02-02 20:51:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:35,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:51:35,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:51:35,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:51:35,106 INFO L87 Difference]: Start difference. First operand 255 states and 299 transitions. Second operand 13 states. [2018-02-02 20:51:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:35,506 INFO L93 Difference]: Finished difference Result 292 states and 329 transitions. [2018-02-02 20:51:35,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:51:35,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-02-02 20:51:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:35,507 INFO L225 Difference]: With dead ends: 292 [2018-02-02 20:51:35,508 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 20:51:35,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:51:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 20:51:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 271. [2018-02-02 20:51:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 20:51:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 320 transitions. [2018-02-02 20:51:35,510 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 320 transitions. Word has length 49 [2018-02-02 20:51:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:35,510 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 320 transitions. [2018-02-02 20:51:35,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:51:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 320 transitions. [2018-02-02 20:51:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:51:35,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:35,510 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:35,511 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash 403414204, now seen corresponding path program 2 times [2018-02-02 20:51:35,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:35,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:51:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:35,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:35,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:51:35,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:35,672 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:51:35,672 INFO L182 omatonBuilderFactory]: Interpolants [15008#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 15009#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 15010#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 15011#(= 1 (select |#valid| |main_#t~mem11.base|)), 15012#(= 1 (select |#valid| main_~x~0.base)), 14998#true, 14999#false, 15000#(= (select |#valid| main_~head~0.base) 1), 15001#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15002#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 15003#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15004#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 15005#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 15006#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 15007#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:51:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:35,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:51:35,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:51:35,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:51:35,673 INFO L87 Difference]: Start difference. First operand 271 states and 320 transitions. Second operand 15 states. [2018-02-02 20:51:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:36,050 INFO L93 Difference]: Finished difference Result 384 states and 446 transitions. [2018-02-02 20:51:36,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:51:36,050 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-02-02 20:51:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:36,051 INFO L225 Difference]: With dead ends: 384 [2018-02-02 20:51:36,051 INFO L226 Difference]: Without dead ends: 384 [2018-02-02 20:51:36,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:51:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-02 20:51:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 315. [2018-02-02 20:51:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 20:51:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 369 transitions. [2018-02-02 20:51:36,054 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 369 transitions. Word has length 49 [2018-02-02 20:51:36,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:36,054 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 369 transitions. [2018-02-02 20:51:36,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:51:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 369 transitions. [2018-02-02 20:51:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:51:36,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:36,054 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:36,054 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash 403414205, now seen corresponding path program 2 times [2018-02-02 20:51:36,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:36,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:36,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:36,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:51:36,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:36,267 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:51:36,267 INFO L182 omatonBuilderFactory]: Interpolants [15744#true, 15745#false, 15746#(= (select |#valid| main_~head~0.base) 1), 15747#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15748#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 15749#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15750#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 15751#(and (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 15752#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 15753#(and (= (select |#length| main_~x~0.base) 8) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 15754#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15755#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15756#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 15757#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15758#(and (<= 8 (select |#length| |main_#t~mem11.base|)) (= 0 |main_#t~mem11.offset|)), 15759#(and (<= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-02-02 20:51:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:36,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:51:36,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:51:36,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:51:36,267 INFO L87 Difference]: Start difference. First operand 315 states and 369 transitions. Second operand 16 states. [2018-02-02 20:51:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:36,760 INFO L93 Difference]: Finished difference Result 390 states and 448 transitions. [2018-02-02 20:51:36,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:51:36,761 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-02 20:51:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:36,761 INFO L225 Difference]: With dead ends: 390 [2018-02-02 20:51:36,762 INFO L226 Difference]: Without dead ends: 390 [2018-02-02 20:51:36,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:51:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-02 20:51:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 330. [2018-02-02 20:51:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:51:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 389 transitions. [2018-02-02 20:51:36,764 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 389 transitions. Word has length 49 [2018-02-02 20:51:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:36,765 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 389 transitions. [2018-02-02 20:51:36,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:51:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 389 transitions. [2018-02-02 20:51:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:51:36,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:36,765 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] [2018-02-02 20:51:36,766 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:36,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2046302647, now seen corresponding path program 1 times [2018-02-02 20:51:36,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:36,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:36,952 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:51:36,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:36,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:51:36,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:36,952 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:51:36,952 INFO L182 omatonBuilderFactory]: Interpolants [16512#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 16513#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 16514#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 16515#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 16516#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 16517#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 16518#(= 1 (select |#valid| |main_#t~mem13.base|)), 16504#true, 16505#false, 16506#(= (select |#valid| main_~head~0.base) 1), 16507#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 16508#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 16509#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 16510#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 16511#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:51:36,952 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:51:36,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:51:36,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:51:36,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:51:36,953 INFO L87 Difference]: Start difference. First operand 330 states and 389 transitions. Second operand 15 states. [2018-02-02 20:51:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:37,492 INFO L93 Difference]: Finished difference Result 347 states and 395 transitions. [2018-02-02 20:51:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:51:37,492 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-02-02 20:51:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:37,493 INFO L225 Difference]: With dead ends: 347 [2018-02-02 20:51:37,493 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 20:51:37,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:51:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 20:51:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 330. [2018-02-02 20:51:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:51:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 388 transitions. [2018-02-02 20:51:37,495 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 388 transitions. Word has length 51 [2018-02-02 20:51:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:37,495 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 388 transitions. [2018-02-02 20:51:37,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:51:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 388 transitions. [2018-02-02 20:51:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:51:37,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:37,496 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] [2018-02-02 20:51:37,496 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:37,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2046302648, now seen corresponding path program 1 times [2018-02-02 20:51:37,497 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:37,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:37,678 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:51:37,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:37,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:51:37,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:37,678 INFO L182 omatonBuilderFactory]: Interpolants [17226#true, 17227#false, 17228#(= (select |#valid| main_~head~0.base) 1), 17229#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17230#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 17231#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 17232#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 17233#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 17234#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 17235#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 17236#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 17237#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 17238#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 17239#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 17240#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0))] [2018-02-02 20:51:37,679 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:51:37,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:51:37,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:51:37,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:51:37,679 INFO L87 Difference]: Start difference. First operand 330 states and 388 transitions. Second operand 15 states. [2018-02-02 20:51:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:38,192 INFO L93 Difference]: Finished difference Result 349 states and 396 transitions. [2018-02-02 20:51:38,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:51:38,193 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-02-02 20:51:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:38,193 INFO L225 Difference]: With dead ends: 349 [2018-02-02 20:51:38,193 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 20:51:38,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:51:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 20:51:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 330. [2018-02-02 20:51:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:51:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 387 transitions. [2018-02-02 20:51:38,196 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 387 transitions. Word has length 51 [2018-02-02 20:51:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:38,196 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 387 transitions. [2018-02-02 20:51:38,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:51:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 387 transitions. [2018-02-02 20:51:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:51:38,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:38,196 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-02-02 20:51:38,196 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:38,196 INFO L82 PathProgramCache]: Analyzing trace with hash 755837075, now seen corresponding path program 1 times [2018-02-02 20:51:38,197 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:38,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:38,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:38,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:51:38,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:38,372 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:51:38,372 INFO L182 omatonBuilderFactory]: Interpolants [17952#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 17953#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 17954#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17955#(= 1 (select |#valid| |main_#t~mem13.base|)), 17942#true, 17943#false, 17944#(= 0 |main_#t~malloc0.offset|), 17945#(= main_~head~0.offset 0), 17946#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 17947#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 17948#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 17949#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))), 17950#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 17951#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))] [2018-02-02 20:51:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:38,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:51:38,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:51:38,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:51:38,373 INFO L87 Difference]: Start difference. First operand 330 states and 387 transitions. Second operand 14 states. [2018-02-02 20:51:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:38,817 INFO L93 Difference]: Finished difference Result 343 states and 389 transitions. [2018-02-02 20:51:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:51:38,817 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-02-02 20:51:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:38,818 INFO L225 Difference]: With dead ends: 343 [2018-02-02 20:51:38,818 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 20:51:38,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:51:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 20:51:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 330. [2018-02-02 20:51:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:51:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 386 transitions. [2018-02-02 20:51:38,820 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 386 transitions. Word has length 53 [2018-02-02 20:51:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:38,820 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 386 transitions. [2018-02-02 20:51:38,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:51:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 386 transitions. [2018-02-02 20:51:38,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:51:38,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:38,821 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-02-02 20:51:38,821 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash 755837076, now seen corresponding path program 1 times [2018-02-02 20:51:38,821 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:38,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:38,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:38,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:51:38,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:38,986 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:51:38,986 INFO L182 omatonBuilderFactory]: Interpolants [18659#true, 18660#false, 18661#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 18662#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 18663#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18664#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 18665#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))), 18666#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 18667#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 18668#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 18669#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 18670#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18671#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0))] [2018-02-02 20:51:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:38,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:51:38,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:51:38,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:51:38,987 INFO L87 Difference]: Start difference. First operand 330 states and 386 transitions. Second operand 13 states. [2018-02-02 20:51:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:39,377 INFO L93 Difference]: Finished difference Result 349 states and 394 transitions. [2018-02-02 20:51:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:51:39,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-02 20:51:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:39,378 INFO L225 Difference]: With dead ends: 349 [2018-02-02 20:51:39,378 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 20:51:39,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:51:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 20:51:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 330. [2018-02-02 20:51:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:51:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 385 transitions. [2018-02-02 20:51:39,381 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 385 transitions. Word has length 53 [2018-02-02 20:51:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:39,381 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 385 transitions. [2018-02-02 20:51:39,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:51:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 385 transitions. [2018-02-02 20:51:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:51:39,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:39,382 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:39,382 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1151595997, now seen corresponding path program 2 times [2018-02-02 20:51:39,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:39,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:39,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:39,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:51:39,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:39,600 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:51:39,601 INFO L182 omatonBuilderFactory]: Interpolants [19373#true, 19374#false, 19375#(= (select |#valid| main_~head~0.base) 1), 19376#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19377#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 19378#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19379#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 19380#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 19381#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 19382#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 19383#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 19384#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19385#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))), 19386#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19387#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19388#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 19389#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 19390#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 20:51:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:39,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:51:39,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:51:39,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:51:39,601 INFO L87 Difference]: Start difference. First operand 330 states and 385 transitions. Second operand 18 states. [2018-02-02 20:51:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:40,139 INFO L93 Difference]: Finished difference Result 401 states and 461 transitions. [2018-02-02 20:51:40,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:51:40,140 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-02-02 20:51:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:40,140 INFO L225 Difference]: With dead ends: 401 [2018-02-02 20:51:40,140 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 20:51:40,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:51:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 20:51:40,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 330. [2018-02-02 20:51:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:51:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 384 transitions. [2018-02-02 20:51:40,143 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 384 transitions. Word has length 53 [2018-02-02 20:51:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:40,143 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 384 transitions. [2018-02-02 20:51:40,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:51:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 384 transitions. [2018-02-02 20:51:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:51:40,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:40,143 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:40,144 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:40,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1151595996, now seen corresponding path program 2 times [2018-02-02 20:51:40,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:40,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:51:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:40,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:40,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:51:40,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:40,401 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:51:40,402 INFO L182 omatonBuilderFactory]: Interpolants [20160#(= (select |#valid| main_~head~0.base) 1), 20161#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20162#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 20163#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20164#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 20165#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 20166#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 20167#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 20168#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 20169#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20170#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 20171#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20172#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) 0))), 20173#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)) (= 0 main_~x~0.offset)), 20174#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 20175#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0)), 20158#true, 20159#false] [2018-02-02 20:51:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:40,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:51:40,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:51:40,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:51:40,402 INFO L87 Difference]: Start difference. First operand 330 states and 384 transitions. Second operand 18 states. [2018-02-02 20:51:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:41,054 INFO L93 Difference]: Finished difference Result 388 states and 442 transitions. [2018-02-02 20:51:41,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:51:41,054 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-02-02 20:51:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:41,055 INFO L225 Difference]: With dead ends: 388 [2018-02-02 20:51:41,055 INFO L226 Difference]: Without dead ends: 388 [2018-02-02 20:51:41,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:51:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-02 20:51:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 330. [2018-02-02 20:51:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:51:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 383 transitions. [2018-02-02 20:51:41,057 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 383 transitions. Word has length 53 [2018-02-02 20:51:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:41,057 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 383 transitions. [2018-02-02 20:51:41,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:51:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 383 transitions. [2018-02-02 20:51:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:51:41,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:41,058 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:41,058 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1340197193, now seen corresponding path program 2 times [2018-02-02 20:51:41,058 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:41,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:41,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:41,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:51:41,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:41,250 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:51:41,250 INFO L182 omatonBuilderFactory]: Interpolants [20928#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 20929#(and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20930#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 20931#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20932#(and (<= 0 |main_#t~mem20.offset|) (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|))), 20933#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 20916#true, 20917#false, 20918#(= (select |#valid| main_~head~0.base) 1), 20919#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20920#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 20921#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20922#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20923#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 20924#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 20925#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20926#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20927#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))] [2018-02-02 20:51:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:41,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:51:41,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:51:41,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:51:41,250 INFO L87 Difference]: Start difference. First operand 330 states and 383 transitions. Second operand 18 states. [2018-02-02 20:51:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:41,777 INFO L93 Difference]: Finished difference Result 366 states and 411 transitions. [2018-02-02 20:51:41,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:51:41,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-02-02 20:51:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:41,778 INFO L225 Difference]: With dead ends: 366 [2018-02-02 20:51:41,778 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 20:51:41,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:51:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 20:51:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 335. [2018-02-02 20:51:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 20:51:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 391 transitions. [2018-02-02 20:51:41,782 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 391 transitions. Word has length 54 [2018-02-02 20:51:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:41,782 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 391 transitions. [2018-02-02 20:51:41,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:51:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 391 transitions. [2018-02-02 20:51:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:51:41,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:41,783 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] [2018-02-02 20:51:41,783 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:41,783 INFO L82 PathProgramCache]: Analyzing trace with hash 209542896, now seen corresponding path program 1 times [2018-02-02 20:51:41,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:41,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:42,056 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:51:42,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:42,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:51:42,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:42,056 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:51:42,056 INFO L182 omatonBuilderFactory]: Interpolants [21665#true, 21666#false, 21667#(= 0 |main_#t~malloc0.offset|), 21668#(= main_~head~0.offset 0), 21669#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 21670#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 21671#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 21672#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 21673#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21674#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 21675#(and (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21676#(and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21677#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 21678#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem12| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.offset 0)), 21679#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 21680#(and (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 21681#(not (= 0 (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)))), 21682#(or (<= 1 main_~x~0.offset) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (<= (+ main_~x~0.offset 1) 0)), 21683#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= 0 |main_#t~mem21|))), 21684#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 20:51:42,056 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:51:42,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:51:42,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:51:42,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:51:42,057 INFO L87 Difference]: Start difference. First operand 335 states and 391 transitions. Second operand 20 states. [2018-02-02 20:51:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:42,522 INFO L93 Difference]: Finished difference Result 347 states and 394 transitions. [2018-02-02 20:51:42,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:51:42,522 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-02-02 20:51:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:42,523 INFO L225 Difference]: With dead ends: 347 [2018-02-02 20:51:42,523 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 20:51:42,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:51:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 20:51:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 334. [2018-02-02 20:51:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 20:51:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 389 transitions. [2018-02-02 20:51:42,526 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 389 transitions. Word has length 56 [2018-02-02 20:51:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:42,526 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 389 transitions. [2018-02-02 20:51:42,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:51:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 389 transitions. [2018-02-02 20:51:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:51:42,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:42,527 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] [2018-02-02 20:51:42,527 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:42,527 INFO L82 PathProgramCache]: Analyzing trace with hash 209592548, now seen corresponding path program 1 times [2018-02-02 20:51:42,527 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:42,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:51:42,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:42,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:51:42,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:42,622 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:51:42,622 INFO L182 omatonBuilderFactory]: Interpolants [22416#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 22417#(= 0 |main_#t~mem20.offset|), 22418#(= 0 main_~x~0.offset), 22419#(= main_~head~0.offset 0), 22408#true, 22409#false, 22410#(= (select |#valid| main_~head~0.base) 1), 22411#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22412#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 22413#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 22414#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22415#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))] [2018-02-02 20:51:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:51:42,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:51:42,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:51:42,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:51:42,623 INFO L87 Difference]: Start difference. First operand 334 states and 389 transitions. Second operand 12 states. [2018-02-02 20:51:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:42,860 INFO L93 Difference]: Finished difference Result 350 states and 396 transitions. [2018-02-02 20:51:42,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:51:42,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-02-02 20:51:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:42,861 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:51:42,861 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 20:51:42,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:51:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 20:51:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 282. [2018-02-02 20:51:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 20:51:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 323 transitions. [2018-02-02 20:51:42,864 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 323 transitions. Word has length 56 [2018-02-02 20:51:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:42,864 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 323 transitions. [2018-02-02 20:51:42,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:51:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 323 transitions. [2018-02-02 20:51:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:51:42,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:42,864 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:51:42,864 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash -409516024, now seen corresponding path program 1 times [2018-02-02 20:51:42,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:42,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:43,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:43,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:51:43,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:43,120 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:51:43,120 INFO L182 omatonBuilderFactory]: Interpolants [23072#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 23073#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 23074#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23075#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 23076#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 23077#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 23078#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 23079#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 23080#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)), 23081#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 23082#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 23083#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 23084#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 8) (select |#length| |main_#t~mem15.base|))), 23068#true, 23069#false, 23070#(= (select |#valid| main_~head~0.base) 1), 23071#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:51:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:43,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:51:43,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:51:43,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:51:43,121 INFO L87 Difference]: Start difference. First operand 282 states and 323 transitions. Second operand 17 states. [2018-02-02 20:51:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:43,636 INFO L93 Difference]: Finished difference Result 348 states and 394 transitions. [2018-02-02 20:51:43,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:51:43,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 20:51:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:43,637 INFO L225 Difference]: With dead ends: 348 [2018-02-02 20:51:43,637 INFO L226 Difference]: Without dead ends: 348 [2018-02-02 20:51:43,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:51:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-02 20:51:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 309. [2018-02-02 20:51:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 20:51:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 353 transitions. [2018-02-02 20:51:43,639 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 353 transitions. Word has length 56 [2018-02-02 20:51:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:43,639 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 353 transitions. [2018-02-02 20:51:43,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:51:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 353 transitions. [2018-02-02 20:51:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:51:43,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:43,640 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:43,640 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash 560689923, now seen corresponding path program 2 times [2018-02-02 20:51:43,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:43,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:43,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:43,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:51:43,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:43,923 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:51:43,923 INFO L182 omatonBuilderFactory]: Interpolants [23776#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23777#(and (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 23778#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 23779#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 23780#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23781#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23782#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 23783#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23784#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23785#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 23786#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23787#(and (= 8 (select |#length| |main_#t~mem20.base|)) (<= 0 |main_#t~mem20.offset|)), 23788#(and (= (select |#length| main_~x~0.base) 8) (<= 0 main_~x~0.offset)), 23789#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)), 23770#true, 23771#false, 23772#(= (select |#valid| main_~head~0.base) 1), 23773#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23774#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 23775#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:51:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:43,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:51:43,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:51:43,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:51:43,923 INFO L87 Difference]: Start difference. First operand 309 states and 353 transitions. Second operand 20 states. [2018-02-02 20:51:44,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:44,543 INFO L93 Difference]: Finished difference Result 401 states and 458 transitions. [2018-02-02 20:51:44,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:51:44,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-02-02 20:51:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:44,544 INFO L225 Difference]: With dead ends: 401 [2018-02-02 20:51:44,544 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 20:51:44,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:51:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 20:51:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 340. [2018-02-02 20:51:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-02 20:51:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 397 transitions. [2018-02-02 20:51:44,546 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 397 transitions. Word has length 56 [2018-02-02 20:51:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:44,546 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 397 transitions. [2018-02-02 20:51:44,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:51:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 397 transitions. [2018-02-02 20:51:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:51:44,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:44,547 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:44,547 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:44,547 INFO L82 PathProgramCache]: Analyzing trace with hash 887431852, now seen corresponding path program 1 times [2018-02-02 20:51:44,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:44,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:44,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:44,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:51:44,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:44,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:51:44,800 INFO L182 omatonBuilderFactory]: Interpolants [24576#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 24577#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 24578#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 24579#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 24580#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24581#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24582#(and (<= 0 |main_#t~mem15.offset|) (<= |main_#t~mem15.offset| 0) (= (select |#length| |main_#t~mem15.base|) 8)), 24569#true, 24570#false, 24571#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 24572#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 24573#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24574#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 24575#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))))] [2018-02-02 20:51:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:44,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:51:44,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:51:44,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:51:44,800 INFO L87 Difference]: Start difference. First operand 340 states and 397 transitions. Second operand 14 states. [2018-02-02 20:51:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:45,394 INFO L93 Difference]: Finished difference Result 382 states and 439 transitions. [2018-02-02 20:51:45,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:51:45,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-02 20:51:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:45,395 INFO L225 Difference]: With dead ends: 382 [2018-02-02 20:51:45,395 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 20:51:45,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:51:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 20:51:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 313. [2018-02-02 20:51:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-02-02 20:51:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 366 transitions. [2018-02-02 20:51:45,397 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 366 transitions. Word has length 58 [2018-02-02 20:51:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:45,397 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 366 transitions. [2018-02-02 20:51:45,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:51:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 366 transitions. [2018-02-02 20:51:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:51:45,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:45,397 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:45,398 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:45,398 INFO L82 PathProgramCache]: Analyzing trace with hash -445019962, now seen corresponding path program 1 times [2018-02-02 20:51:45,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:45,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:45,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:45,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:51:45,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:45,698 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:51:45,699 INFO L182 omatonBuilderFactory]: Interpolants [25312#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25313#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25314#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25315#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25316#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25317#(and (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 25318#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0) |main_#t~mem20.base|)) (or (not (= 0 |main_#t~mem20.base|)) (not (= 0 |main_#t~mem20.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 25319#(and (or (not (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= 0 main_~x~0.offset)) (not (= 0 main_~x~0.base)))), 25320#(and (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 25321#(and (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem22.base|))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 25322#(and (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 25323#(= 1 (select |#valid| main_~x~0.base)), 25302#true, 25303#false, 25304#(= 1 (select |#valid| main_~head~0.base)), 25305#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 25306#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 25307#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 25308#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 |main_#t~mem6.offset|)), 25309#(and (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 25310#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 25311#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:51:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:45,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:51:45,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:51:45,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:51:45,699 INFO L87 Difference]: Start difference. First operand 313 states and 366 transitions. Second operand 22 states. [2018-02-02 20:51:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:46,378 INFO L93 Difference]: Finished difference Result 384 states and 443 transitions. [2018-02-02 20:51:46,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:51:46,379 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 58 [2018-02-02 20:51:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:46,379 INFO L225 Difference]: With dead ends: 384 [2018-02-02 20:51:46,379 INFO L226 Difference]: Without dead ends: 384 [2018-02-02 20:51:46,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1719, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:51:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-02 20:51:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 370. [2018-02-02 20:51:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 20:51:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 437 transitions. [2018-02-02 20:51:46,382 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 437 transitions. Word has length 58 [2018-02-02 20:51:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:46,382 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 437 transitions. [2018-02-02 20:51:46,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:51:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 437 transitions. [2018-02-02 20:51:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:51:46,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:46,383 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:46,383 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:46,383 INFO L82 PathProgramCache]: Analyzing trace with hash -445019961, now seen corresponding path program 1 times [2018-02-02 20:51:46,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:46,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:46,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:46,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:51:46,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:46,932 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:51:46,932 INFO L182 omatonBuilderFactory]: Interpolants [26124#true, 26125#false, 26126#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 26127#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 26128#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 26129#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 26130#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 26131#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26132#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|)), 26133#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 26134#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26135#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 26136#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 26137#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 26138#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (= |main_#t~mem13.offset| 0) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))) (or (not (= |main_#t~mem13.offset| 0)) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))))), 26139#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 26140#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (and (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem19.base|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))), 26141#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (and (or (and (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select |#length| main_~x~0.base) 8))) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (or (= (select |#length| main_~x~0.base) 8) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))))), 26142#(or (and (or (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 26143#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (or (<= (+ (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0))))) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) 0)))), 26144#(or (not (= 0 main_~x~0.offset)) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 26145#(or (not (= 0 main_~head~0.offset)) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 26146#(or (not (= 0 main_~head~0.offset)) (and (<= 0 |main_#t~mem22.offset|) (<= (+ |main_#t~mem22.offset| 8) (select |#length| |main_#t~mem22.base|)))), 26147#(or (not (= 0 main_~head~0.offset)) (and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))), 26148#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 20:51:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:46,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:51:46,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:51:46,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:51:46,933 INFO L87 Difference]: Start difference. First operand 370 states and 437 transitions. Second operand 25 states. [2018-02-02 20:51:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:47,979 INFO L93 Difference]: Finished difference Result 397 states and 454 transitions. [2018-02-02 20:51:47,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:51:47,979 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-02-02 20:51:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:47,980 INFO L225 Difference]: With dead ends: 397 [2018-02-02 20:51:47,980 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 20:51:47,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=440, Invalid=2422, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:51:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 20:51:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 370. [2018-02-02 20:51:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 20:51:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 437 transitions. [2018-02-02 20:51:47,982 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 437 transitions. Word has length 58 [2018-02-02 20:51:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:47,983 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 437 transitions. [2018-02-02 20:51:47,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:51:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 437 transitions. [2018-02-02 20:51:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:51:47,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:47,983 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:47,983 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1952109060, now seen corresponding path program 2 times [2018-02-02 20:51:47,984 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:47,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:48,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:48,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:51:48,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:48,456 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:51:48,456 INFO L182 omatonBuilderFactory]: Interpolants [26974#true, 26975#false, 26976#(= 0 |main_#t~malloc0.offset|), 26977#(= main_~head~0.offset 0), 26978#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 26979#(and (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 26980#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 26981#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 26982#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 1 main_~state~0) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 26983#(and (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (or (= 1 main_~state~0) (not (= main_~head~0.offset main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 26984#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= 1 main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 26985#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 26986#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 26987#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 26988#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= main_~head~0.offset 0)), 26989#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 1 (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))), 26990#(and (= 1 (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 26991#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 26992#(and (= 1 (select (select |#memory_int| |main_#t~mem11.base|) (+ main_~head~0.offset 4))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 26993#(or (and (or (not (= 1 (select |#valid| main_~x~0.base))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4))))) (= main_~head~0.offset 0)) (= 0 (select |#valid| main_~x~0.base))), 26994#(and (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 26995#(not (= 0 (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)))), 26996#(or (<= 1 main_~x~0.offset) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (<= (+ main_~x~0.offset 1) 0)), 26997#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= 0 |main_#t~mem21|))), 26998#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 20:51:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:48,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:51:48,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:51:48,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:51:48,457 INFO L87 Difference]: Start difference. First operand 370 states and 437 transitions. Second operand 25 states. [2018-02-02 20:51:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:49,442 INFO L93 Difference]: Finished difference Result 509 states and 595 transitions. [2018-02-02 20:51:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:51:49,442 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-02-02 20:51:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:49,443 INFO L225 Difference]: With dead ends: 509 [2018-02-02 20:51:49,443 INFO L226 Difference]: Without dead ends: 508 [2018-02-02 20:51:49,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=2366, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:51:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-02-02 20:51:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 419. [2018-02-02 20:51:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-02-02 20:51:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 500 transitions. [2018-02-02 20:51:49,446 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 500 transitions. Word has length 58 [2018-02-02 20:51:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:49,446 INFO L432 AbstractCegarLoop]: Abstraction has 419 states and 500 transitions. [2018-02-02 20:51:49,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:51:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 500 transitions. [2018-02-02 20:51:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:51:49,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:49,446 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:49,446 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1952158712, now seen corresponding path program 1 times [2018-02-02 20:51:49,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:49,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:49,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:49,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:51:49,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:49,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:51:49,574 INFO L182 omatonBuilderFactory]: Interpolants [28000#(= main_~head~0.offset 0), 27985#true, 27986#false, 27987#(= (select |#valid| main_~head~0.base) 1), 27988#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27989#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 27990#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27991#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27992#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 27993#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 27994#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27995#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27996#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 27997#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 27998#(= 0 |main_#t~mem20.offset|), 27999#(= 0 main_~x~0.offset)] [2018-02-02 20:51:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:49,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:51:49,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:51:49,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:51:49,575 INFO L87 Difference]: Start difference. First operand 419 states and 500 transitions. Second operand 16 states. [2018-02-02 20:51:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:49,928 INFO L93 Difference]: Finished difference Result 437 states and 510 transitions. [2018-02-02 20:51:49,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:51:49,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-02 20:51:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:49,929 INFO L225 Difference]: With dead ends: 437 [2018-02-02 20:51:49,929 INFO L226 Difference]: Without dead ends: 437 [2018-02-02 20:51:49,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:51:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-02 20:51:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 395. [2018-02-02 20:51:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 20:51:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 464 transitions. [2018-02-02 20:51:49,932 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 464 transitions. Word has length 58 [2018-02-02 20:51:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:49,932 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 464 transitions. [2018-02-02 20:51:49,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:51:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 464 transitions. [2018-02-02 20:51:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:51:49,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:49,933 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:49,933 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:49,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1333050140, now seen corresponding path program 2 times [2018-02-02 20:51:49,933 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:49,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:50,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:50,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:51:50,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:50,159 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:51:50,160 INFO L182 omatonBuilderFactory]: Interpolants [28864#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 28865#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 28866#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 28867#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 28868#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28869#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)), 28870#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 28871#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 28872#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 28873#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 8) (select |#length| |main_#t~mem15.base|))), 28855#true, 28856#false, 28857#(= (select |#valid| main_~head~0.base) 1), 28858#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28859#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 28860#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28861#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 28862#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 28863#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:51:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:50,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:51:50,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:51:50,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:51:50,160 INFO L87 Difference]: Start difference. First operand 395 states and 464 transitions. Second operand 19 states. [2018-02-02 20:51:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:50,747 INFO L93 Difference]: Finished difference Result 460 states and 531 transitions. [2018-02-02 20:51:50,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:51:50,747 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-02-02 20:51:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:50,748 INFO L225 Difference]: With dead ends: 460 [2018-02-02 20:51:50,748 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 20:51:50,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:51:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 20:51:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 400. [2018-02-02 20:51:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-02 20:51:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 469 transitions. [2018-02-02 20:51:50,751 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 469 transitions. Word has length 58 [2018-02-02 20:51:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:50,751 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 469 transitions. [2018-02-02 20:51:50,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:51:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 469 transitions. [2018-02-02 20:51:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:51:50,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:50,751 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:50,751 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:50,751 INFO L82 PathProgramCache]: Analyzing trace with hash -722212438, now seen corresponding path program 1 times [2018-02-02 20:51:50,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:50,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:51,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:51,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:51:51,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:51,242 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:51:51,242 INFO L182 omatonBuilderFactory]: Interpolants [29762#true, 29763#false, 29764#(= 0 |main_#t~malloc0.offset|), 29765#(= main_~head~0.offset 0), 29766#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 29767#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 29768#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 29769#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 29770#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 29771#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 29772#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29773#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~state~0 0)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29774#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~state~0 0)) (= 1 (select |#valid| main_~head~0.base)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29775#(and (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 29776#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 29777#(and (not (= main_~state~0 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (= main_~head~0.offset 0)), 29778#(and (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (not (= main_~state~0 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29779#(and (= (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (not (= main_~state~0 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29780#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 29781#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_int| |main_#t~mem11.base|) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 29782#(and (or (not (= 1 (select |#valid| main_~x~0.base))) (and (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= main_~head~0.offset 0)), 29783#(not (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)) 0)), 29784#(or (<= 1 main_~x~0.offset) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (<= (+ main_~x~0.offset 1) 0)), 29785#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= |main_#t~mem21| 0))), 29786#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 20:51:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:51,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:51:51,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:51:51,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:51:51,242 INFO L87 Difference]: Start difference. First operand 400 states and 469 transitions. Second operand 25 states. [2018-02-02 20:51:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:52,264 INFO L93 Difference]: Finished difference Result 521 states and 607 transitions. [2018-02-02 20:51:52,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:51:52,264 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-02-02 20:51:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:52,265 INFO L225 Difference]: With dead ends: 521 [2018-02-02 20:51:52,265 INFO L226 Difference]: Without dead ends: 520 [2018-02-02 20:51:52,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:51:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-02-02 20:51:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 393. [2018-02-02 20:51:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-02 20:51:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 461 transitions. [2018-02-02 20:51:52,269 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 461 transitions. Word has length 59 [2018-02-02 20:51:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:52,269 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 461 transitions. [2018-02-02 20:51:52,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:51:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 461 transitions. [2018-02-02 20:51:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:51:52,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:52,269 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] [2018-02-02 20:51:52,269 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash 780080836, now seen corresponding path program 2 times [2018-02-02 20:51:52,270 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:52,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:52,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:52,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:51:52,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:52,501 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:51:52,501 INFO L182 omatonBuilderFactory]: Interpolants [30759#true, 30760#false, 30761#(= (select |#valid| main_~head~0.base) 1), 30762#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 30763#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 30764#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 30765#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30766#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 30767#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 30768#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 30769#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 30770#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30771#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)), 30772#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 30773#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 30774#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30775#(and (<= 0 |main_#t~mem19.offset|) (<= (+ |main_#t~mem19.offset| 8) (select |#length| |main_#t~mem19.base|))), 30776#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 20:51:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:52,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:51:52,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:51:52,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:51:52,501 INFO L87 Difference]: Start difference. First operand 393 states and 461 transitions. Second operand 18 states. [2018-02-02 20:51:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:53,171 INFO L93 Difference]: Finished difference Result 425 states and 487 transitions. [2018-02-02 20:51:53,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:51:53,171 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-02-02 20:51:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:53,172 INFO L225 Difference]: With dead ends: 425 [2018-02-02 20:51:53,172 INFO L226 Difference]: Without dead ends: 425 [2018-02-02 20:51:53,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:51:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-02-02 20:51:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 409. [2018-02-02 20:51:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-02 20:51:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 482 transitions. [2018-02-02 20:51:53,174 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 482 transitions. Word has length 59 [2018-02-02 20:51:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:53,174 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 482 transitions. [2018-02-02 20:51:53,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:51:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 482 transitions. [2018-02-02 20:51:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:51:53,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:53,175 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:51:53,175 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash 381373034, now seen corresponding path program 1 times [2018-02-02 20:51:53,176 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:53,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:51:53,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:53,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:51:53,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:53,508 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:51:53,508 INFO L182 omatonBuilderFactory]: Interpolants [31648#(= main_~head~0.offset 0), 31649#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31650#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 31651#(and (= main_~head~0.base |main_#t~mem11.base|) (= main_~head~0.offset |main_#t~mem11.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) |main_#t~mem11.offset|)) |main_#t~mem11.base|)), 31652#(and (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31653#(and (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem12| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31654#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31655#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem19.offset|) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base |main_#t~mem19.base|) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem19.offset|)) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31656#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (+ |main_#t~mem13.offset| 4)))) (= main_~head~0.offset 0)), 31657#(and (not (= 0 |main_#t~mem14|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 31658#(and (not |main_#t~short18|) (= main_~head~0.offset 0)), 31645#true, 31646#false, 31647#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 20:51:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:51:53,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:51:53,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:51:53,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:51:53,508 INFO L87 Difference]: Start difference. First operand 409 states and 482 transitions. Second operand 14 states. [2018-02-02 20:51:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:53,790 INFO L93 Difference]: Finished difference Result 407 states and 466 transitions. [2018-02-02 20:51:53,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:51:53,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-02-02 20:51:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:53,791 INFO L225 Difference]: With dead ends: 407 [2018-02-02 20:51:53,791 INFO L226 Difference]: Without dead ends: 407 [2018-02-02 20:51:53,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:51:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-02-02 20:51:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 399. [2018-02-02 20:51:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-02 20:51:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 466 transitions. [2018-02-02 20:51:53,793 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 466 transitions. Word has length 60 [2018-02-02 20:51:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:53,793 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 466 transitions. [2018-02-02 20:51:53,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:51:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 466 transitions. [2018-02-02 20:51:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:51:53,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:53,794 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:51:53,794 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:53,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1832550675, now seen corresponding path program 1 times [2018-02-02 20:51:53,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:53,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:54,166 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:51:54,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:54,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:51:54,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:54,166 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:51:54,167 INFO L182 omatonBuilderFactory]: Interpolants [32489#true, 32490#false, 32491#(= 0 |main_#t~malloc0.offset|), 32492#(= 0 main_~head~0.offset), 32493#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 32494#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 32495#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 32496#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 32497#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|)), 32498#(and (= 0 main_~head~0.offset) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 32499#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 32500#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 32501#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.offset|)), 32502#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))), 32503#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (= |main_#t~mem13.offset| 0) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))), 32504#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 32505#(or (and (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 32506#(or (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) 0))) (and (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (<= (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) 0))), 32507#(or (not (= 0 main_~x~0.offset)) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 32508#(or (not (= 0 main_~head~0.offset)) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 32509#(or (not (= 0 main_~head~0.offset)) (and (<= 0 |main_#t~mem22.offset|) (<= |main_#t~mem22.offset| 0))), 32510#(or (and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)) (not (= 0 main_~head~0.offset))), 32511#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset))] [2018-02-02 20:51:54,167 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:51:54,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:51:54,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:51:54,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:51:54,167 INFO L87 Difference]: Start difference. First operand 399 states and 466 transitions. Second operand 23 states. [2018-02-02 20:51:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:54,854 INFO L93 Difference]: Finished difference Result 410 states and 469 transitions. [2018-02-02 20:51:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:51:54,854 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-02-02 20:51:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:54,855 INFO L225 Difference]: With dead ends: 410 [2018-02-02 20:51:54,855 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 20:51:54,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:51:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 20:51:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 395. [2018-02-02 20:51:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 20:51:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 461 transitions. [2018-02-02 20:51:54,857 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 461 transitions. Word has length 60 [2018-02-02 20:51:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:54,857 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 461 transitions. [2018-02-02 20:51:54,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:51:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 461 transitions. [2018-02-02 20:51:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:51:54,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:54,858 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:54,858 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -876181798, now seen corresponding path program 1 times [2018-02-02 20:51:54,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:54,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:55,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:55,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:51:55,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:55,204 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:51:55,204 INFO L182 omatonBuilderFactory]: Interpolants [33376#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 33377#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 33378#(and (or (not (= 0 |main_#t~mem20.base|)) (not (= 0 |main_#t~mem20.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0))) (not (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0)))), 33379#(and (or (not (= main_~x~0.offset 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (or (not (= 0 main_~x~0.offset)) (not (= 0 main_~x~0.base)))), 33380#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 33381#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem22.base|)) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 33382#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base)) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 33383#(= 1 (select |#valid| main_~x~0.base)), 33361#true, 33362#false, 33363#(= (select |#valid| main_~head~0.base) 1), 33364#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 33365#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| 0) (= main_~x~0.base main_~head~0.base)), 33366#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 33367#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 33368#(and (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 33369#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 33370#(and (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 33371#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 33372#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 33373#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)))), 33374#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 33375#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))] [2018-02-02 20:51:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:55,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:51:55,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:51:55,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:51:55,205 INFO L87 Difference]: Start difference. First operand 395 states and 461 transitions. Second operand 23 states. [2018-02-02 20:51:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:56,281 INFO L93 Difference]: Finished difference Result 466 states and 536 transitions. [2018-02-02 20:51:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:51:56,281 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-02-02 20:51:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:56,282 INFO L225 Difference]: With dead ends: 466 [2018-02-02 20:51:56,282 INFO L226 Difference]: Without dead ends: 466 [2018-02-02 20:51:56,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=356, Invalid=2194, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 20:51:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-02-02 20:51:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 425. [2018-02-02 20:51:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 20:51:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 503 transitions. [2018-02-02 20:51:56,285 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 503 transitions. Word has length 60 [2018-02-02 20:51:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:56,285 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 503 transitions. [2018-02-02 20:51:56,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:51:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 503 transitions. [2018-02-02 20:51:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:51:56,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:56,285 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:56,285 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash -876181797, now seen corresponding path program 1 times [2018-02-02 20:51:56,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:56,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:56,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:56,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:51:56,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:56,533 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:51:56,533 INFO L182 omatonBuilderFactory]: Interpolants [34336#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 34337#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 34338#(and (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 34339#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 34340#(and (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 34341#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 34342#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 34343#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 34344#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 34345#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) 0))), 34346#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 34347#(and (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 34348#(and (or (= 8 (select |#length| |main_#t~mem22.base|)) (not (= main_~head~0.offset 0))) (or (= 0 |main_#t~mem22.offset|) (not (= main_~head~0.offset 0)))), 34349#(and (or (= (select |#length| main_~x~0.base) 8) (not (= main_~head~0.offset 0))) (or (= main_~x~0.offset 0) (not (= main_~head~0.offset 0)))), 34350#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 34331#true, 34332#false, 34333#(= (select |#valid| main_~head~0.base) 1), 34334#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 34335#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| 0) (= main_~x~0.base main_~head~0.base))] [2018-02-02 20:51:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:56,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:51:56,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:51:56,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:51:56,533 INFO L87 Difference]: Start difference. First operand 425 states and 503 transitions. Second operand 20 states. [2018-02-02 20:51:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:57,205 INFO L93 Difference]: Finished difference Result 463 states and 532 transitions. [2018-02-02 20:51:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:51:57,206 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-02-02 20:51:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:57,207 INFO L225 Difference]: With dead ends: 463 [2018-02-02 20:51:57,207 INFO L226 Difference]: Without dead ends: 463 [2018-02-02 20:51:57,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:51:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-02 20:51:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 427. [2018-02-02 20:51:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-02-02 20:51:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 505 transitions. [2018-02-02 20:51:57,209 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 505 transitions. Word has length 60 [2018-02-02 20:51:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:57,209 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 505 transitions. [2018-02-02 20:51:57,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:51:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 505 transitions. [2018-02-02 20:51:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:51:57,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:57,210 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:51:57,210 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash 751984768, now seen corresponding path program 1 times [2018-02-02 20:51:57,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:57,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:57,718 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:51:57,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:57,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:51:57,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:57,719 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:51:57,719 INFO L182 omatonBuilderFactory]: Interpolants [35267#true, 35268#false, 35269#(= 0 |main_#t~malloc0.offset|), 35270#(= main_~head~0.offset 0), 35271#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 35272#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35273#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 35274#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35275#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 35276#(and (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 35277#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35278#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35279#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 35280#(and (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 35281#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 35282#(and (not (= main_~state~0 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (= main_~head~0.offset 0)), 35283#(and (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (not (= main_~state~0 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 35284#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 35285#(and (not (= (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 35286#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 35287#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_int| |main_#t~mem11.base|) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 35288#(and (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 35289#(not (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)) 0)), 35290#(or (<= 1 main_~x~0.offset) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (<= (+ main_~x~0.offset 1) 0)), 35291#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= |main_#t~mem21| 0))), 35292#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 20:51:57,719 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:51:57,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:51:57,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:51:57,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:51:57,720 INFO L87 Difference]: Start difference. First operand 427 states and 505 transitions. Second operand 26 states. [2018-02-02 20:51:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:51:58,736 INFO L93 Difference]: Finished difference Result 583 states and 684 transitions. [2018-02-02 20:51:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:51:58,737 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-02 20:51:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:51:58,739 INFO L225 Difference]: With dead ends: 583 [2018-02-02 20:51:58,739 INFO L226 Difference]: Without dead ends: 582 [2018-02-02 20:51:58,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=508, Invalid=2462, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:51:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-02-02 20:51:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 385. [2018-02-02 20:51:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 20:51:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 450 transitions. [2018-02-02 20:51:58,742 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 450 transitions. Word has length 61 [2018-02-02 20:51:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:51:58,742 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 450 transitions. [2018-02-02 20:51:58,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:51:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 450 transitions. [2018-02-02 20:51:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:51:58,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:51:58,742 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:51:58,742 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:51:58,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1982120890, now seen corresponding path program 1 times [2018-02-02 20:51:58,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:51:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:51:58,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:51:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:59,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:51:59,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:51:59,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:51:59,074 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:51:59,074 INFO L182 omatonBuilderFactory]: Interpolants [36320#false, 36321#(= |main_#t~malloc0.offset| 0), 36322#(= main_~head~0.offset 0), 36323#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 36324#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 36325#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 36326#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 36327#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 36328#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 36329#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 36330#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 36331#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0)), 36332#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 36333#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (or (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))))), 36334#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 36335#(and (= main_~head~0.offset |main_#t~mem6.offset|) (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 36336#(or (and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 36337#(or (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)))), 36338#(or (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 36339#(= 1 (select |#valid| |main_#t~mem11.base|)), 36340#(= (select |#valid| main_~x~0.base) 1), 36319#true] [2018-02-02 20:51:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:51:59,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:51:59,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:51:59,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:51:59,075 INFO L87 Difference]: Start difference. First operand 385 states and 450 transitions. Second operand 22 states. [2018-02-02 20:52:00,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:00,354 INFO L93 Difference]: Finished difference Result 494 states and 574 transitions. [2018-02-02 20:52:00,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:52:00,354 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-02-02 20:52:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:00,355 INFO L225 Difference]: With dead ends: 494 [2018-02-02 20:52:00,355 INFO L226 Difference]: Without dead ends: 494 [2018-02-02 20:52:00,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=621, Invalid=2135, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:52:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-02-02 20:52:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 384. [2018-02-02 20:52:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-02 20:52:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 449 transitions. [2018-02-02 20:52:00,358 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 449 transitions. Word has length 61 [2018-02-02 20:52:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:00,358 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 449 transitions. [2018-02-02 20:52:00,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:52:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 449 transitions. [2018-02-02 20:52:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:52:00,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:00,358 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:52:00,358 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1982120891, now seen corresponding path program 1 times [2018-02-02 20:52:00,359 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:00,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:00,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:00,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:52:00,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:00,933 INFO L182 omatonBuilderFactory]: Interpolants [37281#true, 37282#false, 37283#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 37284#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 37285#(and (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 37286#(and (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 37287#(and (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 37288#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 37289#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 37290#(and (= 8 (select |#length| main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 37291#(and (= (select |#length| main_~x~0.base) 8) (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 37292#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 37293#(and (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 37294#(and (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 37295#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset |main_#t~malloc4.offset|) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))), 37296#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 37297#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem6.offset|)), 37298#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (or (and (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)))), 37299#(and (or (and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base)) (and (not (= main_~x~0.base main_~head~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))) (or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 37300#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 37301#(and (<= 8 (select |#length| |main_#t~mem11.base|)) (= 0 |main_#t~mem11.offset|)), 37302#(and (<= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-02-02 20:52:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:00,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:52:00,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:52:00,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:52:00,933 INFO L87 Difference]: Start difference. First operand 384 states and 449 transitions. Second operand 22 states. [2018-02-02 20:52:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:02,553 INFO L93 Difference]: Finished difference Result 412 states and 473 transitions. [2018-02-02 20:52:02,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:52:02,554 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-02-02 20:52:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:02,555 INFO L225 Difference]: With dead ends: 412 [2018-02-02 20:52:02,555 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 20:52:02,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=497, Invalid=1573, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:52:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 20:52:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 384. [2018-02-02 20:52:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-02 20:52:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 448 transitions. [2018-02-02 20:52:02,557 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 448 transitions. Word has length 61 [2018-02-02 20:52:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:02,557 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 448 transitions. [2018-02-02 20:52:02,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:52:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 448 transitions. [2018-02-02 20:52:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:52:02,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:02,558 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:52:02,558 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash 298965808, now seen corresponding path program 3 times [2018-02-02 20:52:02,558 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:02,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 20:52:02,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:02,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:52:02,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:02,595 INFO L182 omatonBuilderFactory]: Interpolants [38147#true, 38148#false, 38149#(and (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 38150#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 4))), 38151#(and (<= (+ |main_#t~mem19.offset| 8) (select |#length| |main_#t~mem19.base|)) (<= 0 (+ |main_#t~mem19.offset| 4))), 38152#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 4)))] [2018-02-02 20:52:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 20:52:02,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:52:02,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:52:02,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:52:02,595 INFO L87 Difference]: Start difference. First operand 384 states and 448 transitions. Second operand 6 states. [2018-02-02 20:52:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:02,712 INFO L93 Difference]: Finished difference Result 383 states and 441 transitions. [2018-02-02 20:52:02,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:52:02,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-02 20:52:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:02,713 INFO L225 Difference]: With dead ends: 383 [2018-02-02 20:52:02,713 INFO L226 Difference]: Without dead ends: 383 [2018-02-02 20:52:02,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:52:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-02 20:52:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 382. [2018-02-02 20:52:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 20:52:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 440 transitions. [2018-02-02 20:52:02,715 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 440 transitions. Word has length 61 [2018-02-02 20:52:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:02,715 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 440 transitions. [2018-02-02 20:52:02,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:52:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 440 transitions. [2018-02-02 20:52:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:52:02,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:02,716 INFO L351 BasicCegarLoop]: trace histogram [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:52:02,716 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:02,716 INFO L82 PathProgramCache]: Analyzing trace with hash 144612372, now seen corresponding path program 1 times [2018-02-02 20:52:02,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:02,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:52:03,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:03,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:52:03,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:03,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:52:03,499 INFO L182 omatonBuilderFactory]: Interpolants [38944#(or (not (= 0 main_~head~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|))), 38945#(or (not (= 0 main_~head~0.offset)) (and (= (store (store |#valid| main_~head~0.base 0) |main_#t~mem22.base| 0) |old(#valid)|) (not (= 0 |main_#t~mem22.base|)) (not (= |main_#t~mem22.base| main_~head~0.base)) (not (= 0 main_~head~0.base)))), 38946#(or (not (= 0 main_~head~0.offset)) (and (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~x~0.base)) (= (store (store |#valid| main_~head~0.base 0) main_~x~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.base)))), 38947#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 38926#true, 38927#false, 38928#(= |#valid| |old(#valid)|), 38929#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 38930#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 38931#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 38932#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 38933#(and (= main_~x~0.offset main_~head~0.offset) (= |old(#valid)| (store (store |#valid| |main_#t~malloc4.base| 0) main_~head~0.base 0)) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 38934#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 38935#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= 0 |main_#t~mem6.offset|)), 38936#(and (= (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 38937#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 38938#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 38939#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 38940#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 38941#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) |old(#valid)|) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 38942#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0) |main_#t~mem20.base|)) (= (store (store |#valid| |main_#t~mem20.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0) 0) |old(#valid)|) (or (not (= 0 |main_#t~mem20.base|)) (not (= 0 |main_#t~mem20.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0)))), 38943#(or (not (= 0 main_~x~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base)) (= (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))))] [2018-02-02 20:52:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:52:03,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:52:03,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:52:03,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:52:03,499 INFO L87 Difference]: Start difference. First operand 382 states and 440 transitions. Second operand 22 states. [2018-02-02 20:52:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:04,901 INFO L93 Difference]: Finished difference Result 415 states and 462 transitions. [2018-02-02 20:52:04,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:52:04,901 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2018-02-02 20:52:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:04,902 INFO L225 Difference]: With dead ends: 415 [2018-02-02 20:52:04,902 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 20:52:04,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=179, Invalid=1627, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:52:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 20:52:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 385. [2018-02-02 20:52:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 20:52:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 443 transitions. [2018-02-02 20:52:04,904 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 443 transitions. Word has length 62 [2018-02-02 20:52:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:04,904 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 443 transitions. [2018-02-02 20:52:04,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:52:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 443 transitions. [2018-02-02 20:52:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:52:04,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:04,905 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:04,905 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:04,905 INFO L82 PathProgramCache]: Analyzing trace with hash 400894122, now seen corresponding path program 2 times [2018-02-02 20:52:04,905 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:04,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:05,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:05,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:52:05,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:05,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:52:05,178 INFO L182 omatonBuilderFactory]: Interpolants [39790#true, 39791#false, 39792#(= (select |#valid| main_~head~0.base) 1), 39793#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 39794#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 39795#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 39796#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 39797#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 39798#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 39799#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 39800#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 39801#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 39802#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)))), 39803#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 39804#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 39805#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 39806#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 20:52:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:05,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:52:05,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:52:05,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:52:05,179 INFO L87 Difference]: Start difference. First operand 385 states and 443 transitions. Second operand 17 states. [2018-02-02 20:52:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:05,743 INFO L93 Difference]: Finished difference Result 399 states and 448 transitions. [2018-02-02 20:52:05,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:52:05,743 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-02-02 20:52:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:05,744 INFO L225 Difference]: With dead ends: 399 [2018-02-02 20:52:05,744 INFO L226 Difference]: Without dead ends: 399 [2018-02-02 20:52:05,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:52:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-02-02 20:52:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 385. [2018-02-02 20:52:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 20:52:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 442 transitions. [2018-02-02 20:52:05,746 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 442 transitions. Word has length 63 [2018-02-02 20:52:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:05,746 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 442 transitions. [2018-02-02 20:52:05,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:52:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 442 transitions. [2018-02-02 20:52:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:52:05,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:05,747 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:05,747 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:05,747 INFO L82 PathProgramCache]: Analyzing trace with hash 400894123, now seen corresponding path program 2 times [2018-02-02 20:52:05,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:05,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:06,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:52:06,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,014 INFO L182 omatonBuilderFactory]: Interpolants [40640#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 40641#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 40642#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 40643#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)))), 40644#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 40645#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 40646#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= 8 (select |#length| main_~x~0.base))), 40647#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 40648#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 40649#(and (= |main_#t~mem13.offset| 0) (<= 8 (select |#length| |main_#t~mem13.base|))), 40629#true, 40630#false, 40631#(= 0 |main_#t~malloc0.offset|), 40632#(= 0 main_~head~0.offset), 40633#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 40634#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 40635#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 40636#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 40637#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 40638#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 40639#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 20:52:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:06,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:52:06,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:52:06,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:52:06,014 INFO L87 Difference]: Start difference. First operand 385 states and 442 transitions. Second operand 21 states. [2018-02-02 20:52:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:06,769 INFO L93 Difference]: Finished difference Result 398 states and 447 transitions. [2018-02-02 20:52:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:52:06,769 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-02-02 20:52:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:06,770 INFO L225 Difference]: With dead ends: 398 [2018-02-02 20:52:06,770 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 20:52:06,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=1233, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:52:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 20:52:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 385. [2018-02-02 20:52:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 20:52:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 441 transitions. [2018-02-02 20:52:06,773 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 441 transitions. Word has length 63 [2018-02-02 20:52:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:06,773 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 441 transitions. [2018-02-02 20:52:06,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:52:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 441 transitions. [2018-02-02 20:52:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:52:06,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:06,774 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:52:06,774 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:06,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1581255914, now seen corresponding path program 2 times [2018-02-02 20:52:06,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:06,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:52:07,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:07,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:52:07,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:07,132 INFO L182 omatonBuilderFactory]: Interpolants [41472#(= main_~head~0.offset 0), 41473#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.offset|) (= main_~head~0.offset 0)), 41474#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 41475#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem13.offset|) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= |main_#t~mem13.offset| 0)) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)))), 41476#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 4)) |main_#t~mem14|)) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)))), 41477#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 4))) (not |main_#t~short18|)) (= main_~head~0.offset 0))), 41478#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)))), 41479#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))), 41480#(or (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|) 0)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (+ 0 4)))), 41481#(or (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 4)))), 41482#(or (not (= |main_#t~mem22.offset| 0)) (= 0 (select (select |#memory_int| |main_#t~mem22.base|) (+ 0 4)))), 41483#(or (not (= main_~x~0.offset 0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))), 41484#(or (not (= main_~x~0.offset 0)) (= 0 |main_#t~mem21|)), 41485#(or (<= (+ main_~x~0.offset 1) 0) (not (= main_~head~0.offset 0))), 41486#(not (= main_~head~0.offset 0)), 41469#true, 41470#false, 41471#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 20:52:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:52:07,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:52:07,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:52:07,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:52:07,132 INFO L87 Difference]: Start difference. First operand 385 states and 441 transitions. Second operand 18 states. [2018-02-02 20:52:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:07,768 INFO L93 Difference]: Finished difference Result 543 states and 620 transitions. [2018-02-02 20:52:07,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:52:07,769 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-02-02 20:52:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:07,770 INFO L225 Difference]: With dead ends: 543 [2018-02-02 20:52:07,770 INFO L226 Difference]: Without dead ends: 529 [2018-02-02 20:52:07,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:52:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-02 20:52:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 500. [2018-02-02 20:52:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-02-02 20:52:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 588 transitions. [2018-02-02 20:52:07,773 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 588 transitions. Word has length 64 [2018-02-02 20:52:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:07,773 INFO L432 AbstractCegarLoop]: Abstraction has 500 states and 588 transitions. [2018-02-02 20:52:07,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:52:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 588 transitions. [2018-02-02 20:52:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:52:07,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:07,773 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:07,773 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash -447320024, now seen corresponding path program 1 times [2018-02-02 20:52:07,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:07,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:08,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:08,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:52:08,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:08,256 INFO L182 omatonBuilderFactory]: Interpolants [42566#true, 42567#false, 42568#(= 0 |main_#t~malloc0.offset|), 42569#(= main_~head~0.offset 0), 42570#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 42571#(and (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 42572#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 42573#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 42574#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 1 main_~state~0) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 42575#(and (= main_~x~0.offset 0) (= 1 main_~state~0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 42576#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset 0) (= 1 main_~state~0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 42577#(and (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 main_~state~0) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 42578#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= 1 main_~state~0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 42579#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 1 main_~state~0) (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) |main_#t~mem6.base|) (= main_~head~0.offset 0)), 42580#(and (or (and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= 1 main_~state~0)) (< main_~x~0.offset main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 42581#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= 1 main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= main_~head~0.offset 0)), 42582#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 42583#(= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0)) (+ 0 4))), 42584#(= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0)) (+ 0 4))), 42585#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0)) (+ 0 4)))), 42586#(or (not (= 0 main_~head~0.offset)) (= 1 (select (select |#memory_int| |main_#t~mem22.base|) (+ 0 4)))), 42587#(or (<= 1 main_~x~0.offset) (not (= 0 main_~head~0.offset)) (<= (+ main_~x~0.offset 1) 0) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))), 42588#(or (<= 1 main_~x~0.offset) (not (= 1 (select |#valid| main_~x~0.base))) (<= (+ main_~x~0.offset 1) 0) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))), 42589#(and (or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= 0 |main_#t~mem21|))) (= (select |#valid| main_~x~0.base) 1)), 42590#(and (or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:52:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:08,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:52:08,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:52:08,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:52:08,257 INFO L87 Difference]: Start difference. First operand 500 states and 588 transitions. Second operand 25 states. [2018-02-02 20:52:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:09,185 INFO L93 Difference]: Finished difference Result 598 states and 699 transitions. [2018-02-02 20:52:09,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:52:09,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 64 [2018-02-02 20:52:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:09,186 INFO L225 Difference]: With dead ends: 598 [2018-02-02 20:52:09,186 INFO L226 Difference]: Without dead ends: 597 [2018-02-02 20:52:09,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=364, Invalid=2288, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:52:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-02-02 20:52:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 578. [2018-02-02 20:52:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-02 20:52:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 684 transitions. [2018-02-02 20:52:09,189 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 684 transitions. Word has length 64 [2018-02-02 20:52:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:09,189 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 684 transitions. [2018-02-02 20:52:09,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:52:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 684 transitions. [2018-02-02 20:52:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:52:09,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:09,190 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:09,190 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash -447270372, now seen corresponding path program 1 times [2018-02-02 20:52:09,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:09,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:09,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:09,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:52:09,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:09,432 INFO L182 omatonBuilderFactory]: Interpolants [43840#(= 0 main_~x~0.offset), 43841#(= main_~head~0.offset 0), 43821#true, 43822#false, 43823#(= (select |#valid| main_~head~0.base) 1), 43824#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 43825#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| 0) (= main_~x~0.base main_~head~0.base)), 43826#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 43827#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 43828#(and (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 43829#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 43830#(and (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 43831#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 43832#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 43833#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 43834#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 43835#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) 0)), 43836#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)), 43837#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 43838#(or (= 0 |main_#t~mem22.offset|) (not (= main_~head~0.offset 0))), 43839#(or (not (= main_~head~0.offset 0)) (= 0 main_~x~0.offset))] [2018-02-02 20:52:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:09,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:52:09,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:52:09,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:52:09,433 INFO L87 Difference]: Start difference. First operand 578 states and 684 transitions. Second operand 21 states. [2018-02-02 20:52:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:09,952 INFO L93 Difference]: Finished difference Result 607 states and 705 transitions. [2018-02-02 20:52:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:52:09,952 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-02 20:52:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:09,953 INFO L225 Difference]: With dead ends: 607 [2018-02-02 20:52:09,953 INFO L226 Difference]: Without dead ends: 593 [2018-02-02 20:52:09,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:52:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-02 20:52:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 512. [2018-02-02 20:52:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-02-02 20:52:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 600 transitions. [2018-02-02 20:52:09,957 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 600 transitions. Word has length 64 [2018-02-02 20:52:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:09,957 INFO L432 AbstractCegarLoop]: Abstraction has 512 states and 600 transitions. [2018-02-02 20:52:09,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:52:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 600 transitions. [2018-02-02 20:52:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:52:09,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:09,958 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:52:09,958 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:09,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1271736990, now seen corresponding path program 1 times [2018-02-02 20:52:09,959 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:09,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:10,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:10,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:52:10,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:10,202 INFO L182 omatonBuilderFactory]: Interpolants [44992#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 44993#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 44994#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 44995#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 44996#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 44997#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 44998#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 44999#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 45000#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 45001#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)), 45002#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 45003#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 45004#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 45005#(<= 0 |main_#t~mem19.offset|), 45006#(<= 0 main_~x~0.offset), 45007#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 44987#true, 44988#false, 44989#(= (select |#valid| main_~head~0.base) 1), 44990#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 44991#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base))] [2018-02-02 20:52:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:10,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:52:10,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:52:10,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:52:10,203 INFO L87 Difference]: Start difference. First operand 512 states and 600 transitions. Second operand 21 states. [2018-02-02 20:52:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:10,988 INFO L93 Difference]: Finished difference Result 678 states and 781 transitions. [2018-02-02 20:52:10,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:52:10,988 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-02 20:52:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:10,990 INFO L225 Difference]: With dead ends: 678 [2018-02-02 20:52:10,990 INFO L226 Difference]: Without dead ends: 678 [2018-02-02 20:52:10,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1735, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:52:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-02-02 20:52:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 540. [2018-02-02 20:52:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-02-02 20:52:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 631 transitions. [2018-02-02 20:52:10,993 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 631 transitions. Word has length 64 [2018-02-02 20:52:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:10,993 INFO L432 AbstractCegarLoop]: Abstraction has 540 states and 631 transitions. [2018-02-02 20:52:10,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:52:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 631 transitions. [2018-02-02 20:52:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:52:10,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:10,994 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:52:10,994 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1972534751, now seen corresponding path program 1 times [2018-02-02 20:52:10,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:11,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:11,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:11,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:52:11,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:11,408 INFO L182 omatonBuilderFactory]: Interpolants [46276#true, 46277#false, 46278#(= |main_#t~malloc0.offset| 0), 46279#(= main_~head~0.offset 0), 46280#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 46281#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 46282#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 46283#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 46284#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 46285#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 46286#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 46287#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 46288#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 46289#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 46290#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))), 46291#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)))), 46292#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 46293#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= main_~head~0.offset |main_#t~mem6.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 46294#(or (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 46295#(or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 46296#(or (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 46297#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 46298#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 46299#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 20:52:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:11,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:52:11,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:52:11,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:52:11,409 INFO L87 Difference]: Start difference. First operand 540 states and 631 transitions. Second operand 24 states. [2018-02-02 20:52:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:12,558 INFO L93 Difference]: Finished difference Result 691 states and 804 transitions. [2018-02-02 20:52:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:52:12,559 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-02-02 20:52:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:12,560 INFO L225 Difference]: With dead ends: 691 [2018-02-02 20:52:12,560 INFO L226 Difference]: Without dead ends: 691 [2018-02-02 20:52:12,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=452, Invalid=2304, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:52:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-02-02 20:52:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 599. [2018-02-02 20:52:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-02-02 20:52:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 700 transitions. [2018-02-02 20:52:12,565 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 700 transitions. Word has length 65 [2018-02-02 20:52:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:12,565 INFO L432 AbstractCegarLoop]: Abstraction has 599 states and 700 transitions. [2018-02-02 20:52:12,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:52:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 700 transitions. [2018-02-02 20:52:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:52:12,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:12,566 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:52:12,566 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:12,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1972534750, now seen corresponding path program 1 times [2018-02-02 20:52:12,567 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:12,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:13,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:13,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:52:13,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:13,302 INFO L182 omatonBuilderFactory]: Interpolants [47648#true, 47649#false, 47650#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 47651#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 47652#(and (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 47653#(and (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 47654#(and (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 47655#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 47656#(and (= 8 (select |#length| main_~head~0.base)) (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 47657#(and (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 47658#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 47659#(and (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 47660#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~head~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)) (= (select |#valid| main_~x~0.base) 1)), 47661#(and (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 8 (select |#length| |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47662#(and (= 8 (select |#length| main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 47663#(and (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 47664#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset |main_#t~malloc4.offset|) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) 0)) (= main_~head~0.offset 0)), 47665#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47666#(and (= 8 (select |#length| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem6.offset|)), 47667#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (or (and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)))), 47668#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0))) (or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 47669#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47670#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) 0))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) 0))), 47671#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 main_~x~0.offset)), 47672#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 47673#(and (= |main_#t~mem13.offset| 0) (= 8 (select |#length| |main_#t~mem13.base|)))] [2018-02-02 20:52:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:13,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:52:13,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:52:13,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:52:13,303 INFO L87 Difference]: Start difference. First operand 599 states and 700 transitions. Second operand 26 states. [2018-02-02 20:52:14,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:14,846 INFO L93 Difference]: Finished difference Result 696 states and 807 transitions. [2018-02-02 20:52:14,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:52:14,846 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-02-02 20:52:14,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:14,847 INFO L225 Difference]: With dead ends: 696 [2018-02-02 20:52:14,847 INFO L226 Difference]: Without dead ends: 696 [2018-02-02 20:52:14,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=491, Invalid=2265, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:52:14,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-02-02 20:52:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 599. [2018-02-02 20:52:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-02-02 20:52:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 699 transitions. [2018-02-02 20:52:14,851 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 699 transitions. Word has length 65 [2018-02-02 20:52:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:14,851 INFO L432 AbstractCegarLoop]: Abstraction has 599 states and 699 transitions. [2018-02-02 20:52:14,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:52:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 699 transitions. [2018-02-02 20:52:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:52:14,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:14,852 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:52:14,852 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1412648114, now seen corresponding path program 1 times [2018-02-02 20:52:14,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:14,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 20:52:15,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:15,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:52:15,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:15,003 INFO L182 omatonBuilderFactory]: Interpolants [49024#false, 49025#(= 0 |main_#t~malloc0.offset|), 49026#(= main_~head~0.offset 0), 49027#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 49028#(and (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.offset main_~x~0.offset))) (or (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset)) (= main_~head~0.offset 0)), 49029#(and (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.offset main_~x~0.offset))) (or (= main_~head~0.offset main_~x~0.offset) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= main_~head~0.offset 0)), 49030#(and (or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) |main_#t~mem12|) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= main_~head~0.offset 0)), 49031#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)))) (= main_~head~0.offset 0)), 49032#(or (= 0 (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4))) (not (= 0 |main_#t~mem20.offset|))), 49033#(or (not (= main_~x~0.offset 0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))), 49034#(or (not (= main_~x~0.offset 0)) (and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= |main_#t~mem21| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))))), 49035#(not (= 0 main_~head~0.offset)), 49023#true] [2018-02-02 20:52:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 20:52:15,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:52:15,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:52:15,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:52:15,004 INFO L87 Difference]: Start difference. First operand 599 states and 699 transitions. Second operand 13 states. [2018-02-02 20:52:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:15,209 INFO L93 Difference]: Finished difference Result 642 states and 737 transitions. [2018-02-02 20:52:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:52:15,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-02-02 20:52:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:15,211 INFO L225 Difference]: With dead ends: 642 [2018-02-02 20:52:15,211 INFO L226 Difference]: Without dead ends: 623 [2018-02-02 20:52:15,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:52:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-02-02 20:52:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 601. [2018-02-02 20:52:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-02-02 20:52:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 699 transitions. [2018-02-02 20:52:15,214 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 699 transitions. Word has length 65 [2018-02-02 20:52:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:15,214 INFO L432 AbstractCegarLoop]: Abstraction has 601 states and 699 transitions. [2018-02-02 20:52:15,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:52:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 699 transitions. [2018-02-02 20:52:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:52:15,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:15,215 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:15,215 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:15,215 INFO L82 PathProgramCache]: Analyzing trace with hash -769140970, now seen corresponding path program 3 times [2018-02-02 20:52:15,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:15,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:15,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:15,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:52:15,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:15,471 INFO L182 omatonBuilderFactory]: Interpolants [50304#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 50305#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 50306#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 50307#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 50308#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 50309#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 50310#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 50311#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 50312#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.offset|) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 50313#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))), 50314#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 50315#(= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 50316#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 50317#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 50318#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 50319#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 50320#(= 1 (select |#valid| |main_#t~mem13.base|)), 50301#true, 50302#false, 50303#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 20:52:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:15,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:52:15,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:52:15,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:52:15,472 INFO L87 Difference]: Start difference. First operand 601 states and 699 transitions. Second operand 20 states. [2018-02-02 20:52:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:16,247 INFO L93 Difference]: Finished difference Result 700 states and 807 transitions. [2018-02-02 20:52:16,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:52:16,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-02 20:52:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:16,249 INFO L225 Difference]: With dead ends: 700 [2018-02-02 20:52:16,249 INFO L226 Difference]: Without dead ends: 700 [2018-02-02 20:52:16,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=1363, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:52:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-02-02 20:52:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 601. [2018-02-02 20:52:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-02-02 20:52:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 695 transitions. [2018-02-02 20:52:16,252 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 695 transitions. Word has length 65 [2018-02-02 20:52:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:16,252 INFO L432 AbstractCegarLoop]: Abstraction has 601 states and 695 transitions. [2018-02-02 20:52:16,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:52:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 695 transitions. [2018-02-02 20:52:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:52:16,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:16,253 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:16,253 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:16,253 INFO L82 PathProgramCache]: Analyzing trace with hash -769140969, now seen corresponding path program 3 times [2018-02-02 20:52:16,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:16,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:16,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:16,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:52:16,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:16,628 INFO L182 omatonBuilderFactory]: Interpolants [51680#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 51681#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 51682#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 51683#(and (= |main_#t~mem13.offset| 0) (<= 8 (select |#length| |main_#t~mem13.base|))), 51662#true, 51663#false, 51664#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 51665#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 51666#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 51667#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 51668#(and (= 0 main_~head~0.offset) (= (select |#length| main_~x~0.base) 8) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 51669#(and (= 0 main_~head~0.offset) (= (select |#length| main_~x~0.base) 8) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 51670#(and (= 0 main_~head~0.offset) (<= 8 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 51671#(and (= 0 main_~head~0.offset) (<= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 51672#(and (= 0 main_~head~0.offset) (<= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 51673#(and (= 0 main_~head~0.offset) (<= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 51674#(and (= 0 main_~head~0.offset) (<= 8 (select |#length| main_~head~0.base)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 51675#(and (= 0 main_~head~0.offset) (<= 8 (select |#length| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.offset|) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 51676#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (<= 8 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))), 51677#(and (<= 8 (select |#length| main_~head~0.base)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 51678#(and (<= 8 (select |#length| main_~head~0.base)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 51679#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))] [2018-02-02 20:52:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:16,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:52:16,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:52:16,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:52:16,629 INFO L87 Difference]: Start difference. First operand 601 states and 695 transitions. Second operand 22 states. [2018-02-02 20:52:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:17,735 INFO L93 Difference]: Finished difference Result 702 states and 805 transitions. [2018-02-02 20:52:17,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:52:17,735 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-02-02 20:52:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:17,737 INFO L225 Difference]: With dead ends: 702 [2018-02-02 20:52:17,737 INFO L226 Difference]: Without dead ends: 702 [2018-02-02 20:52:17,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:52:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-02-02 20:52:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 577. [2018-02-02 20:52:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-02-02 20:52:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 666 transitions. [2018-02-02 20:52:17,740 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 666 transitions. Word has length 65 [2018-02-02 20:52:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:17,740 INFO L432 AbstractCegarLoop]: Abstraction has 577 states and 666 transitions. [2018-02-02 20:52:17,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:52:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 666 transitions. [2018-02-02 20:52:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:52:17,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:17,741 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:17,741 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2018285813, now seen corresponding path program 2 times [2018-02-02 20:52:17,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:17,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:18,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:18,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:52:18,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:18,034 INFO L182 omatonBuilderFactory]: Interpolants [53003#true, 53004#false, 53005#(= 0 |main_#t~malloc0.offset|), 53006#(= 0 main_~head~0.offset), 53007#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 53008#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 53009#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 53010#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 53011#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 53012#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 53013#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 53014#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 53015#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 53016#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 53017#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 53018#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 53019#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)), 53020#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 53021#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 53022#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 53023#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 8) (select |#length| |main_#t~mem15.base|)))] [2018-02-02 20:52:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:18,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:52:18,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:52:18,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:52:18,034 INFO L87 Difference]: Start difference. First operand 577 states and 666 transitions. Second operand 21 states. [2018-02-02 20:52:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:18,981 INFO L93 Difference]: Finished difference Result 682 states and 783 transitions. [2018-02-02 20:52:18,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:52:18,981 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-02-02 20:52:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:18,982 INFO L225 Difference]: With dead ends: 682 [2018-02-02 20:52:18,982 INFO L226 Difference]: Without dead ends: 682 [2018-02-02 20:52:18,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1611, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:52:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-02-02 20:52:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 611. [2018-02-02 20:52:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-02-02 20:52:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 703 transitions. [2018-02-02 20:52:18,987 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 703 transitions. Word has length 68 [2018-02-02 20:52:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:18,987 INFO L432 AbstractCegarLoop]: Abstraction has 611 states and 703 transitions. [2018-02-02 20:52:18,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:52:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 703 transitions. [2018-02-02 20:52:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:52:18,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:18,987 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:52:18,987 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:18,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1235115106, now seen corresponding path program 1 times [2018-02-02 20:52:18,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:18,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:52:19,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:19,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:52:19,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:19,297 INFO L182 omatonBuilderFactory]: Interpolants [54368#(= main_~head~0.offset 0), 54369#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem11.offset|) (= main_~head~0.offset 0)), 54370#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 54371#(and (or (and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem13.offset|) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset |main_#t~mem13.offset|)) (or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.offset |main_#t~mem13.offset|))) (= main_~head~0.offset 0)), 54372#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem14| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 4))))) (= main_~head~0.offset 0)), 54373#(and (or |main_#t~short18| (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 4)))))) (= main_~head~0.offset 0)), 54374#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 4)))))) (= main_~head~0.offset 0)), 54375#(and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (and (= |main_#t~mem19.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_int| |main_#t~mem19.base|) (+ main_~head~0.offset 4)))))) (= main_~head~0.offset 0)), 54376#(and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))) (= main_~head~0.offset main_~x~0.offset))) (= main_~head~0.offset 0)), 54377#(and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= 0 |main_#t~mem12|))) (= main_~head~0.offset 0)), 54378#(and (= main_~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))), 54379#(not (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 54380#(not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)), 54381#(not (= 0 |main_#t~mem22.offset|)), 54382#(not (= 0 main_~x~0.offset)), 54383#(not (= main_~head~0.offset 0)), 54365#true, 54366#false, 54367#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 20:52:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:52:19,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:19,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:19,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:19,298 INFO L87 Difference]: Start difference. First operand 611 states and 703 transitions. Second operand 19 states. [2018-02-02 20:52:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:19,907 INFO L93 Difference]: Finished difference Result 721 states and 815 transitions. [2018-02-02 20:52:19,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:52:19,907 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2018-02-02 20:52:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:19,909 INFO L225 Difference]: With dead ends: 721 [2018-02-02 20:52:19,909 INFO L226 Difference]: Without dead ends: 695 [2018-02-02 20:52:19,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:52:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-02-02 20:52:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 634. [2018-02-02 20:52:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-02-02 20:52:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 729 transitions. [2018-02-02 20:52:19,915 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 729 transitions. Word has length 68 [2018-02-02 20:52:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:19,915 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 729 transitions. [2018-02-02 20:52:19,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 729 transitions. [2018-02-02 20:52:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:52:19,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:19,916 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:19,916 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:19,916 INFO L82 PathProgramCache]: Analyzing trace with hash 705341638, now seen corresponding path program 1 times [2018-02-02 20:52:19,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:19,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:20,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:20,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:52:20,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:20,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:52:20,603 INFO L182 omatonBuilderFactory]: Interpolants [55808#(and (or (not (= 1 (select |#valid| main_~x~0.base))) (and (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= main_~head~0.offset 0)), 55809#(not (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)) 0)), 55810#(or (<= 1 main_~x~0.offset) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (<= (+ main_~x~0.offset 1) 0)), 55811#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= |main_#t~mem21| 0))), 55812#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 55783#true, 55784#false, 55785#(= 0 |main_#t~malloc0.offset|), 55786#(= main_~head~0.offset 0), 55787#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 55788#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 55789#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 55790#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 55791#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 55792#(and (or (and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.offset main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset 0)), 55793#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 55794#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~state~0 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 55795#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 55796#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= main_~head~0.offset 0)), 55797#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~state~0 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~state~0) (= main_~head~0.offset main_~x~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 55798#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~state~0 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (= main_~head~0.offset 0)), 55799#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) main_~state~0) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~state~0 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 55800#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 55801#(and (not (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 55802#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 55803#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 55804#(and (not (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 55805#(and (not (= (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 55806#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 55807#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_int| |main_#t~mem11.base|) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0))] [2018-02-02 20:52:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:20,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:52:20,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:52:20,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:52:20,604 INFO L87 Difference]: Start difference. First operand 634 states and 729 transitions. Second operand 30 states. [2018-02-02 20:52:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:22,019 INFO L93 Difference]: Finished difference Result 1068 states and 1229 transitions. [2018-02-02 20:52:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:52:22,020 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 70 [2018-02-02 20:52:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:22,021 INFO L225 Difference]: With dead ends: 1068 [2018-02-02 20:52:22,022 INFO L226 Difference]: Without dead ends: 1062 [2018-02-02 20:52:22,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=643, Invalid=3389, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 20:52:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-02-02 20:52:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 783. [2018-02-02 20:52:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-02-02 20:52:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 907 transitions. [2018-02-02 20:52:22,028 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 907 transitions. Word has length 70 [2018-02-02 20:52:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:22,028 INFO L432 AbstractCegarLoop]: Abstraction has 783 states and 907 transitions. [2018-02-02 20:52:22,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:52:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 907 transitions. [2018-02-02 20:52:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:52:22,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:22,029 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:22,029 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:22,029 INFO L82 PathProgramCache]: Analyzing trace with hash 86282718, now seen corresponding path program 1 times [2018-02-02 20:52:22,029 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:22,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:52:22,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:52:22,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:52:22,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,064 INFO L182 omatonBuilderFactory]: Interpolants [57732#true, 57733#false, 57734#(and (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 57735#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 4))), 57736#(and (<= 0 (+ |main_#t~mem15.offset| 4)) (<= (+ |main_#t~mem15.offset| 8) (select |#length| |main_#t~mem15.base|)))] [2018-02-02 20:52:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:52:22,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:52:22,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:52:22,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:52:22,064 INFO L87 Difference]: Start difference. First operand 783 states and 907 transitions. Second operand 5 states. [2018-02-02 20:52:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:22,128 INFO L93 Difference]: Finished difference Result 790 states and 904 transitions. [2018-02-02 20:52:22,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:52:22,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-02-02 20:52:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:22,130 INFO L225 Difference]: With dead ends: 790 [2018-02-02 20:52:22,130 INFO L226 Difference]: Without dead ends: 790 [2018-02-02 20:52:22,130 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:52:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-02-02 20:52:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 754. [2018-02-02 20:52:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-02-02 20:52:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 866 transitions. [2018-02-02 20:52:22,134 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 866 transitions. Word has length 70 [2018-02-02 20:52:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:22,134 INFO L432 AbstractCegarLoop]: Abstraction has 754 states and 866 transitions. [2018-02-02 20:52:22,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:52:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 866 transitions. [2018-02-02 20:52:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:52:22,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:22,135 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:22,135 INFO L371 AbstractCegarLoop]: === Iteration 84 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:22,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1918427490, now seen corresponding path program 1 times [2018-02-02 20:52:22,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:22,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:22,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:52:22,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,311 INFO L182 omatonBuilderFactory]: Interpolants [59296#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 59297#(= 0 |main_#t~mem19.offset|), 59298#(= main_~x~0.offset 0), 59299#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 59285#true, 59286#false, 59287#(= 0 |main_#t~malloc0.offset|), 59288#(= main_~head~0.offset 0), 59289#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 59290#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 59291#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 59292#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 59293#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 59294#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 59295#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))] [2018-02-02 20:52:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:22,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:52:22,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:52:22,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:52:22,311 INFO L87 Difference]: Start difference. First operand 754 states and 866 transitions. Second operand 15 states. [2018-02-02 20:52:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:22,633 INFO L93 Difference]: Finished difference Result 785 states and 894 transitions. [2018-02-02 20:52:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:52:22,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-02-02 20:52:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:22,634 INFO L225 Difference]: With dead ends: 785 [2018-02-02 20:52:22,634 INFO L226 Difference]: Without dead ends: 785 [2018-02-02 20:52:22,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:52:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-02-02 20:52:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 769. [2018-02-02 20:52:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-02-02 20:52:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 881 transitions. [2018-02-02 20:52:22,640 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 881 transitions. Word has length 72 [2018-02-02 20:52:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:22,640 INFO L432 AbstractCegarLoop]: Abstraction has 769 states and 881 transitions. [2018-02-02 20:52:22,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:52:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 881 transitions. [2018-02-02 20:52:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:52:22,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:22,641 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:22,641 INFO L371 AbstractCegarLoop]: === Iteration 85 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash 603724741, now seen corresponding path program 3 times [2018-02-02 20:52:22,641 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:22,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:23,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:23,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:52:23,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:23,203 INFO L182 omatonBuilderFactory]: Interpolants [60884#true, 60885#false, 60886#(= 0 |main_#t~malloc0.offset|), 60887#(= main_~head~0.offset 0), 60888#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 60889#(and (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 60890#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 60891#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) main_~state~0) (= (select |#valid| main_~x~0.base) 1)), 60892#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem6.offset|) (= main_~state~0 1) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 60893#(and (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~state~0 1) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 60894#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~state~0 1) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 60895#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 1) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 60896#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 1) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 60897#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 1) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 60898#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 60899#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 1)), 60900#(and (not (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 60901#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 60902#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 60903#(and (not (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 60904#(and (not (= (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 60905#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 60906#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_int| |main_#t~mem11.base|) (+ main_~head~0.offset 4)) 0)) (= main_~head~0.offset 0)), 60907#(and (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 4)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 60908#(not (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 4)) 0)), 60909#(or (<= 1 main_~x~0.offset) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)) (<= (+ main_~x~0.offset 1) 0)), 60910#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= |main_#t~mem21| 0))), 60911#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 20:52:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:23,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:52:23,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:52:23,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:52:23,203 INFO L87 Difference]: Start difference. First operand 769 states and 881 transitions. Second operand 28 states. [2018-02-02 20:52:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:24,342 INFO L93 Difference]: Finished difference Result 919 states and 1042 transitions. [2018-02-02 20:52:24,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:52:24,343 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2018-02-02 20:52:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:24,343 INFO L225 Difference]: With dead ends: 919 [2018-02-02 20:52:24,344 INFO L226 Difference]: Without dead ends: 913 [2018-02-02 20:52:24,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=552, Invalid=2870, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:52:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-02-02 20:52:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 618. [2018-02-02 20:52:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-02-02 20:52:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 700 transitions. [2018-02-02 20:52:24,348 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 700 transitions. Word has length 72 [2018-02-02 20:52:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:24,348 INFO L432 AbstractCegarLoop]: Abstraction has 618 states and 700 transitions. [2018-02-02 20:52:24,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:52:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 700 transitions. [2018-02-02 20:52:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:52:24,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:24,349 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:24,349 INFO L371 AbstractCegarLoop]: === Iteration 86 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash -658289898, now seen corresponding path program 1 times [2018-02-02 20:52:24,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:24,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:24,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:24,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:52:24,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:24,522 INFO L182 omatonBuilderFactory]: Interpolants [62511#true, 62512#false, 62513#(= 0 |main_#t~malloc0.offset|), 62514#(= main_~head~0.offset 0), 62515#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 62516#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 62517#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 62518#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))))), 62519#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 62520#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 62521#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 62522#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)))), 62523#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 62524#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 62525#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 62526#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 20:52:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:24,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:52:24,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:52:24,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:52:24,523 INFO L87 Difference]: Start difference. First operand 618 states and 700 transitions. Second operand 16 states. [2018-02-02 20:52:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:25,091 INFO L93 Difference]: Finished difference Result 633 states and 712 transitions. [2018-02-02 20:52:25,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:52:25,092 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2018-02-02 20:52:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:25,093 INFO L225 Difference]: With dead ends: 633 [2018-02-02 20:52:25,093 INFO L226 Difference]: Without dead ends: 633 [2018-02-02 20:52:25,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:52:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-02-02 20:52:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 619. [2018-02-02 20:52:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-02-02 20:52:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 702 transitions. [2018-02-02 20:52:25,098 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 702 transitions. Word has length 73 [2018-02-02 20:52:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:25,098 INFO L432 AbstractCegarLoop]: Abstraction has 619 states and 702 transitions. [2018-02-02 20:52:25,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:52:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 702 transitions. [2018-02-02 20:52:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:52:25,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:25,099 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:25,099 INFO L371 AbstractCegarLoop]: === Iteration 87 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:25,099 INFO L82 PathProgramCache]: Analyzing trace with hash -658289897, now seen corresponding path program 1 times [2018-02-02 20:52:25,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:25,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:25,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:25,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:52:25,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:25,330 INFO L182 omatonBuilderFactory]: Interpolants [63815#true, 63816#false, 63817#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 63818#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 63819#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 63820#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~x~0.offset 4)))), 63821#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))))), 63822#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))))), 63823#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 63824#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 63825#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 63826#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 63827#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 63828#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 63829#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0))] [2018-02-02 20:52:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:25,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:52:25,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:52:25,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:52:25,331 INFO L87 Difference]: Start difference. First operand 619 states and 702 transitions. Second operand 15 states. [2018-02-02 20:52:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:25,867 INFO L93 Difference]: Finished difference Result 635 states and 714 transitions. [2018-02-02 20:52:25,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:52:25,867 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-02-02 20:52:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:25,868 INFO L225 Difference]: With dead ends: 635 [2018-02-02 20:52:25,868 INFO L226 Difference]: Without dead ends: 635 [2018-02-02 20:52:25,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:52:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-02-02 20:52:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 619. [2018-02-02 20:52:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-02-02 20:52:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 701 transitions. [2018-02-02 20:52:25,871 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 701 transitions. Word has length 73 [2018-02-02 20:52:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:25,871 INFO L432 AbstractCegarLoop]: Abstraction has 619 states and 701 transitions. [2018-02-02 20:52:25,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:52:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 701 transitions. [2018-02-02 20:52:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:52:25,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:25,871 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:25,871 INFO L371 AbstractCegarLoop]: === Iteration 88 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash 941173883, now seen corresponding path program 2 times [2018-02-02 20:52:25,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:25,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:26,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:26,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:52:26,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:26,143 INFO L182 omatonBuilderFactory]: Interpolants [65120#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 65121#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 65122#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))), 65123#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 65124#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 65125#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 65126#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)), 65127#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 65128#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 65129#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 65130#(<= 0 |main_#t~mem19.offset|), 65131#(<= 0 main_~x~0.offset), 65132#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 65110#true, 65111#false, 65112#(= 0 |main_#t~malloc0.offset|), 65113#(= 0 main_~head~0.offset), 65114#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 65115#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 65116#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 65117#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 65118#(and (= 0 main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 65119#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:52:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:26,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:52:26,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:52:26,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:52:26,143 INFO L87 Difference]: Start difference. First operand 619 states and 701 transitions. Second operand 23 states. [2018-02-02 20:52:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:27,315 INFO L93 Difference]: Finished difference Result 765 states and 861 transitions. [2018-02-02 20:52:27,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:52:27,350 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-02-02 20:52:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:27,351 INFO L225 Difference]: With dead ends: 765 [2018-02-02 20:52:27,351 INFO L226 Difference]: Without dead ends: 765 [2018-02-02 20:52:27,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=739, Invalid=2921, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:52:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-02-02 20:52:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 664. [2018-02-02 20:52:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-02-02 20:52:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 753 transitions. [2018-02-02 20:52:27,354 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 753 transitions. Word has length 74 [2018-02-02 20:52:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:27,354 INFO L432 AbstractCegarLoop]: Abstraction has 664 states and 753 transitions. [2018-02-02 20:52:27,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:52:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 753 transitions. [2018-02-02 20:52:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:52:27,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:27,355 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:27,355 INFO L371 AbstractCegarLoop]: === Iteration 89 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash -888380643, now seen corresponding path program 4 times [2018-02-02 20:52:27,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:27,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:27,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:27,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:52:27,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:27,607 INFO L182 omatonBuilderFactory]: Interpolants [66656#(= 1 (select |#valid| |main_#t~mem13.base|)), 66639#false, 66638#true, 66641#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 66640#(= (select |#valid| main_~head~0.base) 1), 66643#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 66642#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 66645#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 66644#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 66647#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 66646#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 66649#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 66648#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))))), 66651#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 66650#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 66653#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 66652#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)))), 66655#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 66654#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)))] [2018-02-02 20:52:27,607 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:27,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:27,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:27,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:27,607 INFO L87 Difference]: Start difference. First operand 664 states and 753 transitions. Second operand 19 states. [2018-02-02 20:52:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:28,299 INFO L93 Difference]: Finished difference Result 739 states and 834 transitions. [2018-02-02 20:52:28,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:52:28,300 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-02-02 20:52:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:28,300 INFO L225 Difference]: With dead ends: 739 [2018-02-02 20:52:28,300 INFO L226 Difference]: Without dead ends: 739 [2018-02-02 20:52:28,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:52:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-02-02 20:52:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 664. [2018-02-02 20:52:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-02-02 20:52:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 751 transitions. [2018-02-02 20:52:28,303 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 751 transitions. Word has length 75 [2018-02-02 20:52:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:28,304 INFO L432 AbstractCegarLoop]: Abstraction has 664 states and 751 transitions. [2018-02-02 20:52:28,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 751 transitions. [2018-02-02 20:52:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:52:28,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:28,304 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:28,304 INFO L371 AbstractCegarLoop]: === Iteration 90 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:28,304 INFO L82 PathProgramCache]: Analyzing trace with hash -888380642, now seen corresponding path program 4 times [2018-02-02 20:52:28,305 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:28,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:28,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:28,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:52:28,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:28,665 INFO L182 omatonBuilderFactory]: Interpolants [68103#false, 68102#true, 68105#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 68104#(= (select |#valid| main_~head~0.base) 1), 68107#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 68106#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 68109#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 68108#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 68111#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 68110#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 68113#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 68112#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) |main_#t~mem11.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)))), 68115#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 68114#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 68117#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 68116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))))), 68119#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 68118#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 68120#(and (= (select |#length| |main_#t~mem13.base|) 8) (= |main_#t~mem13.offset| 0))] [2018-02-02 20:52:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:28,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:52:28,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:52:28,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:52:28,665 INFO L87 Difference]: Start difference. First operand 664 states and 751 transitions. Second operand 19 states. [2018-02-02 20:52:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:52:29,379 INFO L93 Difference]: Finished difference Result 738 states and 832 transitions. [2018-02-02 20:52:29,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:52:29,379 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-02-02 20:52:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:52:29,380 INFO L225 Difference]: With dead ends: 738 [2018-02-02 20:52:29,380 INFO L226 Difference]: Without dead ends: 738 [2018-02-02 20:52:29,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:52:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-02-02 20:52:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 651. [2018-02-02 20:52:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-02-02 20:52:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 736 transitions. [2018-02-02 20:52:29,383 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 736 transitions. Word has length 75 [2018-02-02 20:52:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:52:29,383 INFO L432 AbstractCegarLoop]: Abstraction has 651 states and 736 transitions. [2018-02-02 20:52:29,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:52:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 736 transitions. [2018-02-02 20:52:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:52:29,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:52:29,384 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:52:29,384 INFO L371 AbstractCegarLoop]: === Iteration 91 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:52:29,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1230826844, now seen corresponding path program 1 times [2018-02-02 20:52:29,384 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:52:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:52:29,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:52:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:29,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:52:29,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:52:29,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:52:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:29,913 INFO L182 omatonBuilderFactory]: Interpolants [69569#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 69568#(<= 0 main_~x~0.offset), 69543#false, 69542#true, 69545#(= main_~head~0.offset 0), 69544#(= |main_#t~malloc0.offset| 0), 69547#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 69546#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 69549#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 69548#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 69551#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 69550#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 69553#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 69552#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 69555#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= main_~head~0.offset 0)), 69554#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 69557#(and (= 0 main_~head~0.offset) (= main_~head~0.offset |main_#t~malloc4.offset|) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)))), 69556#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 69559#(and (= 0 main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= main_~head~0.offset |main_#t~mem6.offset|)), 69558#(and (= 0 main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 69561#(or (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)))), 69560#(or (and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)))), 69563#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) |main_#t~mem11.offset|)), 69562#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 69565#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 69564#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 69567#(<= 0 |main_#t~mem19.offset|), 69566#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))] [2018-02-02 20:52:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:52:29,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:52:29,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:52:29,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:52:29,914 INFO L87 Difference]: Start difference. First operand 651 states and 736 transitions. Second operand 28 states. Received shutdown request... [2018-02-02 20:52:30,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:52:30,966 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:52:30,969 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:52:30,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:52:30 BoogieIcfgContainer [2018-02-02 20:52:30,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:52:30,970 INFO L168 Benchmark]: Toolchain (without parser) took 73375.85 ms. Allocated memory was 408.9 MB in the beginning and 1.3 GB in the end (delta: 938.5 MB). Free memory was 363.0 MB in the beginning and 924.8 MB in the end (delta: -561.8 MB). Peak memory consumption was 376.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:52:30,970 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 408.9 MB. Free memory is still 369.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:52:30,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.65 ms. Allocated memory is still 408.9 MB. Free memory was 363.0 MB in the beginning and 351.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:52:30,971 INFO L168 Benchmark]: Boogie Preprocessor took 30.39 ms. Allocated memory is still 408.9 MB. Free memory was 351.1 MB in the beginning and 349.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:52:30,971 INFO L168 Benchmark]: RCFGBuilder took 311.68 ms. Allocated memory is still 408.9 MB. Free memory was 349.8 MB in the beginning and 318.0 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. [2018-02-02 20:52:30,971 INFO L168 Benchmark]: TraceAbstraction took 72873.15 ms. Allocated memory was 408.9 MB in the beginning and 1.3 GB in the end (delta: 938.5 MB). Free memory was 318.0 MB in the beginning and 924.8 MB in the end (delta: -606.7 MB). Peak memory consumption was 331.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:52:30,972 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.14 ms. Allocated memory is still 408.9 MB. Free memory is still 369.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.65 ms. Allocated memory is still 408.9 MB. Free memory was 363.0 MB in the beginning and 351.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.39 ms. Allocated memory is still 408.9 MB. Free memory was 351.1 MB in the beginning and 349.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 311.68 ms. Allocated memory is still 408.9 MB. Free memory was 349.8 MB in the beginning and 318.0 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 72873.15 ms. Allocated memory was 408.9 MB in the beginning and 1.3 GB in the end (delta: 938.5 MB). Free memory was 318.0 MB in the beginning and 924.8 MB in the end (delta: -606.7 MB). Peak memory consumption was 331.7 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 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 30 states, 28 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 103 locations, 41 error locations. TIMEOUT Result, 72.8s OverallTime, 91 OverallIterations, 4 TraceHistogramMax, 49.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6671 SDtfs, 30252 SDslu, 51282 SDs, 0 SdLazy, 55068 SolverSat, 4407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2892 GetRequests, 185 SyntacticMatches, 147 SemanticMatches, 2559 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18198 ImplicationChecksByTransitivity, 40.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=783occurred in iteration=82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 152/1539 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, 90 MinimizatonAttempts, 4477 StatesRemovedByMinimization, 90 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 4518 NumberOfCodeBlocks, 4518 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 4427 ConstructedInterpolants, 0 QuantifiedInterpolants, 5683542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 91 InterpolantComputations, 24 PerfectInterpolantSequences, 152/1539 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-52-30-977.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-52-30-977.csv Completed graceful shutdown