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/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:18:01,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:18:01,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:18:01,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:18:01,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:18:01,367 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:18:01,368 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:18:01,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:18:01,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:18:01,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:18:01,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:18:01,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:18:01,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:18:01,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:18:01,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:18:01,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:18:01,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:18:01,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:18:01,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:18:01,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:18:01,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:18:01,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:18:01,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:18:01,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:18:01,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:18:01,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:18:01,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:18:01,387 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:18:01,387 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:18:01,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:18:01,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:18:01,388 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:18:01,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:18:01,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:18:01,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:18:01,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:18:01,399 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:18:01,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:18:01,399 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:18:01,399 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:18:01,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:18:01,400 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:18:01,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:18:01,400 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:18:01,400 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:18:01,400 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:18:01,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:18:01,401 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:18:01,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:18:01,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:18:01,401 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:18:01,401 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:18:01,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:18:01,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:18:01,402 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:18:01,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:18:01,438 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:18:01,441 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:18:01,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:18:01,445 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:18:01,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-02-02 20:18:01,575 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:18:01,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:18:01,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:18:01,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:18:01,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:18:01,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:18:01" (1/1) ... [2018-02-02 20:18:01,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a0ca9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01, skipping insertion in model container [2018-02-02 20:18:01,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:18:01" (1/1) ... [2018-02-02 20:18:01,593 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:18:01,620 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:18:01,712 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:18:01,729 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:18:01,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01 WrapperNode [2018-02-02 20:18:01,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:18:01,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:18:01,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:18:01,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:18:01,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01" (1/1) ... [2018-02-02 20:18:01,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01" (1/1) ... [2018-02-02 20:18:01,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01" (1/1) ... [2018-02-02 20:18:01,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01" (1/1) ... [2018-02-02 20:18:01,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01" (1/1) ... [2018-02-02 20:18:01,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01" (1/1) ... [2018-02-02 20:18:01,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01" (1/1) ... [2018-02-02 20:18:01,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:18:01,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:18:01,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:18:01,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:18:01,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01" (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:18:01,803 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:18:01,803 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:18:01,803 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 20:18:01,803 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:18:01,803 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:18:01,803 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:18:01,803 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:18:01,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:18:02,192 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:18:02,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:18:02 BoogieIcfgContainer [2018-02-02 20:18:02,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:18:02,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:18:02,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:18:02,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:18:02,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:18:01" (1/3) ... [2018-02-02 20:18:02,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d09616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:18:02, skipping insertion in model container [2018-02-02 20:18:02,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:18:01" (2/3) ... [2018-02-02 20:18:02,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d09616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:18:02, skipping insertion in model container [2018-02-02 20:18:02,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:18:02" (3/3) ... [2018-02-02 20:18:02,199 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-02-02 20:18:02,207 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:18:02,213 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-02-02 20:18:02,248 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:18:02,249 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:18:02,249 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:18:02,249 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:18:02,249 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:18:02,249 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:18:02,249 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:18:02,250 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:18:02,250 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:18:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-02-02 20:18:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:18:02,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:02,273 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:02,273 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2135487731, now seen corresponding path program 1 times [2018-02-02 20:18:02,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:02,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:02,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:02,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:18:02,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:02,398 INFO L182 omatonBuilderFactory]: Interpolants [102#true, 103#false] [2018-02-02 20:18:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:02,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 20:18:02,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 20:18:02,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:18:02,414 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2018-02-02 20:18:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:02,505 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-02 20:18:02,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 20:18:02,507 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-02 20:18:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:02,515 INFO L225 Difference]: With dead ends: 99 [2018-02-02 20:18:02,516 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 20:18:02,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:18:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 20:18:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-02-02 20:18:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 20:18:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-02-02 20:18:02,551 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 13 [2018-02-02 20:18:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:02,552 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-02-02 20:18:02,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 20:18:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-02-02 20:18:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:18:02,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:02,552 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:02,553 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:02,553 INFO L82 PathProgramCache]: Analyzing trace with hash 757106509, now seen corresponding path program 1 times [2018-02-02 20:18:02,554 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:02,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:02,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:02,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:18:02,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:02,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:18:02,614 INFO L182 omatonBuilderFactory]: Interpolants [293#true, 294#false, 295#(= 1 (select |#valid| |main_#t~malloc0.base|)), 296#(= 1 (select |#valid| main_~a~0.base)), 297#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:18:02,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:18:02,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:18:02,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:18:02,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:18:02,616 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 5 states. [2018-02-02 20:18:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:02,802 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-02-02 20:18:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:18:02,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:18:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:02,804 INFO L225 Difference]: With dead ends: 111 [2018-02-02 20:18:02,804 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 20:18:02,805 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:18:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 20:18:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-02-02 20:18:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 20:18:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-02 20:18:02,813 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-02 20:18:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:02,813 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-02 20:18:02,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:18:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-02 20:18:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:18:02,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:02,814 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:02,814 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash 757106510, now seen corresponding path program 1 times [2018-02-02 20:18:02,815 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:02,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:02,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:02,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:18:02,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:02,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:18:02,904 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 513#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 514#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 510#true, 511#false] [2018-02-02 20:18:02,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:18:02,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:18:02,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:18:02,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:18:02,905 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 5 states. [2018-02-02 20:18:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:03,134 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2018-02-02 20:18:03,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:18:03,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:18:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:03,135 INFO L225 Difference]: With dead ends: 130 [2018-02-02 20:18:03,135 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:18:03,135 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:18:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:18:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2018-02-02 20:18:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:18:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2018-02-02 20:18:03,141 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 15 [2018-02-02 20:18:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:03,141 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2018-02-02 20:18:03,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:18:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2018-02-02 20:18:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:18:03,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:03,142 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:03,142 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:03,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918817, now seen corresponding path program 1 times [2018-02-02 20:18:03,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:03,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:03,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:03,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:18:03,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:03,208 INFO L182 omatonBuilderFactory]: Interpolants [768#true, 769#false, 770#(= 1 (select |#valid| |main_#t~malloc5.base|)), 771#(= 1 (select |#valid| main_~t~0.base)), 772#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 773#(= 1 (select |#valid| |main_#t~mem7.base|)), 774#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:18:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:03,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:18:03,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:18:03,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:18:03,209 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand 7 states. [2018-02-02 20:18:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:03,495 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2018-02-02 20:18:03,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:18:03,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 20:18:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:03,498 INFO L225 Difference]: With dead ends: 226 [2018-02-02 20:18:03,498 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 20:18:03,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:18:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 20:18:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 124. [2018-02-02 20:18:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 20:18:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-02-02 20:18:03,505 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 26 [2018-02-02 20:18:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:03,506 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-02-02 20:18:03,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:18:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-02-02 20:18:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:18:03,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:03,506 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] [2018-02-02 20:18:03,506 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918818, now seen corresponding path program 1 times [2018-02-02 20:18:03,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:03,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:03,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:03,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:18:03,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:03,627 INFO L182 omatonBuilderFactory]: Interpolants [1136#true, 1137#false, 1138#(and (= 0 |main_#t~malloc5.offset|) (= 8 (select |#length| |main_#t~malloc5.base|))), 1139#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 1140#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 1141#(and (= 8 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 1142#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:18:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:03,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:18:03,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:18:03,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:18:03,628 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 7 states. [2018-02-02 20:18:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:03,893 INFO L93 Difference]: Finished difference Result 242 states and 271 transitions. [2018-02-02 20:18:03,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:18:03,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 20:18:03,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:03,894 INFO L225 Difference]: With dead ends: 242 [2018-02-02 20:18:03,894 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 20:18:03,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:18:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 20:18:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 105. [2018-02-02 20:18:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 20:18:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-02 20:18:03,899 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 26 [2018-02-02 20:18:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:03,899 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-02 20:18:03,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:18:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-02 20:18:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:18:03,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:03,900 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] [2018-02-02 20:18:03,900 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:03,900 INFO L82 PathProgramCache]: Analyzing trace with hash 317364595, now seen corresponding path program 1 times [2018-02-02 20:18:03,901 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:03,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:03,944 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:18:03,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:03,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:18:03,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:03,946 INFO L182 omatonBuilderFactory]: Interpolants [1505#true, 1506#false, 1507#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1508#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 1509#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 1510#(= |main_#t~mem16| 3)] [2018-02-02 20:18:03,946 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:18:03,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:18:03,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:18:03,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:18:03,947 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2018-02-02 20:18:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:04,073 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2018-02-02 20:18:04,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:18:04,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-02 20:18:04,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:04,074 INFO L225 Difference]: With dead ends: 187 [2018-02-02 20:18:04,074 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 20:18:04,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:18:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 20:18:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 118. [2018-02-02 20:18:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 20:18:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2018-02-02 20:18:04,081 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 27 [2018-02-02 20:18:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:04,081 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2018-02-02 20:18:04,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:18:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2018-02-02 20:18:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:18:04,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:04,082 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] [2018-02-02 20:18:04,082 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash 135192649, now seen corresponding path program 1 times [2018-02-02 20:18:04,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:04,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:04,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:04,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:18:04,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:04,164 INFO L182 omatonBuilderFactory]: Interpolants [1824#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 1825#(= 1 (select |#valid| |main_#t~mem14.base|)), 1826#(= 1 (select |#valid| main_~p~0.base)), 1820#true, 1821#false, 1822#(= 1 (select |#valid| |main_#t~malloc12.base|)), 1823#(= 1 (select |#valid| main_~t~0.base))] [2018-02-02 20:18:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:04,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:18:04,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:18:04,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:18:04,165 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand 7 states. [2018-02-02 20:18:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:04,312 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-02-02 20:18:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:18:04,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 20:18:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:04,313 INFO L225 Difference]: With dead ends: 157 [2018-02-02 20:18:04,313 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 20:18:04,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:18:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 20:18:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2018-02-02 20:18:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 20:18:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-02-02 20:18:04,318 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 30 [2018-02-02 20:18:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:04,318 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-02-02 20:18:04,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:18:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-02-02 20:18:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:18:04,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:04,319 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] [2018-02-02 20:18:04,319 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:04,320 INFO L82 PathProgramCache]: Analyzing trace with hash 135192650, now seen corresponding path program 1 times [2018-02-02 20:18:04,320 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:04,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:04,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:04,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:18:04,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:04,477 INFO L182 omatonBuilderFactory]: Interpolants [2112#false, 2113#(and (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|))), 2114#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 2115#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 2116#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 2117#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 2111#true] [2018-02-02 20:18:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:04,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:18:04,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:18:04,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:18:04,483 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 7 states. [2018-02-02 20:18:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:04,921 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2018-02-02 20:18:04,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:18:04,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 20:18:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:04,922 INFO L225 Difference]: With dead ends: 171 [2018-02-02 20:18:04,922 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 20:18:04,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:18:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 20:18:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2018-02-02 20:18:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 20:18:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-02-02 20:18:04,926 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 30 [2018-02-02 20:18:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:04,926 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-02-02 20:18:04,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:18:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-02-02 20:18:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:18:04,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:04,927 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] [2018-02-02 20:18:04,927 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:04,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1848368372, now seen corresponding path program 1 times [2018-02-02 20:18:04,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:04,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:04,980 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:18:04,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:04,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:18:04,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:04,981 INFO L182 omatonBuilderFactory]: Interpolants [2403#true, 2404#false, 2405#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2406#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 2407#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 2408#(= |main_#t~mem19| 3)] [2018-02-02 20:18:04,981 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:18:04,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:18:04,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:18:04,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:18:04,981 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-02-02 20:18:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:05,108 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-02-02 20:18:05,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:18:05,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 20:18:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:05,109 INFO L225 Difference]: With dead ends: 156 [2018-02-02 20:18:05,109 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 20:18:05,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:18:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 20:18:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 104. [2018-02-02 20:18:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 20:18:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-02-02 20:18:05,113 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 30 [2018-02-02 20:18:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:05,113 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-02-02 20:18:05,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:18:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-02-02 20:18:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:18:05,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:05,114 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:05,114 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash 772815435, now seen corresponding path program 1 times [2018-02-02 20:18:05,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:05,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:05,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:18:05,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:18:05,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:05,145 INFO L182 omatonBuilderFactory]: Interpolants [2673#true, 2674#false, 2675#(and (= main_~y~0 0) (= main_~i~0 0))] [2018-02-02 20:18:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:05,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:18:05,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:18:05,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:18:05,146 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 3 states. [2018-02-02 20:18:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:05,157 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2018-02-02 20:18:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:18:05,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-02-02 20:18:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:05,158 INFO L225 Difference]: With dead ends: 105 [2018-02-02 20:18:05,158 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 20:18:05,158 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:18:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 20:18:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 20:18:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 20:18:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-02-02 20:18:05,160 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 35 [2018-02-02 20:18:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:05,161 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-02-02 20:18:05,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:18:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-02-02 20:18:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:18:05,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:05,162 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] [2018-02-02 20:18:05,162 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:05,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1113019023, now seen corresponding path program 1 times [2018-02-02 20:18:05,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:05,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:05,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:05,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:18:05,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:05,333 INFO L182 omatonBuilderFactory]: Interpolants [2880#(and (= main_~p~0.offset main_~a~0.offset) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 2881#(and (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 2882#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 2883#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 2884#(= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset) 2), 2885#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2), 2886#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 2887#(= |main_#t~mem16| 2), 2876#true, 2877#false, 2878#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2879#(and (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2))] [2018-02-02 20:18:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:05,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:18:05,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:18:05,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:18:05,334 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 12 states. [2018-02-02 20:18:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:05,656 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-02-02 20:18:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:18:05,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-02-02 20:18:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:05,662 INFO L225 Difference]: With dead ends: 173 [2018-02-02 20:18:05,662 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 20:18:05,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:18:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 20:18:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 111. [2018-02-02 20:18:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 20:18:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2018-02-02 20:18:05,666 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 38 [2018-02-02 20:18:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:05,666 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2018-02-02 20:18:05,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:18:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-02-02 20:18:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:18:05,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:05,667 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] [2018-02-02 20:18:05,668 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash 823813575, now seen corresponding path program 1 times [2018-02-02 20:18:05,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:05,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:05,868 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:18:05,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:05,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:18:05,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:05,870 INFO L182 omatonBuilderFactory]: Interpolants [3200#(= 1 (select |#valid| main_~p~0.base)), 3186#true, 3187#false, 3188#(= 0 |main_#t~malloc0.offset|), 3189#(= 0 main_~a~0.offset), 3190#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3191#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 3192#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3193#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 3194#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3195#(and (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 3196#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 3197#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 3198#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 3199#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 20:18:05,870 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:18:05,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:18:05,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:18:05,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:18:05,871 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 15 states. [2018-02-02 20:18:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:06,418 INFO L93 Difference]: Finished difference Result 203 states and 227 transitions. [2018-02-02 20:18:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:18:06,418 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-02 20:18:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:06,419 INFO L225 Difference]: With dead ends: 203 [2018-02-02 20:18:06,419 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 20:18:06,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=755, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:18:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 20:18:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 135. [2018-02-02 20:18:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 20:18:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2018-02-02 20:18:06,423 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 38 [2018-02-02 20:18:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:06,424 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2018-02-02 20:18:06,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:18:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-02-02 20:18:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:18:06,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:06,425 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] [2018-02-02 20:18:06,426 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:06,426 INFO L82 PathProgramCache]: Analyzing trace with hash 823813576, now seen corresponding path program 1 times [2018-02-02 20:18:06,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:06,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:06,641 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:18:06,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:06,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:18:06,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:06,641 INFO L182 omatonBuilderFactory]: Interpolants [3584#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 3585#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 3586#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 3587#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 3573#true, 3574#false, 3575#(= 0 |main_#t~malloc0.offset|), 3576#(= 0 main_~a~0.offset), 3577#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3578#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 3579#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3580#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 3581#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 3582#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 3583#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 20:18:06,641 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:18:06,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:18:06,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:18:06,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:18:06,642 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 15 states. [2018-02-02 20:18:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:07,105 INFO L93 Difference]: Finished difference Result 231 states and 258 transitions. [2018-02-02 20:18:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:18:07,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-02 20:18:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:07,106 INFO L225 Difference]: With dead ends: 231 [2018-02-02 20:18:07,106 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 20:18:07,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:18:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 20:18:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 140. [2018-02-02 20:18:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 20:18:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-02-02 20:18:07,109 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 38 [2018-02-02 20:18:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:07,110 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-02-02 20:18:07,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:18:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-02-02 20:18:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:18:07,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:07,110 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] [2018-02-02 20:18:07,110 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:07,110 INFO L82 PathProgramCache]: Analyzing trace with hash -339451850, now seen corresponding path program 1 times [2018-02-02 20:18:07,111 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:07,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:07,237 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:18:07,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:07,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:18:07,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:07,238 INFO L182 omatonBuilderFactory]: Interpolants [3985#true, 3986#false, 3987#(= 0 |main_#t~malloc0.offset|), 3988#(= 0 main_~a~0.offset), 3989#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3990#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 3991#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 3992#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 3993#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3994#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 3995#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 3996#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 3997#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 3998#(= 1 (select |#valid| |main_#t~mem21.base|)), 3999#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:18:07,238 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:18:07,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:18:07,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:18:07,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:18:07,239 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 15 states. [2018-02-02 20:18:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:07,627 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2018-02-02 20:18:07,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:18:07,627 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-02 20:18:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:07,627 INFO L225 Difference]: With dead ends: 189 [2018-02-02 20:18:07,627 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 20:18:07,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=755, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:18:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 20:18:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 145. [2018-02-02 20:18:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:18:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2018-02-02 20:18:07,630 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 41 [2018-02-02 20:18:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:07,630 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2018-02-02 20:18:07,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:18:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2018-02-02 20:18:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:18:07,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:07,631 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] [2018-02-02 20:18:07,631 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash -339451849, now seen corresponding path program 1 times [2018-02-02 20:18:07,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:07,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:07,786 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:18:07,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:07,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:18:07,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:07,787 INFO L182 omatonBuilderFactory]: Interpolants [4368#true, 4369#false, 4370#(= 0 |main_#t~malloc0.offset|), 4371#(= 0 main_~a~0.offset), 4372#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4373#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4374#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 4375#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 4376#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 4377#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4378#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4379#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4380#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 4381#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 4382#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:18:07,787 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:18:07,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:18:07,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:18:07,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:18:07,787 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand 15 states. [2018-02-02 20:18:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:08,147 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2018-02-02 20:18:08,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:18:08,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-02 20:18:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:08,148 INFO L225 Difference]: With dead ends: 213 [2018-02-02 20:18:08,148 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 20:18:08,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:18:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 20:18:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 145. [2018-02-02 20:18:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:18:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2018-02-02 20:18:08,156 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 41 [2018-02-02 20:18:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:08,156 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2018-02-02 20:18:08,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:18:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2018-02-02 20:18:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:18:08,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:08,156 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] [2018-02-02 20:18:08,156 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1249820704, now seen corresponding path program 1 times [2018-02-02 20:18:08,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:08,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:18:08,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:08,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:18:08,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:08,294 INFO L182 omatonBuilderFactory]: Interpolants [4768#false, 4769#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 4770#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4771#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 4772#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 4773#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 4774#(and (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 4775#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)), 4776#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 4777#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 4778#(= 1 |main_#t~mem16|), 4767#true] [2018-02-02 20:18:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:18:08,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:18:08,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:18:08,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:18:08,294 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand 12 states. [2018-02-02 20:18:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:08,550 INFO L93 Difference]: Finished difference Result 217 states and 240 transitions. [2018-02-02 20:18:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:18:08,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 20:18:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:08,551 INFO L225 Difference]: With dead ends: 217 [2018-02-02 20:18:08,551 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 20:18:08,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:18:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 20:18:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 145. [2018-02-02 20:18:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:18:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2018-02-02 20:18:08,554 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 41 [2018-02-02 20:18:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:08,555 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2018-02-02 20:18:08,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:18:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2018-02-02 20:18:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:18:08,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:08,555 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:18:08,556 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:08,556 INFO L82 PathProgramCache]: Analyzing trace with hash 543633064, now seen corresponding path program 2 times [2018-02-02 20:18:08,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:08,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:08,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:08,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:18:08,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:08,700 INFO L182 omatonBuilderFactory]: Interpolants [5155#true, 5156#false, 5157#(= 0 |main_#t~malloc0.offset|), 5158#(= 0 main_~a~0.offset), 5159#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5160#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5161#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5162#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 5163#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5164#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 5165#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 5166#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 3)), 5167#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 5168#(= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 3), 5169#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 5170#(= |main_#t~mem16| 3)] [2018-02-02 20:18:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:08,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:18:08,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:18:08,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:18:08,701 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand 16 states. [2018-02-02 20:18:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:09,143 INFO L93 Difference]: Finished difference Result 213 states and 233 transitions. [2018-02-02 20:18:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:18:09,144 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-02 20:18:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:09,144 INFO L225 Difference]: With dead ends: 213 [2018-02-02 20:18:09,144 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 20:18:09,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:18:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 20:18:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 145. [2018-02-02 20:18:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:18:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2018-02-02 20:18:09,147 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 43 [2018-02-02 20:18:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:09,147 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2018-02-02 20:18:09,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:18:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2018-02-02 20:18:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:18:09,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:09,147 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:18:09,147 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash 23596268, now seen corresponding path program 2 times [2018-02-02 20:18:09,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:09,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:09,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:09,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:18:09,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:09,274 INFO L182 omatonBuilderFactory]: Interpolants [5568#(= 0 main_~a~0.offset), 5569#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5570#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5571#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 5572#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 5573#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5574#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem14.offset|)), 5575#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 5576#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 3)), 5577#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3), 5578#(= (select (select |#memory_int| |main_#t~mem21.base|) |main_#t~mem21.offset|) 3), 5579#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 5580#(= |main_#t~mem19| 3), 5565#true, 5566#false, 5567#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 20:18:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:09,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:18:09,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:18:09,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:18:09,275 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand 16 states. [2018-02-02 20:18:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:09,768 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2018-02-02 20:18:09,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:18:09,768 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 20:18:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:09,768 INFO L225 Difference]: With dead ends: 192 [2018-02-02 20:18:09,768 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 20:18:09,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:18:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 20:18:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 148. [2018-02-02 20:18:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 20:18:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2018-02-02 20:18:09,770 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 46 [2018-02-02 20:18:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:09,771 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2018-02-02 20:18:09,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:18:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2018-02-02 20:18:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:18:09,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:09,771 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] [2018-02-02 20:18:09,771 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:09,771 INFO L82 PathProgramCache]: Analyzing trace with hash -486326369, now seen corresponding path program 1 times [2018-02-02 20:18:09,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:09,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:18:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:09,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:09,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:18:09,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:09,899 INFO L182 omatonBuilderFactory]: Interpolants [5957#true, 5958#false, 5959#(= 0 |main_#t~malloc0.offset|), 5960#(= 0 main_~a~0.offset), 5961#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5962#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5963#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5964#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 5965#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5966#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 5967#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 5968#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 3)), 5969#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 5970#(= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 3), 5971#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 5972#(= |main_#t~mem19| 3)] [2018-02-02 20:18:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:09,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:18:09,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:18:09,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:18:09,900 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand 16 states. [2018-02-02 20:18:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:10,386 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-02-02 20:18:10,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:18:10,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 20:18:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:10,387 INFO L225 Difference]: With dead ends: 198 [2018-02-02 20:18:10,387 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 20:18:10,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:18:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 20:18:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 145. [2018-02-02 20:18:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:18:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2018-02-02 20:18:10,391 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 46 [2018-02-02 20:18:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:10,391 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2018-02-02 20:18:10,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:18:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2018-02-02 20:18:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:18:10,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:10,392 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:18:10,392 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:10,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1639108275, now seen corresponding path program 2 times [2018-02-02 20:18:10,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:10,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:10,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:10,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:18:10,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:10,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:18:10,614 INFO L182 omatonBuilderFactory]: Interpolants [6368#(= |main_#t~mem16| 2), 6352#true, 6353#false, 6354#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 6355#(and (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 6356#(and (= main_~p~0.offset main_~a~0.offset) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 6357#(and (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 6358#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 6359#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 6360#(and (= (select |#valid| main_~a~0.base) 1) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset) 2) (not (= main_~p~0.base main_~a~0.base))), 6361#(and (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 6362#(and (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base main_~t~0.base))), 6363#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 6364#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 6365#(= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset) 2), 6366#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2), 6367#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)] [2018-02-02 20:18:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:10,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:18:10,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:18:10,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:18:10,615 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand 17 states. [2018-02-02 20:18:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:11,093 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2018-02-02 20:18:11,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:18:11,094 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-02-02 20:18:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:11,095 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:18:11,095 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 20:18:11,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:18:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 20:18:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 161. [2018-02-02 20:18:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 20:18:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-02-02 20:18:11,099 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 49 [2018-02-02 20:18:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:11,099 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-02-02 20:18:11,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:18:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-02-02 20:18:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:18:11,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:11,100 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] [2018-02-02 20:18:11,100 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:11,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1378591901, now seen corresponding path program 1 times [2018-02-02 20:18:11,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:11,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:11,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:11,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:18:11,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:11,332 INFO L182 omatonBuilderFactory]: Interpolants [6784#(= 1 (select |#valid| main_~p~0.base)), 6765#true, 6766#false, 6767#(= 0 |main_#t~malloc0.offset|), 6768#(= 0 main_~a~0.offset), 6769#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6770#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 6771#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6772#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 6773#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 6774#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 6775#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 6776#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 6777#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 6778#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 6779#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 6780#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 6781#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 6782#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 6783#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 20:18:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:11,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:18:11,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:18:11,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:18:11,333 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 20 states. [2018-02-02 20:18:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:12,068 INFO L93 Difference]: Finished difference Result 253 states and 281 transitions. [2018-02-02 20:18:12,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:18:12,068 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 20:18:12,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:12,069 INFO L225 Difference]: With dead ends: 253 [2018-02-02 20:18:12,069 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 20:18:12,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:18:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 20:18:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 181. [2018-02-02 20:18:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 20:18:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-02-02 20:18:12,071 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 49 [2018-02-02 20:18:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:12,071 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-02-02 20:18:12,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:18:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2018-02-02 20:18:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:18:12,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:12,072 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] [2018-02-02 20:18:12,072 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:12,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1378591902, now seen corresponding path program 1 times [2018-02-02 20:18:12,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:12,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:18:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:12,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:12,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:18:12,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:12,332 INFO L182 omatonBuilderFactory]: Interpolants [7265#true, 7266#false, 7267#(= 0 |main_#t~malloc0.offset|), 7268#(= 0 main_~a~0.offset), 7269#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7270#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7271#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7272#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 7273#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7274#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 7275#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7276#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7277#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 7278#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (+ main_~p~0.offset 8) (select |#length| main_~p~0.base))), 7279#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 7280#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7281#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 7282#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 7283#(and (<= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 7284#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 20:18:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:12,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:18:12,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:18:12,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:18:12,333 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand 20 states. [2018-02-02 20:18:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:13,303 INFO L93 Difference]: Finished difference Result 277 states and 308 transitions. [2018-02-02 20:18:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:18:13,303 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 20:18:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:13,305 INFO L225 Difference]: With dead ends: 277 [2018-02-02 20:18:13,305 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 20:18:13,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:18:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 20:18:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 185. [2018-02-02 20:18:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 20:18:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2018-02-02 20:18:13,310 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 49 [2018-02-02 20:18:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:13,310 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2018-02-02 20:18:13,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:18:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-02-02 20:18:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:18:13,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:13,311 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:18:13,311 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash -979542797, now seen corresponding path program 3 times [2018-02-02 20:18:13,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:13,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:13,563 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:18:13,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:13,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:18:13,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:13,564 INFO L182 omatonBuilderFactory]: Interpolants [7808#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 7809#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 7810#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 7811#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|))), 7812#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 7813#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 7814#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 7815#(= 1 (select |#valid| |main_#t~mem18.base|)), 7816#(= 1 (select |#valid| main_~p~0.base)), 7797#true, 7798#false, 7799#(= 0 |main_#t~malloc0.offset|), 7800#(= 0 main_~a~0.offset), 7801#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7802#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7803#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7804#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 7805#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7806#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 7807#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 20:18:13,564 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:18:13,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:18:13,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:18:13,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:18:13,564 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand 20 states. [2018-02-02 20:18:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:14,384 INFO L93 Difference]: Finished difference Result 283 states and 318 transitions. [2018-02-02 20:18:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:18:14,385 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 20:18:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:14,385 INFO L225 Difference]: With dead ends: 283 [2018-02-02 20:18:14,385 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 20:18:14,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=1363, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:18:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 20:18:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 209. [2018-02-02 20:18:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:18:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 240 transitions. [2018-02-02 20:18:14,388 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 240 transitions. Word has length 49 [2018-02-02 20:18:14,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:14,388 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 240 transitions. [2018-02-02 20:18:14,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:18:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 240 transitions. [2018-02-02 20:18:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:18:14,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:14,389 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:18:14,389 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:14,389 INFO L82 PathProgramCache]: Analyzing trace with hash -979542796, now seen corresponding path program 2 times [2018-02-02 20:18:14,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:14,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:14,712 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:18:14,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:14,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:18:14,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:14,712 INFO L182 omatonBuilderFactory]: Interpolants [8353#true, 8354#false, 8355#(= 0 |main_#t~malloc0.offset|), 8356#(= 0 main_~a~0.offset), 8357#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8358#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8359#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 8360#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 8361#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8362#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1)), 8363#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8364#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 8365#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 8366#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 8367#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 8368#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 8369#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 8370#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 8371#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 8372#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:18:14,712 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:18:14,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:18:14,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:18:14,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:18:14,713 INFO L87 Difference]: Start difference. First operand 209 states and 240 transitions. Second operand 20 states. [2018-02-02 20:18:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:15,521 INFO L93 Difference]: Finished difference Result 311 states and 349 transitions. [2018-02-02 20:18:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:18:15,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 20:18:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:15,523 INFO L225 Difference]: With dead ends: 311 [2018-02-02 20:18:15,523 INFO L226 Difference]: Without dead ends: 311 [2018-02-02 20:18:15,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:18:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-02 20:18:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 196. [2018-02-02 20:18:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 20:18:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2018-02-02 20:18:15,527 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 49 [2018-02-02 20:18:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:15,527 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2018-02-02 20:18:15,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:18:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2018-02-02 20:18:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:18:15,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:15,528 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:15,528 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash 457917779, now seen corresponding path program 1 times [2018-02-02 20:18:15,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:15,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:18:15,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:15,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:18:15,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:15,562 INFO L182 omatonBuilderFactory]: Interpolants [8918#true, 8919#false, 8920#(and (= main_~y~0 0) (= main_~i~0 0)), 8921#(and (<= main_~y~0 1) (= main_~i~0 0))] [2018-02-02 20:18:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:18:15,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:18:15,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:18:15,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:18:15,563 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand 4 states. [2018-02-02 20:18:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:15,581 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2018-02-02 20:18:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:18:15,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-02-02 20:18:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:15,582 INFO L225 Difference]: With dead ends: 210 [2018-02-02 20:18:15,582 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 20:18:15,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:18:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 20:18:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-02-02 20:18:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:18:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 221 transitions. [2018-02-02 20:18:15,585 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 221 transitions. Word has length 51 [2018-02-02 20:18:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:15,585 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 221 transitions. [2018-02-02 20:18:15,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:18:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 221 transitions. [2018-02-02 20:18:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:18:15,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:15,586 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:15,586 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:15,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2041394560, now seen corresponding path program 1 times [2018-02-02 20:18:15,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:15,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:18:15,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:15,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:18:15,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:15,635 INFO L182 omatonBuilderFactory]: Interpolants [9324#true, 9325#false, 9326#(and (= main_~y~0 0) (= main_~i~0 0)), 9327#(and (= main_~y~0 0) (<= main_~i~0 1))] [2018-02-02 20:18:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:18:15,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:18:15,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:18:15,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:18:15,635 INFO L87 Difference]: Start difference. First operand 192 states and 221 transitions. Second operand 4 states. [2018-02-02 20:18:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:15,648 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2018-02-02 20:18:15,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:18:15,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-02-02 20:18:15,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:15,648 INFO L225 Difference]: With dead ends: 206 [2018-02-02 20:18:15,648 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 20:18:15,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:18:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 20:18:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2018-02-02 20:18:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 20:18:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 216 transitions. [2018-02-02 20:18:15,650 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 216 transitions. Word has length 51 [2018-02-02 20:18:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:15,650 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 216 transitions. [2018-02-02 20:18:15,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:18:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 216 transitions. [2018-02-02 20:18:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:18:15,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:15,651 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:18:15,651 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:15,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1654169524, now seen corresponding path program 3 times [2018-02-02 20:18:15,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:15,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:15,885 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:18:15,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:15,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:18:15,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:15,886 INFO L182 omatonBuilderFactory]: Interpolants [9728#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 9729#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 9730#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 9731#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 9732#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 9733#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 9734#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 9735#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 9736#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 9737#(= 1 (select |#valid| |main_#t~mem21.base|)), 9738#(= 1 (select |#valid| main_~p~0.base)), 9719#true, 9720#false, 9721#(= 0 |main_#t~malloc0.offset|), 9722#(= 0 main_~a~0.offset), 9723#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9724#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 9725#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 9726#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 9727#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:18:15,886 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:18:15,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:18:15,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:18:15,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:18:15,887 INFO L87 Difference]: Start difference. First operand 185 states and 216 transitions. Second operand 20 states. [2018-02-02 20:18:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:16,411 INFO L93 Difference]: Finished difference Result 248 states and 284 transitions. [2018-02-02 20:18:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:18:16,411 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-02 20:18:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:16,412 INFO L225 Difference]: With dead ends: 248 [2018-02-02 20:18:16,412 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 20:18:16,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1191, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:18:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 20:18:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 206. [2018-02-02 20:18:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:18:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2018-02-02 20:18:16,414 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 52 [2018-02-02 20:18:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:16,414 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2018-02-02 20:18:16,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:18:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2018-02-02 20:18:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:18:16,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:16,415 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:18:16,415 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:16,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1654169525, now seen corresponding path program 2 times [2018-02-02 20:18:16,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:16,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:16,701 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:18:16,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:16,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:18:16,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:16,702 INFO L182 omatonBuilderFactory]: Interpolants [10240#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 10241#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10242#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10243#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 10244#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (+ main_~p~0.offset 8) (select |#length| main_~p~0.base))), 10245#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 10246#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10247#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 10248#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 10249#(and (= 0 |main_#t~mem21.offset|) (<= 8 (select |#length| |main_#t~mem21.base|))), 10250#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 10231#true, 10232#false, 10233#(= 0 |main_#t~malloc0.offset|), 10234#(= 0 main_~a~0.offset), 10235#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10236#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10237#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 10238#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 10239#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:18:16,702 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:18:16,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:18:16,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:18:16,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:18:16,702 INFO L87 Difference]: Start difference. First operand 206 states and 239 transitions. Second operand 20 states. [2018-02-02 20:18:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:17,393 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2018-02-02 20:18:17,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:18:17,393 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-02 20:18:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:17,394 INFO L225 Difference]: With dead ends: 268 [2018-02-02 20:18:17,394 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 20:18:17,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:18:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 20:18:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 206. [2018-02-02 20:18:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:18:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2018-02-02 20:18:17,396 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 52 [2018-02-02 20:18:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:17,397 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2018-02-02 20:18:17,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:18:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2018-02-02 20:18:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:18:17,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:17,397 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:17,397 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:17,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1616775562, now seen corresponding path program 1 times [2018-02-02 20:18:17,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:17,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:18:17,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:17,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:18:17,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:17,650 INFO L182 omatonBuilderFactory]: Interpolants [10765#true, 10766#false, 10767#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 10768#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10769#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 10770#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 10771#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10772#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 10773#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset))), 10774#(and (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 10775#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 10776#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 10777#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 10778#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)), 10779#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 10780#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 10781#(= 1 |main_#t~mem16|)] [2018-02-02 20:18:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:18:17,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:18:17,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:18:17,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:18:17,651 INFO L87 Difference]: Start difference. First operand 206 states and 239 transitions. Second operand 17 states. [2018-02-02 20:18:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:18,227 INFO L93 Difference]: Finished difference Result 309 states and 354 transitions. [2018-02-02 20:18:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:18:18,227 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-02 20:18:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:18,228 INFO L225 Difference]: With dead ends: 309 [2018-02-02 20:18:18,228 INFO L226 Difference]: Without dead ends: 309 [2018-02-02 20:18:18,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:18:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-02 20:18:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 231. [2018-02-02 20:18:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 20:18:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 268 transitions. [2018-02-02 20:18:18,233 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 268 transitions. Word has length 52 [2018-02-02 20:18:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:18,233 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 268 transitions. [2018-02-02 20:18:18,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:18:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 268 transitions. [2018-02-02 20:18:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:18:18,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:18,234 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:18:18,234 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1088919180, now seen corresponding path program 2 times [2018-02-02 20:18:18,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:18,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:18:18,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:18,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:18:18,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:18,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:18:18,472 INFO L182 omatonBuilderFactory]: Interpolants [11360#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 11361#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 11362#(and (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 11363#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)), 11364#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 11365#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 11366#(= 1 |main_#t~mem16|), 11350#true, 11351#false, 11352#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 11353#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 11354#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 11355#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 11356#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 11357#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 11358#(and (= (select |#valid| main_~a~0.base) 1) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 11359#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base |main_#t~malloc5.base|)))] [2018-02-02 20:18:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:18:18,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:18:18,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:18:18,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:18:18,473 INFO L87 Difference]: Start difference. First operand 231 states and 268 transitions. Second operand 17 states. [2018-02-02 20:18:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:18,886 INFO L93 Difference]: Finished difference Result 326 states and 374 transitions. [2018-02-02 20:18:18,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:18:18,887 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-02 20:18:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:18,888 INFO L225 Difference]: With dead ends: 326 [2018-02-02 20:18:18,888 INFO L226 Difference]: Without dead ends: 326 [2018-02-02 20:18:18,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:18:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-02 20:18:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 230. [2018-02-02 20:18:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 20:18:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 268 transitions. [2018-02-02 20:18:18,893 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 268 transitions. Word has length 52 [2018-02-02 20:18:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:18,893 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 268 transitions. [2018-02-02 20:18:18,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:18:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 268 transitions. [2018-02-02 20:18:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:18:18,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:18,894 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, 1, 1, 1, 1, 1] [2018-02-02 20:18:18,894 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash 999933330, now seen corresponding path program 2 times [2018-02-02 20:18:18,895 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:18,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:18:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:19,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:19,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:18:19,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:19,438 INFO L182 omatonBuilderFactory]: Interpolants [11945#true, 11946#false, 11947#(= 0 |main_#t~malloc0.offset|), 11948#(= 0 main_~a~0.offset), 11949#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 11950#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 11951#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 11952#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 11953#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 11954#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 11955#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11956#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 11957#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 11958#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2) (not (= main_~a~0.base main_~t~0.base))), 11959#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 11960#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11961#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base main_~a~0.base))), 11962#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11963#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 11964#(and (= 0 |main_#t~mem18.offset|) (= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 2)), 11965#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 11966#(= |main_#t~mem16| 2)] [2018-02-02 20:18:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:19,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:18:19,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:18:19,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:18:19,439 INFO L87 Difference]: Start difference. First operand 230 states and 268 transitions. Second operand 22 states. [2018-02-02 20:18:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:20,373 INFO L93 Difference]: Finished difference Result 293 states and 331 transitions. [2018-02-02 20:18:20,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:18:20,374 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-02-02 20:18:20,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:20,375 INFO L225 Difference]: With dead ends: 293 [2018-02-02 20:18:20,375 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 20:18:20,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=333, Invalid=1647, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:18:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 20:18:20,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 240. [2018-02-02 20:18:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 20:18:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 278 transitions. [2018-02-02 20:18:20,380 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 278 transitions. Word has length 54 [2018-02-02 20:18:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:20,381 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 278 transitions. [2018-02-02 20:18:20,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:18:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 278 transitions. [2018-02-02 20:18:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:18:20,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:20,381 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 20:18:20,381 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:20,381 INFO L82 PathProgramCache]: Analyzing trace with hash -717499652, now seen corresponding path program 4 times [2018-02-02 20:18:20,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:20,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:18:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:20,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:20,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:18:20,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:20,878 INFO L182 omatonBuilderFactory]: Interpolants [12546#true, 12547#false, 12548#(= 0 |main_#t~malloc0.offset|), 12549#(= 0 main_~a~0.offset), 12550#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 12551#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 12552#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 12553#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 12554#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 12555#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 12556#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base main_~a~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)) (<= (+ main_~p~0.offset 1) 0))), 12557#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 12558#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 12559#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 12560#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 12561#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 12562#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 12563#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12564#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 12565#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 |main_#t~mem18.offset|)), 12566#(or (<= (+ main_~p~0.offset 1) 0) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0))), 12567#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 12568#(= 1 (select |#valid| |main_#t~mem18.base|)), 12569#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:18:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:20,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:18:20,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:18:20,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:18:20,878 INFO L87 Difference]: Start difference. First operand 240 states and 278 transitions. Second operand 24 states. [2018-02-02 20:18:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:21,902 INFO L93 Difference]: Finished difference Result 316 states and 361 transitions. [2018-02-02 20:18:21,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:18:21,903 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2018-02-02 20:18:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:21,903 INFO L225 Difference]: With dead ends: 316 [2018-02-02 20:18:21,903 INFO L226 Difference]: Without dead ends: 316 [2018-02-02 20:18:21,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=359, Invalid=1803, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:18:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-02 20:18:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 243. [2018-02-02 20:18:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 20:18:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 282 transitions. [2018-02-02 20:18:21,907 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 282 transitions. Word has length 54 [2018-02-02 20:18:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:21,907 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 282 transitions. [2018-02-02 20:18:21,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:18:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 282 transitions. [2018-02-02 20:18:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:18:21,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:21,908 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 20:18:21,908 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:21,908 INFO L82 PathProgramCache]: Analyzing trace with hash -717499651, now seen corresponding path program 3 times [2018-02-02 20:18:21,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:21,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:22,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:22,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:18:22,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:22,356 INFO L182 omatonBuilderFactory]: Interpolants [13184#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 13185#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (or (<= (+ main_~p~0.offset 1) 0) (and (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)))), 13186#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 13187#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 8 (select |#length| |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 13188#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 13189#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 13190#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 13191#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 13192#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 13193#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 13194#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) (= 0 |main_#t~mem18.offset|)), 13195#(or (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 13196#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 13197#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 13198#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 13175#true, 13176#false, 13177#(= 0 |main_#t~malloc0.offset|), 13178#(= 0 main_~a~0.offset), 13179#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 13180#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 13181#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 13182#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 13183#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:18:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:22,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:18:22,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:18:22,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:18:22,357 INFO L87 Difference]: Start difference. First operand 243 states and 282 transitions. Second operand 24 states. [2018-02-02 20:18:23,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:23,555 INFO L93 Difference]: Finished difference Result 342 states and 390 transitions. [2018-02-02 20:18:23,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:18:23,555 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2018-02-02 20:18:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:23,556 INFO L225 Difference]: With dead ends: 342 [2018-02-02 20:18:23,556 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 20:18:23,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=284, Invalid=1608, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:18:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 20:18:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 249. [2018-02-02 20:18:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 20:18:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 289 transitions. [2018-02-02 20:18:23,559 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 289 transitions. Word has length 54 [2018-02-02 20:18:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:23,559 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 289 transitions. [2018-02-02 20:18:23,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:18:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 289 transitions. [2018-02-02 20:18:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:18:23,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:23,560 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 20:18:23,561 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash 124111918, now seen corresponding path program 4 times [2018-02-02 20:18:23,561 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:23,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:24,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:24,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:18:24,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:24,007 INFO L182 omatonBuilderFactory]: Interpolants [13830#true, 13831#false, 13832#(= 0 |main_#t~malloc0.offset|), 13833#(= 0 main_~a~0.offset), 13834#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 13835#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 13836#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 13837#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 13838#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 13839#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 13840#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 13841#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 13842#(and (= 1 (select |#valid| |main_#t~malloc12.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 13843#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 13844#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 13845#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 13846#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 13847#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 13848#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 13849#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ 0 4)))) (= 0 |main_#t~mem21.offset|)), 13850#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 13851#(= 1 (select |#valid| |main_#t~mem21.base|)), 13852#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:18:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:24,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:18:24,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:18:24,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:18:24,008 INFO L87 Difference]: Start difference. First operand 249 states and 289 transitions. Second operand 23 states. [2018-02-02 20:18:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:24,833 INFO L93 Difference]: Finished difference Result 294 states and 336 transitions. [2018-02-02 20:18:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:18:24,833 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 20:18:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:24,834 INFO L225 Difference]: With dead ends: 294 [2018-02-02 20:18:24,835 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 20:18:24,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=356, Invalid=1806, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:18:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 20:18:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 254. [2018-02-02 20:18:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 20:18:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2018-02-02 20:18:24,837 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 57 [2018-02-02 20:18:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:24,837 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2018-02-02 20:18:24,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:18:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2018-02-02 20:18:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:18:24,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:24,838 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 20:18:24,838 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:24,838 INFO L82 PathProgramCache]: Analyzing trace with hash 124111919, now seen corresponding path program 3 times [2018-02-02 20:18:24,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:24,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:25,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:25,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:18:25,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:25,273 INFO L182 omatonBuilderFactory]: Interpolants [14464#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 14465#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14466#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 14467#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 14468#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ 0 4)))), 14469#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 14470#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 14471#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 14449#true, 14450#false, 14451#(= 0 |main_#t~malloc0.offset|), 14452#(= 0 main_~a~0.offset), 14453#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 14454#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 14455#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 14456#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 14457#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 14458#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 14459#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14460#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14461#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 14462#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 14463#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))))] [2018-02-02 20:18:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:25,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:18:25,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:18:25,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:18:25,274 INFO L87 Difference]: Start difference. First operand 254 states and 294 transitions. Second operand 23 states. [2018-02-02 20:18:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:26,172 INFO L93 Difference]: Finished difference Result 318 states and 361 transitions. [2018-02-02 20:18:26,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:18:26,172 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 20:18:26,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:26,173 INFO L225 Difference]: With dead ends: 318 [2018-02-02 20:18:26,173 INFO L226 Difference]: Without dead ends: 318 [2018-02-02 20:18:26,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:18:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-02 20:18:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 254. [2018-02-02 20:18:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 20:18:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2018-02-02 20:18:26,175 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 57 [2018-02-02 20:18:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:26,175 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2018-02-02 20:18:26,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:18:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2018-02-02 20:18:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:18:26,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:26,176 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, 1] [2018-02-02 20:18:26,176 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:26,176 INFO L82 PathProgramCache]: Analyzing trace with hash -416593803, now seen corresponding path program 1 times [2018-02-02 20:18:26,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:26,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:26,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:26,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:18:26,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:26,650 INFO L182 omatonBuilderFactory]: Interpolants [15104#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 15105#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 |main_#t~mem18.offset|)), 15106#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 15107#(= 1 (select |#valid| |main_#t~mem21.base|)), 15108#(= 1 (select |#valid| main_~p~0.base)), 15086#true, 15087#false, 15088#(= 0 |main_#t~malloc0.offset|), 15089#(= 0 main_~a~0.offset), 15090#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 15091#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 15092#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 15093#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 15094#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 15095#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 15096#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 15097#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 15098#(and (= 1 (select |#valid| |main_#t~malloc12.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 15099#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 15100#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 15101#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 15102#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 15103#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))] [2018-02-02 20:18:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:26,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:18:26,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:18:26,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:18:26,651 INFO L87 Difference]: Start difference. First operand 254 states and 294 transitions. Second operand 23 states. [2018-02-02 20:18:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:27,519 INFO L93 Difference]: Finished difference Result 301 states and 343 transitions. [2018-02-02 20:18:27,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:18:27,519 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 20:18:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:27,520 INFO L225 Difference]: With dead ends: 301 [2018-02-02 20:18:27,520 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 20:18:27,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=357, Invalid=1805, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:18:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 20:18:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 259. [2018-02-02 20:18:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 20:18:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 299 transitions. [2018-02-02 20:18:27,522 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 299 transitions. Word has length 57 [2018-02-02 20:18:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:27,523 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 299 transitions. [2018-02-02 20:18:27,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:18:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 299 transitions. [2018-02-02 20:18:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:18:27,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:27,523 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, 1] [2018-02-02 20:18:27,523 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash -416593802, now seen corresponding path program 1 times [2018-02-02 20:18:27,524 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:27,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:28,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:28,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:18:28,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:28,312 INFO L182 omatonBuilderFactory]: Interpolants [15717#true, 15718#false, 15719#(= 0 |main_#t~malloc0.offset|), 15720#(= 0 main_~a~0.offset), 15721#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 15722#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 15723#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 15724#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 15725#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 15726#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 15727#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 15728#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 15729#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 15730#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 15731#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 15732#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 15733#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 15734#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 15735#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 15736#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) (= 0 |main_#t~mem18.offset|)), 15737#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 15738#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 15739#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base)))] [2018-02-02 20:18:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:28,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:18:28,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:18:28,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:18:28,313 INFO L87 Difference]: Start difference. First operand 259 states and 299 transitions. Second operand 23 states. [2018-02-02 20:18:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:29,353 INFO L93 Difference]: Finished difference Result 323 states and 366 transitions. [2018-02-02 20:18:29,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:18:29,354 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 20:18:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:29,355 INFO L225 Difference]: With dead ends: 323 [2018-02-02 20:18:29,355 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 20:18:29,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:18:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 20:18:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 254. [2018-02-02 20:18:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 20:18:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2018-02-02 20:18:29,358 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 57 [2018-02-02 20:18:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:29,358 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2018-02-02 20:18:29,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:18:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2018-02-02 20:18:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:18:29,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:29,360 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:18:29,361 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1482836683, now seen corresponding path program 2 times [2018-02-02 20:18:29,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:29,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:18:29,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:29,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:18:29,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:29,929 INFO L182 omatonBuilderFactory]: Interpolants [16359#true, 16360#false, 16361#(= 0 |main_#t~malloc0.offset|), 16362#(= 0 main_~a~0.offset), 16363#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16364#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 16365#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 16366#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 16367#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 16368#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1)), 16369#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 16370#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 16371#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 16372#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 16373#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 16374#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 16375#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))), 16376#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 16377#(= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 16378#(= 1 (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|)), 16379#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 16380#(= 1 |main_#t~mem16|)] [2018-02-02 20:18:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:18:29,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:18:29,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:18:29,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:18:29,930 INFO L87 Difference]: Start difference. First operand 254 states and 294 transitions. Second operand 22 states. [2018-02-02 20:18:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:30,922 INFO L93 Difference]: Finished difference Result 319 states and 361 transitions. [2018-02-02 20:18:30,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:18:30,922 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-02-02 20:18:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:30,923 INFO L225 Difference]: With dead ends: 319 [2018-02-02 20:18:30,923 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 20:18:30,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=1635, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:18:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 20:18:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 251. [2018-02-02 20:18:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 20:18:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 290 transitions. [2018-02-02 20:18:30,926 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 290 transitions. Word has length 57 [2018-02-02 20:18:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:30,926 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 290 transitions. [2018-02-02 20:18:30,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:18:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 290 transitions. [2018-02-02 20:18:30,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:18:30,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:30,926 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:18:30,926 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1133689491, now seen corresponding path program 5 times [2018-02-02 20:18:30,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:30,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:18:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:31,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:31,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:18:31,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:31,514 INFO L182 omatonBuilderFactory]: Interpolants [16997#true, 16998#false, 16999#(= 0 |main_#t~malloc0.offset|), 17000#(= 0 main_~a~0.offset), 17001#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 17002#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 17003#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 17004#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 17005#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 17006#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 17007#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base main_~a~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)) (<= (+ main_~p~0.offset 1) 0))), 17008#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 17009#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 17010#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 17011#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 17012#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 17013#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 17014#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) 3) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 17015#(and (= main_~p~0.offset 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 17016#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) 3) (= 0 |main_#t~mem18.offset|)), 17017#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)) (<= (+ main_~p~0.offset 1) 0)), 17018#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 17019#(= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 3), 17020#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 17021#(= |main_#t~mem16| 3)] [2018-02-02 20:18:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:31,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:18:31,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:18:31,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:18:31,516 INFO L87 Difference]: Start difference. First operand 251 states and 290 transitions. Second operand 25 states. [2018-02-02 20:18:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:32,719 INFO L93 Difference]: Finished difference Result 315 states and 354 transitions. [2018-02-02 20:18:32,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:18:32,720 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-02-02 20:18:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:32,721 INFO L225 Difference]: With dead ends: 315 [2018-02-02 20:18:32,721 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 20:18:32,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=1955, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:18:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 20:18:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 250. [2018-02-02 20:18:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 20:18:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 288 transitions. [2018-02-02 20:18:32,726 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 288 transitions. Word has length 59 [2018-02-02 20:18:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:32,727 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 288 transitions. [2018-02-02 20:18:32,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:18:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 288 transitions. [2018-02-02 20:18:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:18:32,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:32,728 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:18:32,728 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash 17294343, now seen corresponding path program 3 times [2018-02-02 20:18:32,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:32,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:18:33,206 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:18:33,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:33,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:18:33,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:33,207 INFO L182 omatonBuilderFactory]: Interpolants [17633#true, 17634#false, 17635#(= |main_#t~malloc0.offset| 0), 17636#(= main_~a~0.offset 0), 17637#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 17638#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 17639#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 17640#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 17641#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 17642#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 17643#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 17644#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 17645#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~t~0.base))), 17646#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 17647#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 17648#(and (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 17649#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 17650#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~t~0.offset)), 17651#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 17652#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset |main_#t~mem14.offset|)), 17653#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 17654#(and (= 0 main_~a~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 17655#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 17656#(and (= main_~p~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem16| 3))), 17657#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 17658#(= 1 (select |#valid| |main_#t~mem18.base|)), 17659#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:18:33,207 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:18:33,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:18:33,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:18:33,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:18:33,209 INFO L87 Difference]: Start difference. First operand 250 states and 288 transitions. Second operand 27 states. [2018-02-02 20:18:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:34,369 INFO L93 Difference]: Finished difference Result 332 states and 377 transitions. [2018-02-02 20:18:34,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:18:34,369 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-02 20:18:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:34,370 INFO L225 Difference]: With dead ends: 332 [2018-02-02 20:18:34,370 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 20:18:34,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=581, Invalid=2611, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 20:18:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 20:18:34,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 270. [2018-02-02 20:18:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 20:18:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 311 transitions. [2018-02-02 20:18:34,374 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 311 transitions. Word has length 60 [2018-02-02 20:18:34,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:34,374 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 311 transitions. [2018-02-02 20:18:34,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:18:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 311 transitions. [2018-02-02 20:18:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:18:34,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:34,375 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:18:34,375 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:34,375 INFO L82 PathProgramCache]: Analyzing trace with hash 17294344, now seen corresponding path program 2 times [2018-02-02 20:18:34,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:34,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:35,203 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:18:35,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:35,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:18:35,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:35,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:18:35,205 INFO L182 omatonBuilderFactory]: Interpolants [18322#true, 18323#false, 18324#(= |main_#t~malloc0.offset| 0), 18325#(= main_~a~0.offset 0), 18326#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 18327#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 18328#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 18329#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 18330#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 18331#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 18332#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 18333#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 18334#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 18335#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (+ main_~p~0.offset 8) (select |#length| main_~p~0.base))), 18336#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 18337#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 18338#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 18339#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 18340#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 18341#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 18342#(or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))), 18343#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3)), 18344#(or (and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 18345#(or (and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= |main_#t~mem16| 3)), 18346#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 18347#(and (<= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 18348#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 20:18:35,205 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:18:35,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:18:35,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:18:35,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:18:35,207 INFO L87 Difference]: Start difference. First operand 270 states and 311 transitions. Second operand 27 states. [2018-02-02 20:18:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:36,931 INFO L93 Difference]: Finished difference Result 351 states and 395 transitions. [2018-02-02 20:18:36,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:18:36,931 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-02 20:18:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:36,932 INFO L225 Difference]: With dead ends: 351 [2018-02-02 20:18:36,932 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 20:18:36,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=559, Invalid=2863, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:18:36,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 20:18:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 275. [2018-02-02 20:18:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 20:18:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 316 transitions. [2018-02-02 20:18:36,935 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 316 transitions. Word has length 60 [2018-02-02 20:18:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:36,935 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 316 transitions. [2018-02-02 20:18:36,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:18:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 316 transitions. [2018-02-02 20:18:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:18:36,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:36,935 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:18:36,935 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:36,936 INFO L82 PathProgramCache]: Analyzing trace with hash -243222031, now seen corresponding path program 4 times [2018-02-02 20:18:36,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:36,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:37,504 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:18:37,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:37,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:18:37,504 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:37,504 INFO L182 omatonBuilderFactory]: Interpolants [19039#true, 19040#false, 19041#(= |main_#t~malloc0.offset| 0), 19042#(= main_~a~0.offset 0), 19043#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 19044#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 19045#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 19046#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 19047#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 19048#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 19049#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19050#(and (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 19051#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~t~0.base))), 19052#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)), 19053#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 19054#(and (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 19055#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 19056#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~t~0.offset)), 19057#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 19058#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset |main_#t~mem14.offset|)), 19059#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 19060#(and (= 0 main_~a~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 19061#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 19062#(and (= main_~p~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem16| 3))), 19063#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 19064#(= 1 (select |#valid| |main_#t~mem18.base|)), 19065#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:18:37,504 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:18:37,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:18:37,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:18:37,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:18:37,505 INFO L87 Difference]: Start difference. First operand 275 states and 316 transitions. Second operand 27 states. [2018-02-02 20:18:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:38,826 INFO L93 Difference]: Finished difference Result 380 states and 435 transitions. [2018-02-02 20:18:38,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:18:38,827 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-02 20:18:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:38,827 INFO L225 Difference]: With dead ends: 380 [2018-02-02 20:18:38,828 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 20:18:38,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=644, Invalid=2896, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:18:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 20:18:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 295. [2018-02-02 20:18:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 20:18:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 340 transitions. [2018-02-02 20:18:38,831 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 340 transitions. Word has length 60 [2018-02-02 20:18:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:38,831 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 340 transitions. [2018-02-02 20:18:38,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:18:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 340 transitions. [2018-02-02 20:18:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:18:38,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:38,832 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:18:38,832 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash -243222030, now seen corresponding path program 3 times [2018-02-02 20:18:38,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:38,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:39,404 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:18:39,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:39,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:18:39,404 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:39,404 INFO L182 omatonBuilderFactory]: Interpolants [19807#true, 19808#false, 19809#(= |main_#t~malloc0.offset| 0), 19810#(= main_~a~0.offset 0), 19811#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 19812#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 19813#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 19814#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 19815#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 19816#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 19817#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19818#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19819#(and (<= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 19820#(and (<= 0 main_~p~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 19821#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (<= 8 (select |#length| main_~p~0.base))), 19822#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 19823#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 19824#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19825#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset main_~t~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 19826#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 19827#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset |main_#t~mem14.offset|)), 19828#(and (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 19829#(and (= 0 main_~a~0.offset) (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 19830#(and (= main_~p~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3))), 19831#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= |main_#t~mem16| 3)) (= main_~p~0.offset 0)), 19832#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 19833#(and (<= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 19834#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 20:18:39,404 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:18:39,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:18:39,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:18:39,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:18:39,405 INFO L87 Difference]: Start difference. First operand 295 states and 340 transitions. Second operand 28 states. [2018-02-02 20:18:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:41,032 INFO L93 Difference]: Finished difference Result 396 states and 451 transitions. [2018-02-02 20:18:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:18:41,032 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-02 20:18:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:41,033 INFO L225 Difference]: With dead ends: 396 [2018-02-02 20:18:41,033 INFO L226 Difference]: Without dead ends: 395 [2018-02-02 20:18:41,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=564, Invalid=3096, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:18:41,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-02 20:18:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 291. [2018-02-02 20:18:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 20:18:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 335 transitions. [2018-02-02 20:18:41,040 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 335 transitions. Word has length 60 [2018-02-02 20:18:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:41,040 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 335 transitions. [2018-02-02 20:18:41,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:18:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 335 transitions. [2018-02-02 20:18:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:18:41,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:41,041 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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:18:41,041 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:41,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1693610567, now seen corresponding path program 6 times [2018-02-02 20:18:41,042 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:41,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:41,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:41,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:18:41,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:41,422 INFO L182 omatonBuilderFactory]: Interpolants [20608#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 20609#(and (= 0 main_~a~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 20610#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 20611#(and (= main_~p~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem16| 3))), 20612#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 20613#(= 1 (select |#valid| |main_#t~mem18.base|)), 20614#(= 1 (select |#valid| main_~p~0.base)), 20588#true, 20589#false, 20590#(= |main_#t~malloc0.offset| 0), 20591#(= main_~a~0.offset 0), 20592#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20593#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20594#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20595#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 20596#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20597#(and (= (select |#valid| main_~a~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 20598#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 20599#(and (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 20600#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~t~0.base))), 20601#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 20602#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 20603#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base))), 20604#(and (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~malloc5.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 20605#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~t~0.offset)), 20606#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 20607#(and (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~mem7.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))] [2018-02-02 20:18:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:41,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:18:41,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:18:41,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:18:41,423 INFO L87 Difference]: Start difference. First operand 291 states and 335 transitions. Second operand 27 states. [2018-02-02 20:18:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:42,410 INFO L93 Difference]: Finished difference Result 378 states and 431 transitions. [2018-02-02 20:18:42,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:18:42,410 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-02 20:18:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:42,411 INFO L225 Difference]: With dead ends: 378 [2018-02-02 20:18:42,411 INFO L226 Difference]: Without dead ends: 378 [2018-02-02 20:18:42,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=2699, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:18:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-02 20:18:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 315. [2018-02-02 20:18:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 20:18:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 364 transitions. [2018-02-02 20:18:42,413 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 364 transitions. Word has length 60 [2018-02-02 20:18:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:42,413 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 364 transitions. [2018-02-02 20:18:42,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:18:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 364 transitions. [2018-02-02 20:18:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:18:42,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:42,414 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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:18:42,414 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1693610568, now seen corresponding path program 4 times [2018-02-02 20:18:42,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:42,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:43,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:43,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:18:43,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:43,104 INFO L182 omatonBuilderFactory]: Interpolants [21376#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 21377#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 21378#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 21379#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 21380#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 21381#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 21382#(and (<= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 21383#(and (<= 0 main_~p~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 21384#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (<= 8 (select |#length| main_~p~0.base))), 21385#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 21386#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 21387#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~malloc5.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 21388#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset main_~t~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 21389#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 21390#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~mem7.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 21391#(and (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 21392#(and (= 0 main_~a~0.offset) (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 21393#(and (= main_~p~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3))), 21394#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= |main_#t~mem16| 3)) (= main_~p~0.offset 0)), 21395#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 21396#(and (<= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 21397#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 21370#true, 21371#false, 21372#(= |main_#t~malloc0.offset| 0), 21373#(= main_~a~0.offset 0), 21374#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 21375#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:18:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:43,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:18:43,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:18:43,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:18:43,105 INFO L87 Difference]: Start difference. First operand 315 states and 364 transitions. Second operand 28 states. [2018-02-02 20:18:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:44,792 INFO L93 Difference]: Finished difference Result 397 states and 449 transitions. [2018-02-02 20:18:44,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:18:44,793 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-02 20:18:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:44,793 INFO L225 Difference]: With dead ends: 397 [2018-02-02 20:18:44,793 INFO L226 Difference]: Without dead ends: 396 [2018-02-02 20:18:44,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=544, Invalid=2996, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:18:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-02 20:18:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 306. [2018-02-02 20:18:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-02 20:18:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 354 transitions. [2018-02-02 20:18:44,796 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 354 transitions. Word has length 60 [2018-02-02 20:18:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:44,796 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 354 transitions. [2018-02-02 20:18:44,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:18:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 354 transitions. [2018-02-02 20:18:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:18:44,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:44,797 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:18:44,797 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:44,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1076059124, now seen corresponding path program 5 times [2018-02-02 20:18:44,797 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:44,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:45,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:45,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:18:45,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:45,313 INFO L182 omatonBuilderFactory]: Interpolants [22176#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 22177#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 22178#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 22179#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 22180#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem14.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem14.offset|)), 22181#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 22182#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) 3) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 22183#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 22184#(and (= 0 |main_#t~mem21.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ 0 4))) 3)), 22185#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3), 22186#(= (select (select |#memory_int| |main_#t~mem21.base|) |main_#t~mem21.offset|) 3), 22187#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 22188#(= |main_#t~mem19| 3), 22165#true, 22166#false, 22167#(= 0 |main_#t~malloc0.offset|), 22168#(= 0 main_~a~0.offset), 22169#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 22170#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 22171#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 22172#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 22173#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 22174#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 22175#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 20:18:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:45,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:18:45,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:18:45,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:18:45,313 INFO L87 Difference]: Start difference. First operand 306 states and 354 transitions. Second operand 24 states. [2018-02-02 20:18:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:46,162 INFO L93 Difference]: Finished difference Result 355 states and 402 transitions. [2018-02-02 20:18:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:18:46,186 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 20:18:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:46,187 INFO L225 Difference]: With dead ends: 355 [2018-02-02 20:18:46,187 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 20:18:46,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=1949, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:18:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 20:18:46,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 314. [2018-02-02 20:18:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-02 20:18:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-02-02 20:18:46,190 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 62 [2018-02-02 20:18:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:46,190 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-02-02 20:18:46,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:18:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-02-02 20:18:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:18:46,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:46,191 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:46,191 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2053934067, now seen corresponding path program 2 times [2018-02-02 20:18:46,191 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:46,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:46,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:46,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:18:46,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:46,680 INFO L182 omatonBuilderFactory]: Interpolants [22912#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 22913#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 22914#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 22915#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 22916#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 22917#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 22918#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 22919#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 22920#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 22921#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem14.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem14.offset|)), 22922#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 22923#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) 3) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 22924#(and (= main_~p~0.offset 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 22925#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) 3) (= 0 |main_#t~mem18.offset|)), 22926#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 22927#(= (select (select |#memory_int| |main_#t~mem21.base|) |main_#t~mem21.offset|) 3), 22928#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 22929#(= |main_#t~mem19| 3), 22906#true, 22907#false, 22908#(= 0 |main_#t~malloc0.offset|), 22909#(= 0 main_~a~0.offset), 22910#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 22911#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:18:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:46,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:18:46,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:18:46,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:18:46,680 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 24 states. [2018-02-02 20:18:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:47,794 INFO L93 Difference]: Finished difference Result 351 states and 398 transitions. [2018-02-02 20:18:47,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:18:47,794 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 20:18:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:47,795 INFO L225 Difference]: With dead ends: 351 [2018-02-02 20:18:47,795 INFO L226 Difference]: Without dead ends: 351 [2018-02-02 20:18:47,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=1949, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:18:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-02 20:18:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 309. [2018-02-02 20:18:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 20:18:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 357 transitions. [2018-02-02 20:18:47,797 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 357 transitions. Word has length 62 [2018-02-02 20:18:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:47,797 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 357 transitions. [2018-02-02 20:18:47,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:18:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 357 transitions. [2018-02-02 20:18:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:18:47,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:47,798 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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:18:47,798 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1416452140, now seen corresponding path program 3 times [2018-02-02 20:18:47,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:47,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:48,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:48,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:18:48,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:48,223 INFO L182 omatonBuilderFactory]: Interpolants [23648#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 23649#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 23650#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 23651#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 23652#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 23653#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 23654#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) 3) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 23655#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 23656#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) 3) (= 0 |main_#t~mem18.offset|)), 23657#(or (<= (+ main_~p~0.offset 1) 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3)), 23658#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3), 23659#(= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 3), 23660#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 23661#(= |main_#t~mem19| 3), 23638#true, 23639#false, 23640#(= 0 |main_#t~malloc0.offset|), 23641#(= 0 main_~a~0.offset), 23642#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 23643#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 23644#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 23645#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 23646#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 23647#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|))] [2018-02-02 20:18:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:48,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:18:48,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:18:48,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:18:48,224 INFO L87 Difference]: Start difference. First operand 309 states and 357 transitions. Second operand 24 states. [2018-02-02 20:18:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:49,236 INFO L93 Difference]: Finished difference Result 343 states and 389 transitions. [2018-02-02 20:18:49,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:18:49,236 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 20:18:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:49,237 INFO L225 Difference]: With dead ends: 343 [2018-02-02 20:18:49,237 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 20:18:49,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:18:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 20:18:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 306. [2018-02-02 20:18:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-02 20:18:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 353 transitions. [2018-02-02 20:18:49,239 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 353 transitions. Word has length 62 [2018-02-02 20:18:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:49,239 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 353 transitions. [2018-02-02 20:18:49,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:18:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 353 transitions. [2018-02-02 20:18:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:18:49,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:49,240 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:18:49,240 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:49,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1603902090, now seen corresponding path program 6 times [2018-02-02 20:18:49,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:49,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:49,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:49,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:18:49,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:49,677 INFO L182 omatonBuilderFactory]: Interpolants [24357#true, 24358#false, 24359#(= |main_#t~malloc0.offset| 0), 24360#(= main_~a~0.offset 0), 24361#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 24362#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 24363#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 24364#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 24365#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 24366#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= main_~a~0.offset 0)), 24367#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 24368#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 24369#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~t~0.base))), 24370#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 24371#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 24372#(and (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 24373#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 24374#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~t~0.offset)), 24375#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 24376#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset |main_#t~mem14.offset|)), 24377#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 24378#(and (= 0 main_~a~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 24379#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 24380#(and (= main_~p~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem19| 3))), 24381#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 24382#(= 1 (select |#valid| |main_#t~mem21.base|)), 24383#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:18:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:49,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:18:49,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:18:49,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:18:49,677 INFO L87 Difference]: Start difference. First operand 306 states and 353 transitions. Second operand 27 states. [2018-02-02 20:18:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:50,585 INFO L93 Difference]: Finished difference Result 374 states and 424 transitions. [2018-02-02 20:18:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:18:50,585 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-02-02 20:18:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:50,586 INFO L225 Difference]: With dead ends: 374 [2018-02-02 20:18:50,586 INFO L226 Difference]: Without dead ends: 374 [2018-02-02 20:18:50,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=562, Invalid=2518, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:18:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-02-02 20:18:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 327. [2018-02-02 20:18:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 20:18:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 376 transitions. [2018-02-02 20:18:50,589 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 376 transitions. Word has length 63 [2018-02-02 20:18:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:50,589 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 376 transitions. [2018-02-02 20:18:50,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:18:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 376 transitions. [2018-02-02 20:18:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:18:50,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:50,590 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:18:50,590 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1603902089, now seen corresponding path program 4 times [2018-02-02 20:18:50,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:50,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:51,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:51,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:18:51,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:51,038 INFO L182 omatonBuilderFactory]: Interpolants [25152#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0)), 25153#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 25154#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 25155#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 25156#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (+ main_~p~0.offset 8) (select |#length| main_~p~0.base))), 25157#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 25158#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 25159#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 25160#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 25161#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 25162#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 25163#(and (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 25164#(and (= 0 main_~a~0.offset) (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 25165#(and (= main_~p~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3))), 25166#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= |main_#t~mem19| 3)) (= main_~p~0.offset 0)), 25167#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 25168#(and (= 0 |main_#t~mem21.offset|) (<= 8 (select |#length| |main_#t~mem21.base|))), 25169#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 25143#true, 25144#false, 25145#(= |main_#t~malloc0.offset| 0), 25146#(= main_~a~0.offset 0), 25147#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 25148#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 25149#(and (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 25150#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 25151#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:18:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:51,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:18:51,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:18:51,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:18:51,038 INFO L87 Difference]: Start difference. First operand 327 states and 376 transitions. Second operand 27 states. [2018-02-02 20:18:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:52,276 INFO L93 Difference]: Finished difference Result 392 states and 441 transitions. [2018-02-02 20:18:52,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:18:52,276 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-02-02 20:18:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:52,277 INFO L225 Difference]: With dead ends: 392 [2018-02-02 20:18:52,277 INFO L226 Difference]: Without dead ends: 391 [2018-02-02 20:18:52,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=495, Invalid=2367, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:18:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-02 20:18:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 327. [2018-02-02 20:18:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 20:18:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 376 transitions. [2018-02-02 20:18:52,280 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 376 transitions. Word has length 63 [2018-02-02 20:18:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:52,280 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 376 transitions. [2018-02-02 20:18:52,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:18:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 376 transitions. [2018-02-02 20:18:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:18:52,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:52,280 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:18:52,280 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:52,280 INFO L82 PathProgramCache]: Analyzing trace with hash 245040054, now seen corresponding path program 2 times [2018-02-02 20:18:52,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:52,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:52,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:52,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:18:52,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:52,616 INFO L182 omatonBuilderFactory]: Interpolants [25943#true, 25944#false, 25945#(= |main_#t~malloc0.offset| 0), 25946#(= main_~a~0.offset 0), 25947#(and (= main_~a~0.offset 0) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 25948#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 25949#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 25950#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 25951#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 25952#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25953#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 25954#(and (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 25955#(and (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 25956#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25957#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25958#(and (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset))), 25959#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 25960#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25961#(and (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25962#(and (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25963#(or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))), 25964#(or (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25965#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 25966#(or (= 1 |main_#t~mem16|) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 25967#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 25968#(= |main_#t~mem19| 3)] [2018-02-02 20:18:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:52,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:18:52,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:18:52,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:18:52,617 INFO L87 Difference]: Start difference. First operand 327 states and 376 transitions. Second operand 26 states. [2018-02-02 20:18:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:53,702 INFO L93 Difference]: Finished difference Result 471 states and 532 transitions. [2018-02-02 20:18:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:18:53,702 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-02-02 20:18:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:53,703 INFO L225 Difference]: With dead ends: 471 [2018-02-02 20:18:53,703 INFO L226 Difference]: Without dead ends: 468 [2018-02-02 20:18:53,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=522, Invalid=2130, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:18:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-02 20:18:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 333. [2018-02-02 20:18:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-02 20:18:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 383 transitions. [2018-02-02 20:18:53,706 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 383 transitions. Word has length 63 [2018-02-02 20:18:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:53,707 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 383 transitions. [2018-02-02 20:18:53,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:18:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 383 transitions. [2018-02-02 20:18:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:18:53,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:53,707 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:53,707 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1402038168, now seen corresponding path program 5 times [2018-02-02 20:18:53,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:53,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:54,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:54,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:18:54,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:54,373 INFO L182 omatonBuilderFactory]: Interpolants [26825#true, 26826#false, 26827#(= |main_#t~malloc0.offset| 0), 26828#(= main_~a~0.offset 0), 26829#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 26830#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26831#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 26832#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 26833#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26834#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 26835#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 26836#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 26837#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 26838#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2) (not (= main_~a~0.base main_~t~0.base))), 26839#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 26840#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0)), 26841#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base main_~a~0.base))), 26842#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 26843#(and (not (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~t~0.offset) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) 2) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base))), 26844#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 26845#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset |main_#t~mem14.offset|)), 26846#(and (= 0 main_~a~0.offset) (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base main_~a~0.base))))), 26847#(and (= 0 main_~a~0.offset) (or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 26848#(and (= main_~p~0.offset 0) (or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3))), 26849#(and (= main_~p~0.offset 0) (or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2) (and (= |main_#t~mem16| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)))), 26850#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2) (= main_~p~0.offset 0)), 26851#(= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 2), 26852#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 26853#(= |main_#t~mem16| 2)] [2018-02-02 20:18:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:54,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:18:54,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:18:54,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:18:54,374 INFO L87 Difference]: Start difference. First operand 333 states and 383 transitions. Second operand 29 states. [2018-02-02 20:18:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:55,875 INFO L93 Difference]: Finished difference Result 405 states and 455 transitions. [2018-02-02 20:18:55,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:18:55,875 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-02-02 20:18:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:55,876 INFO L225 Difference]: With dead ends: 405 [2018-02-02 20:18:55,876 INFO L226 Difference]: Without dead ends: 405 [2018-02-02 20:18:55,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=538, Invalid=3122, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:18:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-02 20:18:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 343. [2018-02-02 20:18:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 20:18:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 393 transitions. [2018-02-02 20:18:55,879 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 393 transitions. Word has length 65 [2018-02-02 20:18:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:55,879 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 393 transitions. [2018-02-02 20:18:55,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:18:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 393 transitions. [2018-02-02 20:18:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:18:55,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:55,879 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:55,879 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1317070014, now seen corresponding path program 6 times [2018-02-02 20:18:55,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:55,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:56,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:56,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:18:56,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:56,690 INFO L182 omatonBuilderFactory]: Interpolants [27666#true, 27667#false, 27668#(= |main_#t~malloc0.offset| 0), 27669#(= main_~a~0.offset 0), 27670#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 27671#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 27672#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 27673#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1)), 27674#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 27675#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 27676#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (or (<= (+ main_~p~0.offset 1) 0) (= main_~p~0.offset 0)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 27677#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 27678#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 27679#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 27680#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 27681#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 27682#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base))), 27683#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 27684#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset main_~t~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base))), 27685#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base))), 27686#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset |main_#t~mem14.offset|)), 27687#(and (= 0 main_~a~0.offset) (or (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 27688#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 27689#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 27690#(and (= main_~p~0.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (and (= |main_#t~mem16| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)))), 27691#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 27692#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 |main_#t~mem18.offset|)), 27693#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 27694#(= 1 (select |#valid| |main_#t~mem18.base|)), 27695#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:18:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:56,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:18:56,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:18:56,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:18:56,691 INFO L87 Difference]: Start difference. First operand 343 states and 393 transitions. Second operand 30 states. [2018-02-02 20:18:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:18:58,508 INFO L93 Difference]: Finished difference Result 415 states and 467 transitions. [2018-02-02 20:18:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 20:18:58,508 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-02-02 20:18:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:18:58,509 INFO L225 Difference]: With dead ends: 415 [2018-02-02 20:18:58,509 INFO L226 Difference]: Without dead ends: 415 [2018-02-02 20:18:58,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=631, Invalid=3529, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:18:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-02-02 20:18:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 357. [2018-02-02 20:18:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-02-02 20:18:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 409 transitions. [2018-02-02 20:18:58,511 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 409 transitions. Word has length 65 [2018-02-02 20:18:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:18:58,512 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 409 transitions. [2018-02-02 20:18:58,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:18:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 409 transitions. [2018-02-02 20:18:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:18:58,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:18:58,512 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:18:58,512 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:18:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1317070015, now seen corresponding path program 4 times [2018-02-02 20:18:58,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:18:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:18:58,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:18:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:59,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:18:59,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:18:59,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:18:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:59,636 INFO L182 omatonBuilderFactory]: Interpolants [28544#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~p~0.base main_~a~0.base)), 28545#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base)) (= main_~t~0.offset 0)), 28546#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 28547#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|) (= 1 (select |#valid| |main_#t~mem7.base|))), 28548#(and (= (select |#valid| main_~a~0.base) 1) (or (and (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (<= (+ main_~p~0.offset 1) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base))), 28549#(and (= (select |#valid| main_~a~0.base) 1) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base))), 28550#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 8 (select |#length| |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 28551#(and (= 8 (select |#length| main_~t~0.base)) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base)) (= (select |#valid| main_~t~0.base) 1)), 28552#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base))), 28553#(and (= 8 (select |#length| |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select |#valid| |main_#t~mem7.base|) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 28554#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (= 8 (select |#length| main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base))), 28555#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc12.base|)) (= 8 (select |#length| main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base))), 28556#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset main_~t~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base)) (= 8 (select |#length| main_~p~0.base))), 28557#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 28558#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset |main_#t~mem14.offset|)), 28559#(and (= 0 main_~a~0.offset) (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 28560#(and (= 0 main_~a~0.offset) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 28561#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 28562#(and (= main_~p~0.offset 0) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (and (= |main_#t~mem16| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)))), 28563#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 28564#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) (= 0 |main_#t~mem18.offset|)), 28565#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 28566#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 28567#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base))), 28538#true, 28539#false, 28540#(= |main_#t~malloc0.offset| 0), 28541#(= main_~a~0.offset 0), 28542#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 28543#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:18:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:18:59,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:18:59,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:18:59,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:18:59,637 INFO L87 Difference]: Start difference. First operand 357 states and 409 transitions. Second operand 30 states. [2018-02-02 20:19:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:01,668 INFO L93 Difference]: Finished difference Result 439 states and 494 transitions. [2018-02-02 20:19:01,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:19:01,669 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-02-02 20:19:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:01,670 INFO L225 Difference]: With dead ends: 439 [2018-02-02 20:19:01,670 INFO L226 Difference]: Without dead ends: 439 [2018-02-02 20:19:01,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=474, Invalid=2948, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:19:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-02 20:19:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 361. [2018-02-02 20:19:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-02 20:19:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 414 transitions. [2018-02-02 20:19:01,672 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 414 transitions. Word has length 65 [2018-02-02 20:19:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:01,672 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 414 transitions. [2018-02-02 20:19:01,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:19:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 414 transitions. [2018-02-02 20:19:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:19:01,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:01,673 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:01,673 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:01,673 INFO L82 PathProgramCache]: Analyzing trace with hash -400362968, now seen corresponding path program 7 times [2018-02-02 20:19:01,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:01,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:02,686 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:19:02,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:02,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:19:02,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:02,686 INFO L182 omatonBuilderFactory]: Interpolants [29440#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 29441#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base))), 29442#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~malloc5.offset|) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc5.base|)) (not (= main_~p~0.base main_~a~0.base))), 29443#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset main_~t~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base))), 29444#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 29445#(and (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~mem7.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 29446#(or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))), 29447#(or (and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3)), 29448#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 29449#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (and (= |main_#t~mem16| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3))), 29450#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 29451#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 |main_#t~mem18.offset|)), 29452#(or (<= (+ main_~p~0.offset 1) 0) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0))), 29453#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 29454#(= 1 (select |#valid| |main_#t~mem18.base|)), 29455#(= 1 (select |#valid| main_~p~0.base)), 29426#true, 29427#false, 29428#(= |main_#t~malloc0.offset| 0), 29429#(= main_~a~0.offset 0), 29430#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 29431#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 29432#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 29433#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0) (= (select |#valid| main_~t~0.base) 1)), 29434#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 29435#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 29436#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 29437#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 29438#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 29439#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))] [2018-02-02 20:19:02,687 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:19:02,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:19:02,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:19:02,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:19:02,687 INFO L87 Difference]: Start difference. First operand 361 states and 414 transitions. Second operand 30 states. [2018-02-02 20:19:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:04,839 INFO L93 Difference]: Finished difference Result 429 states and 483 transitions. [2018-02-02 20:19:04,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:19:04,839 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-02-02 20:19:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:04,840 INFO L225 Difference]: With dead ends: 429 [2018-02-02 20:19:04,840 INFO L226 Difference]: Without dead ends: 429 [2018-02-02 20:19:04,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=660, Invalid=3762, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 20:19:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-02-02 20:19:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 365. [2018-02-02 20:19:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 20:19:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 419 transitions. [2018-02-02 20:19:04,843 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 419 transitions. Word has length 65 [2018-02-02 20:19:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:04,843 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 419 transitions. [2018-02-02 20:19:04,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:19:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 419 transitions. [2018-02-02 20:19:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:19:04,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:04,844 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:04,844 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash -400362967, now seen corresponding path program 5 times [2018-02-02 20:19:04,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:04,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:05,789 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:19:05,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:05,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:19:05,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:05,790 INFO L182 omatonBuilderFactory]: Interpolants [30336#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 8 (select |#length| |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 30337#(and (= 8 (select |#length| main_~t~0.base)) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base)) (= (select |#valid| main_~t~0.base) 1)), 30338#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 30339#(and (= 8 (select |#length| |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select |#valid| |main_#t~mem7.base|) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 30340#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 30341#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~malloc5.offset|) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 30342#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset main_~t~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base)) (= 8 (select |#length| main_~p~0.base))), 30343#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 30344#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= main_~a~0.offset |main_#t~mem7.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 30345#(and (= 0 main_~a~0.offset) (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 30346#(and (= 0 main_~a~0.offset) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 30347#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 30348#(and (= main_~p~0.offset 0) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (and (= |main_#t~mem16| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)))), 30349#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 30350#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) (= 0 |main_#t~mem18.offset|)), 30351#(or (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 30352#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 30353#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 30354#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base))), 30324#true, 30325#false, 30326#(= |main_#t~malloc0.offset| 0), 30327#(= main_~a~0.offset 0), 30328#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 30329#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 30330#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~p~0.base main_~a~0.base)), 30331#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base)) (= main_~t~0.offset 0)), 30332#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 30333#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|) (= 1 (select |#valid| |main_#t~mem7.base|))), 30334#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (<= (+ main_~p~0.offset 1) 0))), 30335#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 20:19:05,790 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:19:05,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 20:19:05,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 20:19:05,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:19:05,790 INFO L87 Difference]: Start difference. First operand 365 states and 419 transitions. Second operand 31 states. [2018-02-02 20:19:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:07,801 INFO L93 Difference]: Finished difference Result 453 states and 510 transitions. [2018-02-02 20:19:07,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:19:07,801 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2018-02-02 20:19:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:07,802 INFO L225 Difference]: With dead ends: 453 [2018-02-02 20:19:07,802 INFO L226 Difference]: Without dead ends: 453 [2018-02-02 20:19:07,802 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=494, Invalid=3046, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:19:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-02 20:19:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 351. [2018-02-02 20:19:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-02 20:19:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 403 transitions. [2018-02-02 20:19:07,804 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 403 transitions. Word has length 65 [2018-02-02 20:19:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:07,804 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 403 transitions. [2018-02-02 20:19:07,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 20:19:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 403 transitions. [2018-02-02 20:19:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:19:07,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:07,805 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 20:19:07,805 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:07,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1242555573, now seen corresponding path program 2 times [2018-02-02 20:19:07,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:07,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:19:07,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:07,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:19:07,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,831 INFO L182 omatonBuilderFactory]: Interpolants [31217#true, 31218#false, 31219#(and (= main_~y~0 0) (= main_~i~0 0)), 31220#(and (<= main_~y~0 1) (= main_~i~0 0)), 31221#(and (<= main_~y~0 2) (= main_~i~0 0))] [2018-02-02 20:19:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:19:07,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:19:07,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:19:07,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:07,832 INFO L87 Difference]: Start difference. First operand 351 states and 403 transitions. Second operand 5 states. [2018-02-02 20:19:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:07,850 INFO L93 Difference]: Finished difference Result 380 states and 430 transitions. [2018-02-02 20:19:07,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:19:07,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 20:19:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:07,851 INFO L225 Difference]: With dead ends: 380 [2018-02-02 20:19:07,851 INFO L226 Difference]: Without dead ends: 360 [2018-02-02 20:19:07,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-02-02 20:19:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 350. [2018-02-02 20:19:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 20:19:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 405 transitions. [2018-02-02 20:19:07,854 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 405 transitions. Word has length 67 [2018-02-02 20:19:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:07,854 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 405 transitions. [2018-02-02 20:19:07,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:19:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 405 transitions. [2018-02-02 20:19:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:19:07,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:07,854 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, 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:19:07,855 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:07,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1970809554, now seen corresponding path program 1 times [2018-02-02 20:19:07,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:07,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:19:07,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:07,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:19:07,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,880 INFO L182 omatonBuilderFactory]: Interpolants [31952#true, 31953#false, 31954#(and (= main_~y~0 0) (= main_~i~0 0)), 31955#(and (= main_~y~0 0) (<= main_~i~0 1)), 31956#(<= (+ main_~i~0 main_~y~0) 2)] [2018-02-02 20:19:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:19:07,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:19:07,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:19:07,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:07,880 INFO L87 Difference]: Start difference. First operand 350 states and 405 transitions. Second operand 5 states. [2018-02-02 20:19:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:07,900 INFO L93 Difference]: Finished difference Result 379 states and 433 transitions. [2018-02-02 20:19:07,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:19:07,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 20:19:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:07,901 INFO L225 Difference]: With dead ends: 379 [2018-02-02 20:19:07,901 INFO L226 Difference]: Without dead ends: 344 [2018-02-02 20:19:07,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-02-02 20:19:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2018-02-02 20:19:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-02-02 20:19:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 377 transitions. [2018-02-02 20:19:07,903 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 377 transitions. Word has length 67 [2018-02-02 20:19:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:07,903 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 377 transitions. [2018-02-02 20:19:07,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:19:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 377 transitions. [2018-02-02 20:19:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:19:07,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:07,903 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:19:07,903 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:07,904 INFO L82 PathProgramCache]: Analyzing trace with hash -680046676, now seen corresponding path program 7 times [2018-02-02 20:19:07,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:07,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:19:08,655 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:19:08,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:08,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:19:08,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:08,656 INFO L182 omatonBuilderFactory]: Interpolants [32656#true, 32657#false, 32658#(= |main_#t~malloc0.offset| 0), 32659#(= main_~a~0.offset 0), 32660#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 32661#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 32662#(and (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 32663#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 32664#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 32665#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0)), 32666#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 32667#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 32668#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 32669#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 32670#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 32671#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0)), 32672#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 32673#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 32674#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset main_~t~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base))), 32675#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base))), 32676#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset |main_#t~mem14.offset|)), 32677#(or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))), 32678#(or (and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3)), 32679#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 32680#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (and (= |main_#t~mem19| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3))), 32681#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 32682#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ 0 4)))) (= 0 |main_#t~mem21.offset|)), 32683#(or (<= (+ main_~p~0.offset 1) 0) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0))), 32684#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 32685#(= 1 (select |#valid| |main_#t~mem21.base|)), 32686#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:19:08,656 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:19:08,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 20:19:08,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 20:19:08,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:19:08,657 INFO L87 Difference]: Start difference. First operand 320 states and 377 transitions. Second operand 31 states. [2018-02-02 20:19:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:10,228 INFO L93 Difference]: Finished difference Result 361 states and 419 transitions. [2018-02-02 20:19:10,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:19:10,229 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-02-02 20:19:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:10,230 INFO L225 Difference]: With dead ends: 361 [2018-02-02 20:19:10,230 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 20:19:10,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=571, Invalid=3589, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:19:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 20:19:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 325. [2018-02-02 20:19:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 20:19:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 382 transitions. [2018-02-02 20:19:10,232 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 382 transitions. Word has length 68 [2018-02-02 20:19:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:10,232 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 382 transitions. [2018-02-02 20:19:10,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 20:19:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 382 transitions. [2018-02-02 20:19:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:19:10,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:10,233 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:19:10,233 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash -680046675, now seen corresponding path program 5 times [2018-02-02 20:19:10,233 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:10,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:11,170 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:19:11,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:11,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:19:11,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:11,171 INFO L182 omatonBuilderFactory]: Interpolants [33441#true, 33442#false, 33443#(= |main_#t~malloc0.offset| 0), 33444#(= main_~a~0.offset 0), 33445#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 33446#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 33447#(and (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 33448#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 33449#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 33450#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0)), 33451#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 33452#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 33453#(and (= (select |#valid| |main_#t~malloc12.base|) 1) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 33454#(and (= 8 (select |#length| main_~t~0.base)) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base)) (= (select |#valid| main_~t~0.base) 1)), 33455#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base))), 33456#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select |#valid| |main_#t~mem14.base|) 1)), 33457#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (= 8 (select |#length| main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base))), 33458#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc12.base|)) (= 8 (select |#length| main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 33459#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base)) (= 8 (select |#length| main_~p~0.base))), 33460#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 8 (select |#length| main_~p~0.base))), 33461#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 33462#(and (= 0 main_~a~0.offset) (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 33463#(and (= 0 main_~a~0.offset) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 33464#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 33465#(and (= main_~p~0.offset 0) (or (and (= |main_#t~mem19| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))), 33466#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 33467#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ 0 4)))), 33468#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 33469#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 33470#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:19:11,171 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:19:11,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:19:11,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:19:11,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:19:11,172 INFO L87 Difference]: Start difference. First operand 325 states and 382 transitions. Second operand 30 states. [2018-02-02 20:19:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:12,844 INFO L93 Difference]: Finished difference Result 381 states and 438 transitions. [2018-02-02 20:19:12,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:19:12,844 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-02-02 20:19:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:12,845 INFO L225 Difference]: With dead ends: 381 [2018-02-02 20:19:12,845 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 20:19:12,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=439, Invalid=2753, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 20:19:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 20:19:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 325. [2018-02-02 20:19:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 20:19:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 382 transitions. [2018-02-02 20:19:12,847 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 382 transitions. Word has length 68 [2018-02-02 20:19:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:12,847 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 382 transitions. [2018-02-02 20:19:12,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:19:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 382 transitions. [2018-02-02 20:19:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:19:12,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:12,848 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1] [2018-02-02 20:19:12,848 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 900627935, now seen corresponding path program 3 times [2018-02-02 20:19:12,848 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:12,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:13,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:13,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:19:13,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:13,566 INFO L182 omatonBuilderFactory]: Interpolants [34240#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 34241#(and (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 34242#(and (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 34243#(and (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 34244#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 34245#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 34246#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0)), 34247#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base))), 34248#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc12.base|)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 34249#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base))), 34250#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 34251#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 34252#(and (= 0 main_~a~0.offset) (or (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 34253#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 34254#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 34255#(and (= main_~p~0.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (and (= |main_#t~mem16| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)))), 34256#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 34257#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 |main_#t~mem18.offset|)), 34258#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 34259#(= 1 (select |#valid| |main_#t~mem21.base|)), 34260#(= 1 (select |#valid| main_~p~0.base)), 34231#true, 34232#false, 34233#(= |main_#t~malloc0.offset| 0), 34234#(= main_~a~0.offset 0), 34235#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 34236#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 34237#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 34238#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 34239#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:19:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:13,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:19:13,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:19:13,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:19:13,566 INFO L87 Difference]: Start difference. First operand 325 states and 382 transitions. Second operand 30 states. [2018-02-02 20:19:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:15,091 INFO L93 Difference]: Finished difference Result 368 states and 426 transitions. [2018-02-02 20:19:15,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:19:15,091 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-02-02 20:19:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:15,092 INFO L225 Difference]: With dead ends: 368 [2018-02-02 20:19:15,092 INFO L226 Difference]: Without dead ends: 368 [2018-02-02 20:19:15,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=520, Invalid=3140, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:19:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-02 20:19:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 330. [2018-02-02 20:19:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:19:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 387 transitions. [2018-02-02 20:19:15,094 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 387 transitions. Word has length 68 [2018-02-02 20:19:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:15,094 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 387 transitions. [2018-02-02 20:19:15,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:19:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 387 transitions. [2018-02-02 20:19:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:19:15,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:15,095 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1] [2018-02-02 20:19:15,095 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash 900627936, now seen corresponding path program 2 times [2018-02-02 20:19:15,095 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:15,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 20:19:15,630 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:19:15,633 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:19:15,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:19:15 BoogieIcfgContainer [2018-02-02 20:19:15,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:19:15,635 INFO L168 Benchmark]: Toolchain (without parser) took 74058.83 ms. Allocated memory was 406.8 MB in the beginning and 1.3 GB in the end (delta: 930.1 MB). Free memory was 363.7 MB in the beginning and 975.6 MB in the end (delta: -611.9 MB). Peak memory consumption was 318.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:15,636 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 406.8 MB. Free memory is still 370.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:19:15,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.93 ms. Allocated memory is still 406.8 MB. Free memory was 363.7 MB in the beginning and 353.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:15,636 INFO L168 Benchmark]: Boogie Preprocessor took 26.95 ms. Allocated memory is still 406.8 MB. Free memory was 353.1 MB in the beginning and 350.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:15,637 INFO L168 Benchmark]: RCFGBuilder took 428.56 ms. Allocated memory is still 406.8 MB. Free memory was 350.5 MB in the beginning and 320.5 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:15,637 INFO L168 Benchmark]: TraceAbstraction took 73440.63 ms. Allocated memory was 406.8 MB in the beginning and 1.3 GB in the end (delta: 930.1 MB). Free memory was 320.5 MB in the beginning and 975.6 MB in the end (delta: -655.1 MB). Peak memory consumption was 275.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:15,638 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.15 ms. Allocated memory is still 406.8 MB. Free memory is still 370.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.93 ms. Allocated memory is still 406.8 MB. Free memory was 363.7 MB in the beginning and 353.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.95 ms. Allocated memory is still 406.8 MB. Free memory was 353.1 MB in the beginning and 350.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 428.56 ms. Allocated memory is still 406.8 MB. Free memory was 350.5 MB in the beginning and 320.5 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 73440.63 ms. Allocated memory was 406.8 MB in the beginning and 1.3 GB in the end (delta: 930.1 MB). Free memory was 320.5 MB in the beginning and 975.6 MB in the end (delta: -655.1 MB). Peak memory consumption was 275.0 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 639). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 33 error locations. TIMEOUT Result, 73.3s OverallTime, 62 OverallIterations, 4 TraceHistogramMax, 49.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5156 SDtfs, 22109 SDslu, 47330 SDs, 0 SdLazy, 50929 SolverSat, 4126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2279 GetRequests, 113 SyntacticMatches, 24 SemanticMatches, 2142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20886 ImplicationChecksByTransitivity, 42.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 127/1273 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 61 MinimizatonAttempts, 3698 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 3078 NumberOfCodeBlocks, 3078 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 3017 ConstructedInterpolants, 0 QuantifiedInterpolants, 3438368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 10 PerfectInterpolantSequences, 127/1273 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/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-19-15-645.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-19-15-645.csv Completed graceful shutdown