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/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:33:27,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:33:27,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:33:27,368 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:33:27,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:33:27,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:33:27,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:33:27,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:33:27,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:33:27,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:33:27,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:33:27,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:33:27,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:33:27,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:33:27,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:33:27,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:33:27,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:33:27,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:33:27,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:33:27,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:33:27,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:33:27,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:33:27,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:33:27,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:33:27,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:33:27,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:33:27,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:33:27,391 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:33:27,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:33:27,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:33:27,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:33:27,392 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:33:27,403 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:33:27,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:33:27,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:33:27,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:33:27,405 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:33:27,405 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:33:27,405 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:33:27,405 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:33:27,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:33:27,406 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:33:27,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:33:27,406 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:33:27,406 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:33:27,406 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:33:27,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:33:27,406 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:33:27,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:33:27,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:33:27,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:33:27,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:33:27,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:33:27,407 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:33:27,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:33:27,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:33:27,452 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:33:27,456 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:33:27,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:33:27,458 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:33:27,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-02-02 20:33:27,612 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:33:27,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:33:27,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:33:27,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:33:27,620 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:33:27,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:33:27" (1/1) ... [2018-02-02 20:33:27,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe7432b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27, skipping insertion in model container [2018-02-02 20:33:27,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:33:27" (1/1) ... [2018-02-02 20:33:27,637 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:33:27,673 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:33:27,764 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:33:27,779 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:33:27,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27 WrapperNode [2018-02-02 20:33:27,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:33:27,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:33:27,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:33:27,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:33:27,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27" (1/1) ... [2018-02-02 20:33:27,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27" (1/1) ... [2018-02-02 20:33:27,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27" (1/1) ... [2018-02-02 20:33:27,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27" (1/1) ... [2018-02-02 20:33:27,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27" (1/1) ... [2018-02-02 20:33:27,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27" (1/1) ... [2018-02-02 20:33:27,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27" (1/1) ... [2018-02-02 20:33:27,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:33:27,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:33:27,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:33:27,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:33:27,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27" (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:33:27,845 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:33:27,845 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:33:27,845 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 20:33:27,846 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 20:33:27,846 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 20:33:27,846 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 20:33:27,846 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:33:27,846 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:33:27,846 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:33:27,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:33:27,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:33:27,846 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:33:27,846 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:33:27,846 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:33:27,846 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:33:27,846 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 20:33:27,847 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 20:33:27,847 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 20:33:27,847 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 20:33:27,847 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:33:27,847 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:33:27,847 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:33:28,048 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:33:28,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:33:28 BoogieIcfgContainer [2018-02-02 20:33:28,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:33:28,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:33:28,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:33:28,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:33:28,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:33:27" (1/3) ... [2018-02-02 20:33:28,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71632211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:33:28, skipping insertion in model container [2018-02-02 20:33:28,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:33:27" (2/3) ... [2018-02-02 20:33:28,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71632211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:33:28, skipping insertion in model container [2018-02-02 20:33:28,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:33:28" (3/3) ... [2018-02-02 20:33:28,053 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-02-02 20:33:28,058 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:33:28,063 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 20:33:28,086 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:33:28,086 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:33:28,086 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:33:28,086 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:33:28,086 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:33:28,086 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:33:28,087 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:33:28,087 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:33:28,087 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:33:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-02-02 20:33:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:33:28,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:28,107 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:28,107 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-02-02 20:33:28,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:28,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:33:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:28,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:33:28,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,262 INFO L182 omatonBuilderFactory]: Interpolants [76#true, 77#false, 78#(= |#valid| |old(#valid)|)] [2018-02-02 20:33:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:33:28,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:33:28,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:33:28,273 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-02-02 20:33:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:28,441 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2018-02-02 20:33:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:33:28,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 20:33:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:28,451 INFO L225 Difference]: With dead ends: 121 [2018-02-02 20:33:28,451 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 20:33:28,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:33:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 20:33:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-02 20:33:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 20:33:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-02-02 20:33:28,490 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-02-02 20:33:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:28,491 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-02-02 20:33:28,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:33:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-02-02 20:33:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:33:28,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:28,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:28,492 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:28,492 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-02-02 20:33:28,494 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:28,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:28,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:33:28,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,556 INFO L182 omatonBuilderFactory]: Interpolants [299#true, 300#false, 301#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 302#(and (= 0 |entry_point_#t~ret10.base|) (= 0 |entry_point_#t~ret10.offset|)), 303#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 20:33:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:33:28,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:33:28,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:33:28,558 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-02-02 20:33:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:28,580 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-02-02 20:33:28,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:33:28,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 20:33:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:28,584 INFO L225 Difference]: With dead ends: 94 [2018-02-02 20:33:28,584 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 20:33:28,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:33:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 20:33:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-02-02 20:33:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 20:33:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-02 20:33:28,596 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-02-02 20:33:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:28,596 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-02 20:33:28,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:33:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-02 20:33:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:33:28,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:28,597 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:28,597 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-02-02 20:33:28,598 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:28,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:28,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:33:28,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:28,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:33:28,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:28,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:33:28,678 INFO L182 omatonBuilderFactory]: Interpolants [470#true, 471#false, 472#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 473#(not (= 0 |ldv_malloc_#res.base|)), 474#(not (= 0 |entry_point_#t~ret10.base|)), 475#(not (= 0 entry_point_~array~0.base))] [2018-02-02 20:33:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:33:28,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:33:28,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:28,679 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-02 20:33:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:28,702 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-02 20:33:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:33:28,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 20:33:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:28,703 INFO L225 Difference]: With dead ends: 72 [2018-02-02 20:33:28,703 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 20:33:28,703 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:33:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 20:33:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 20:33:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 20:33:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 20:33:28,706 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-02-02 20:33:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:28,706 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 20:33:28,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:33:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 20:33:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:33:28,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:28,707 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:28,707 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-02-02 20:33:28,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:28,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:28,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:33:28,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,768 INFO L182 omatonBuilderFactory]: Interpolants [624#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 625#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 626#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 627#(= 1 (select |#valid| entry_point_~array~0.base)), 622#true, 623#false] [2018-02-02 20:33:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:28,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:33:28,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:33:28,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:28,769 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-02 20:33:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:28,839 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-02 20:33:28,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:33:28,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 20:33:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:28,840 INFO L225 Difference]: With dead ends: 71 [2018-02-02 20:33:28,840 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 20:33:28,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:33:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 20:33:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 20:33:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 20:33:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 20:33:28,843 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-02 20:33:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:28,843 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 20:33:28,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:33:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 20:33:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:33:28,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:28,844 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:28,844 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-02-02 20:33:28,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:28,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:29,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:29,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:33:29,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:29,051 INFO L182 omatonBuilderFactory]: Interpolants [772#true, 773#false, 774#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 775#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 776#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 777#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 778#(and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 779#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 780#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))] [2018-02-02 20:33:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:29,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:33:29,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:33:29,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:33:29,052 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-02-02 20:33:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:29,230 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 20:33:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:33:29,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 20:33:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:29,231 INFO L225 Difference]: With dead ends: 75 [2018-02-02 20:33:29,231 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 20:33:29,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:33:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 20:33:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-02-02 20:33:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 20:33:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 20:33:29,237 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-02-02 20:33:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:29,237 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 20:33:29,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:33:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 20:33:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:33:29,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:29,238 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:29,238 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-02-02 20:33:29,239 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:29,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:29,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:29,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:33:29,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:29,478 INFO L182 omatonBuilderFactory]: Interpolants [944#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 945#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 946#(or (and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 947#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 948#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))) (= entry_point_~i~2 0)), 949#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 950#(and (<= (+ (* 4 entry_point_~i~2) 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 940#true, 941#false, 942#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 943#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)))] [2018-02-02 20:33:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:29,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:33:29,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:33:29,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:33:29,478 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 11 states. [2018-02-02 20:33:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:29,683 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-02-02 20:33:29,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:33:29,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 20:33:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:29,684 INFO L225 Difference]: With dead ends: 80 [2018-02-02 20:33:29,684 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 20:33:29,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:33:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 20:33:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-02-02 20:33:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 20:33:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-02-02 20:33:29,687 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 23 [2018-02-02 20:33:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:29,687 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-02-02 20:33:29,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:33:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-02-02 20:33:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:33:29,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:29,688 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:29,688 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-02-02 20:33:29,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:29,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:29,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:29,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:33:29,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:29,857 INFO L182 omatonBuilderFactory]: Interpolants [1123#true, 1124#false, 1125#(<= entry_point_~len~0 10), 1126#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 1127#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 1128#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 1129#(or (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 1130#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1131#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1132#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1133#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 1134#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1135#(and (<= (+ (* 4 entry_point_~i~2) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))] [2018-02-02 20:33:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:29,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:33:29,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:33:29,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:33:29,858 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 13 states. [2018-02-02 20:33:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:30,121 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 20:33:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:33:30,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 20:33:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:30,123 INFO L225 Difference]: With dead ends: 77 [2018-02-02 20:33:30,123 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 20:33:30,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:33:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 20:33:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-02-02 20:33:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 20:33:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 20:33:30,128 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 27 [2018-02-02 20:33:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:30,129 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 20:33:30,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:33:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 20:33:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:33:30,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:30,130 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:30,130 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1824994908, now seen corresponding path program 1 times [2018-02-02 20:33:30,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:30,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:33:30,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:30,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:33:30,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:30,183 INFO L182 omatonBuilderFactory]: Interpolants [1299#true, 1300#false, 1301#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1302#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1303#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 20:33:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:33:30,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:33:30,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:33:30,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:33:30,185 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 5 states. [2018-02-02 20:33:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:30,197 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-02 20:33:30,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:33:30,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 20:33:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:30,199 INFO L225 Difference]: With dead ends: 76 [2018-02-02 20:33:30,199 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 20:33:30,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:33:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 20:33:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-02 20:33:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 20:33:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 20:33:30,204 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 34 [2018-02-02 20:33:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:30,204 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 20:33:30,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:33:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 20:33:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:33:30,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:30,205 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:30,205 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1514452229, now seen corresponding path program 1 times [2018-02-02 20:33:30,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:30,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:30,246 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:33:30,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:30,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:33:30,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,248 INFO L182 omatonBuilderFactory]: Interpolants [1456#(= 1 (select |#valid| entry_point_~array~0.base)), 1457#(= |#valid| |old(#valid)|), 1458#(= 1 (select |#valid| |free_17_#in~array.base|)), 1459#(= 1 (select |#valid| free_17_~array.base)), 1454#true, 1455#false] [2018-02-02 20:33:30,248 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:33:30,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:33:30,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:33:30,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:30,249 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 6 states. [2018-02-02 20:33:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:30,371 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-02-02 20:33:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:33:30,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 20:33:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:30,372 INFO L225 Difference]: With dead ends: 117 [2018-02-02 20:33:30,372 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 20:33:30,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:33:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 20:33:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2018-02-02 20:33:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 20:33:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-02-02 20:33:30,378 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 35 [2018-02-02 20:33:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:30,379 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-02-02 20:33:30,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:33:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-02-02 20:33:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:33:30,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:30,380 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:30,380 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1514452230, now seen corresponding path program 1 times [2018-02-02 20:33:30,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:30,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:30,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:33:30,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,411 INFO L182 omatonBuilderFactory]: Interpolants [1681#true, 1682#false, 1683#(<= 10 entry_point_~len~0), 1684#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1685#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 20:33:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:33:30,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:33:30,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:33:30,412 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2018-02-02 20:33:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:30,435 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-02-02 20:33:30,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:33:30,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 20:33:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:30,436 INFO L225 Difference]: With dead ends: 104 [2018-02-02 20:33:30,437 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 20:33:30,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 20:33:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-02-02 20:33:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 20:33:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-02-02 20:33:30,441 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 35 [2018-02-02 20:33:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:30,442 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-02-02 20:33:30,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:33:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-02-02 20:33:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:33:30,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:30,443 INFO L351 BasicCegarLoop]: trace histogram [3, 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:33:30,443 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1275207587, now seen corresponding path program 2 times [2018-02-02 20:33:30,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:30,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:30,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:33:30,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,503 INFO L182 omatonBuilderFactory]: Interpolants [1894#true, 1895#false, 1896#(<= 10 entry_point_~len~0), 1897#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1898#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1899#(<= (+ entry_point_~i~2 8) entry_point_~len~0)] [2018-02-02 20:33:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:33:30,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:33:30,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:30,504 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2018-02-02 20:33:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:30,543 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2018-02-02 20:33:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:33:30,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-02 20:33:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:30,545 INFO L225 Difference]: With dead ends: 108 [2018-02-02 20:33:30,545 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 20:33:30,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:33:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 20:33:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-02 20:33:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 20:33:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-02-02 20:33:30,549 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-02-02 20:33:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:30,550 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-02-02 20:33:30,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:33:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-02-02 20:33:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:33:30,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:30,551 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:30,551 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash -336361420, now seen corresponding path program 3 times [2018-02-02 20:33:30,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:30,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:30,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:33:30,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,599 INFO L182 omatonBuilderFactory]: Interpolants [2118#true, 2119#false, 2120#(<= 10 entry_point_~len~0), 2121#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2122#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2123#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2124#(<= (+ entry_point_~i~2 7) entry_point_~len~0)] [2018-02-02 20:33:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:33:30,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:33:30,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:33:30,600 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 7 states. [2018-02-02 20:33:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:30,638 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2018-02-02 20:33:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:33:30,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-02-02 20:33:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:30,640 INFO L225 Difference]: With dead ends: 112 [2018-02-02 20:33:30,640 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 20:33:30,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:33:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 20:33:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-02 20:33:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 20:33:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-02 20:33:30,644 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 43 [2018-02-02 20:33:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:30,644 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-02 20:33:30,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:33:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-02 20:33:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:33:30,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:30,646 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 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:33:30,646 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1586719883, now seen corresponding path program 4 times [2018-02-02 20:33:30,647 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:30,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:30,704 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:33:30,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:30,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:33:30,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,705 INFO L182 omatonBuilderFactory]: Interpolants [2353#true, 2354#false, 2355#(<= 10 entry_point_~len~0), 2356#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2357#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2358#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2359#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2360#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 20:33:30,705 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:33:30,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:33:30,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:33:30,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:33:30,706 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 8 states. [2018-02-02 20:33:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:30,763 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-02-02 20:33:30,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:33:30,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 20:33:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:30,765 INFO L225 Difference]: With dead ends: 116 [2018-02-02 20:33:30,765 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 20:33:30,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:33:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 20:33:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-02 20:33:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 20:33:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-02 20:33:30,770 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 47 [2018-02-02 20:33:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:30,770 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-02 20:33:30,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:33:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-02 20:33:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:33:30,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:30,773 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 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:33:30,773 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:30,773 INFO L82 PathProgramCache]: Analyzing trace with hash -76853918, now seen corresponding path program 5 times [2018-02-02 20:33:30,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:30,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:30,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:33:30,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,844 INFO L182 omatonBuilderFactory]: Interpolants [2599#true, 2600#false, 2601#(<= 10 entry_point_~len~0), 2602#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2603#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2604#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2605#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2606#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2607#(<= (+ entry_point_~i~2 5) entry_point_~len~0)] [2018-02-02 20:33:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:30,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:33:30,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:33:30,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:33:30,844 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 9 states. [2018-02-02 20:33:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:30,919 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-02-02 20:33:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:33:30,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-02-02 20:33:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:30,920 INFO L225 Difference]: With dead ends: 120 [2018-02-02 20:33:30,920 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:33:30,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:33:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:33:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 20:33:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 20:33:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-02-02 20:33:30,924 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 51 [2018-02-02 20:33:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:30,925 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2018-02-02 20:33:30,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:33:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-02-02 20:33:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:33:30,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:30,925 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 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:33:30,926 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1255609671, now seen corresponding path program 6 times [2018-02-02 20:33:30,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:30,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:31,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:33:31,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,001 INFO L182 omatonBuilderFactory]: Interpolants [2864#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2865#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2856#true, 2857#false, 2858#(<= 10 entry_point_~len~0), 2859#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2860#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2861#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2862#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2863#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 20:33:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:33:31,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:33:31,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:33:31,002 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 10 states. [2018-02-02 20:33:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:31,086 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-02-02 20:33:31,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:33:31,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 20:33:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:31,087 INFO L225 Difference]: With dead ends: 124 [2018-02-02 20:33:31,087 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 20:33:31,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:33:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 20:33:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-02 20:33:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:33:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-02-02 20:33:31,091 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 55 [2018-02-02 20:33:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:31,092 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-02-02 20:33:31,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:33:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-02-02 20:33:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:33:31,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:31,093 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 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:33:31,093 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:31,093 INFO L82 PathProgramCache]: Analyzing trace with hash -241564528, now seen corresponding path program 7 times [2018-02-02 20:33:31,095 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:31,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:31,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:33:31,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,177 INFO L182 omatonBuilderFactory]: Interpolants [3124#true, 3125#false, 3126#(<= 10 entry_point_~len~0), 3127#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3128#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3129#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3130#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3131#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3132#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3133#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3134#(<= (+ entry_point_~i~2 3) entry_point_~len~0)] [2018-02-02 20:33:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:33:31,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:33:31,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:33:31,178 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 11 states. [2018-02-02 20:33:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:31,280 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2018-02-02 20:33:31,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:33:31,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-02 20:33:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:31,282 INFO L225 Difference]: With dead ends: 128 [2018-02-02 20:33:31,282 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 20:33:31,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:33:31,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 20:33:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-02-02 20:33:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 20:33:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-02-02 20:33:31,286 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 59 [2018-02-02 20:33:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:31,287 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-02-02 20:33:31,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:33:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-02-02 20:33:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:33:31,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:31,288 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 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:33:31,288 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash -106145049, now seen corresponding path program 8 times [2018-02-02 20:33:31,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:31,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:31,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:33:31,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,400 INFO L182 omatonBuilderFactory]: Interpolants [3408#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3409#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3410#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3411#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3412#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3413#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3414#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3403#true, 3404#false, 3405#(<= 10 entry_point_~len~0), 3406#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3407#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 20:33:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:33:31,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:33:31,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:33:31,401 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 12 states. [2018-02-02 20:33:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:31,528 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2018-02-02 20:33:31,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:33:31,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 20:33:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:31,531 INFO L225 Difference]: With dead ends: 132 [2018-02-02 20:33:31,531 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 20:33:31,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:33:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 20:33:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-02-02 20:33:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 20:33:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2018-02-02 20:33:31,535 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 63 [2018-02-02 20:33:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:31,535 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2018-02-02 20:33:31,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:33:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2018-02-02 20:33:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:33:31,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:31,536 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 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:33:31,536 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:31,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1768795582, now seen corresponding path program 9 times [2018-02-02 20:33:31,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:31,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:31,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:33:31,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,646 INFO L182 omatonBuilderFactory]: Interpolants [3693#true, 3694#false, 3695#(<= 10 entry_point_~len~0), 3696#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3697#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3698#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3699#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3700#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3701#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3702#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3703#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3704#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3705#(<= (+ entry_point_~i~2 1) entry_point_~len~0)] [2018-02-02 20:33:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:33:31,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:33:31,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:33:31,647 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand 13 states. [2018-02-02 20:33:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:31,748 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2018-02-02 20:33:31,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:33:31,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2018-02-02 20:33:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:31,749 INFO L225 Difference]: With dead ends: 134 [2018-02-02 20:33:31,750 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 20:33:31,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:33:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 20:33:31,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 20:33:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 20:33:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-02 20:33:31,754 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 67 [2018-02-02 20:33:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:31,754 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-02 20:33:31,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:33:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-02 20:33:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:33:31,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:31,755 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 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:33:31,755 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:31,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1609843435, now seen corresponding path program 10 times [2018-02-02 20:33:31,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:31,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:33:31,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:31,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:33:31,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:31,814 INFO L182 omatonBuilderFactory]: Interpolants [3992#true, 3993#false, 3994#(<= 10 entry_point_~len~0), 3995#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 3996#(<= |alloc_17_#in~len| 0)] [2018-02-02 20:33:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:33:31,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:33:31,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:33:31,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:33:31,815 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 5 states. [2018-02-02 20:33:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:31,849 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2018-02-02 20:33:31,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:33:31,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-02-02 20:33:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:31,851 INFO L225 Difference]: With dead ends: 159 [2018-02-02 20:33:31,851 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 20:33:31,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 20:33:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 133. [2018-02-02 20:33:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 20:33:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2018-02-02 20:33:31,856 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 71 [2018-02-02 20:33:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:31,856 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2018-02-02 20:33:31,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:33:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2018-02-02 20:33:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:33:31,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:31,857 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:33:31,857 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2145863145, now seen corresponding path program 1 times [2018-02-02 20:33:31,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:31,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:33:32,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:32,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:33:32,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:32,138 INFO L182 omatonBuilderFactory]: Interpolants [4291#true, 4292#false, 4293#(<= 10 entry_point_~len~0), 4294#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4295#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4296#(and (<= 10 entry_point_~len~0) (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 4297#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4298#(and (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 44) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= (select |#valid| entry_point_~array~0.base) 1)), 4299#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 40) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4300#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 36) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4301#(and (<= (+ entry_point_~array~0.offset 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4302#(and (<= 36 (select |#length| |alloc_17_#in~array.base|)) (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 4303#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 36 (select |#length| alloc_17_~array.base))), 4304#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 4305#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 4306#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 4307#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 36 (select |#length| alloc_17_~array.base)))] [2018-02-02 20:33:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:33:32,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:33:32,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:33:32,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:33:32,139 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 17 states. [2018-02-02 20:33:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:32,677 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-02-02 20:33:32,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:33:32,677 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-02 20:33:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:32,678 INFO L225 Difference]: With dead ends: 202 [2018-02-02 20:33:32,678 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 20:33:32,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:33:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 20:33:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2018-02-02 20:33:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 20:33:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2018-02-02 20:33:32,681 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 72 [2018-02-02 20:33:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:32,681 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2018-02-02 20:33:32,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:33:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2018-02-02 20:33:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:33:32,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:32,682 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:33:32,682 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2145863146, now seen corresponding path program 1 times [2018-02-02 20:33:32,683 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:32,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:33:32,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:32,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:33:32,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:32,796 INFO L182 omatonBuilderFactory]: Interpolants [4688#(= 1 (select |#valid| entry_point_~array~0.base)), 4689#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 4690#(= 1 (select |#valid| alloc_17_~array.base)), 4691#(= |#valid| |old(#valid)|), 4692#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 4693#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4683#true, 4684#false, 4685#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4686#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4687#(= 1 (select |#valid| |entry_point_#t~ret10.base|))] [2018-02-02 20:33:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:33:32,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:33:32,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:33:32,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:33:32,797 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand 11 states. [2018-02-02 20:33:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:33,022 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2018-02-02 20:33:33,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:33:33,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-02-02 20:33:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:33,023 INFO L225 Difference]: With dead ends: 193 [2018-02-02 20:33:33,023 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 20:33:33,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:33:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 20:33:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-02-02 20:33:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 20:33:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-02 20:33:33,030 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 72 [2018-02-02 20:33:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:33,030 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-02 20:33:33,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:33:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-02 20:33:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:33:33,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:33,031 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:33,031 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1300106032, now seen corresponding path program 1 times [2018-02-02 20:33:33,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:33,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:33:33,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:33,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:33:33,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:33,100 INFO L182 omatonBuilderFactory]: Interpolants [5035#true, 5036#false, 5037#(= alloc_17_~i~0 0), 5038#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-02 20:33:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:33:33,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:33:33,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:33:33,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:33:33,101 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 4 states. [2018-02-02 20:33:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:33,130 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-02-02 20:33:33,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:33:33,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 20:33:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:33,132 INFO L225 Difference]: With dead ends: 143 [2018-02-02 20:33:33,133 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 20:33:33,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:33:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 20:33:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-02-02 20:33:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 20:33:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-02 20:33:33,137 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 73 [2018-02-02 20:33:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:33,137 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-02 20:33:33,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:33:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-02 20:33:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:33:33,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:33,138 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:33,138 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:33,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1928926345, now seen corresponding path program 1 times [2018-02-02 20:33:33,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:33,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 20:33:33,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:33,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:33:33,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:33,287 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:33:33,287 INFO L182 omatonBuilderFactory]: Interpolants [5321#true, 5322#false, 5323#(= 0 |ldv_malloc_#t~malloc1.offset|), 5324#(= 0 |ldv_malloc_#res.offset|), 5325#(= 0 |entry_point_#t~ret10.offset|), 5326#(= entry_point_~array~0.offset 0), 5327#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5328#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5329#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5330#(= |old(#length)| |#length|), 5331#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 5332#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 5333#(and (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 20:33:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 20:33:33,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:33:33,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:33:33,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:33:33,288 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 13 states. [2018-02-02 20:33:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:33,482 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-02-02 20:33:33,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:33:33,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-02-02 20:33:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:33,484 INFO L225 Difference]: With dead ends: 156 [2018-02-02 20:33:33,484 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 20:33:33,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:33:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 20:33:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2018-02-02 20:33:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 20:33:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-02-02 20:33:33,488 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 81 [2018-02-02 20:33:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:33,488 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-02-02 20:33:33,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:33:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-02-02 20:33:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:33:33,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:33,489 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:33,489 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:33,490 INFO L82 PathProgramCache]: Analyzing trace with hash 332825470, now seen corresponding path program 1 times [2018-02-02 20:33:33,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:33,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:34,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:34,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:33:34,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:34,447 INFO L182 omatonBuilderFactory]: Interpolants [5664#(= 0 |free_17_#t~mem9.offset|), 5641#true, 5642#false, 5643#(<= entry_point_~len~0 10), 5644#(= 0 |ldv_malloc_#t~malloc1.offset|), 5645#(= 0 |ldv_malloc_#res.offset|), 5646#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 5647#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 5648#(and (or (and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset))), 5649#(and (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10))) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))))), 5650#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 5651#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31))) (and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 5652#(or (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (= entry_point_~array~0.offset 0)) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2))), 5653#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 5654#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)) (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (= entry_point_~array~0.offset 0))), 5655#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)))), 5656#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2))), 5657#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 5658#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 5659#(and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 5660#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 5661#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 5662#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 5663#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))))] [2018-02-02 20:33:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:34,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:33:34,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:33:34,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:33:34,448 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand 24 states. [2018-02-02 20:33:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:35,192 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-02-02 20:33:35,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:33:35,262 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 20:33:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:35,263 INFO L225 Difference]: With dead ends: 175 [2018-02-02 20:33:35,263 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 20:33:35,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=1750, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:33:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 20:33:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2018-02-02 20:33:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 20:33:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2018-02-02 20:33:35,267 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 82 [2018-02-02 20:33:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:35,267 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2018-02-02 20:33:35,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:33:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2018-02-02 20:33:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:33:35,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:35,269 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:35,269 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:35,269 INFO L82 PathProgramCache]: Analyzing trace with hash 332825471, now seen corresponding path program 1 times [2018-02-02 20:33:35,270 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:35,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:33:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:36,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:36,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:33:36,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:36,108 INFO L182 omatonBuilderFactory]: Interpolants [6048#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 6049#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 6050#(and (or (and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset))), 6051#(and (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= 0 entry_point_~array~0.offset))) (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)))), 6052#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 6053#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31))) (and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 6054#(or (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (= entry_point_~array~0.offset 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2))), 6055#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 6056#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)) (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (= entry_point_~array~0.offset 0))), 6057#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15)))), 6058#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11)))), 6059#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 6060#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3)))), 6061#(and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 6062#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 6063#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 6064#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 6065#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 6066#(= |free_17_#t~mem9.base| 0), 6043#true, 6044#false, 6045#(<= entry_point_~len~0 10), 6046#(= 0 |ldv_malloc_#t~malloc1.offset|), 6047#(= 0 |ldv_malloc_#res.offset|)] [2018-02-02 20:33:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:36,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:33:36,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:33:36,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:33:36,109 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 24 states. [2018-02-02 20:33:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:36,955 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2018-02-02 20:33:36,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:33:36,956 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 20:33:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:36,957 INFO L225 Difference]: With dead ends: 174 [2018-02-02 20:33:36,957 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 20:33:36,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:33:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 20:33:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-02-02 20:33:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 20:33:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2018-02-02 20:33:36,962 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 82 [2018-02-02 20:33:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:36,962 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2018-02-02 20:33:36,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:33:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2018-02-02 20:33:36,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:33:36,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:36,963 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:36,963 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1452983252, now seen corresponding path program 1 times [2018-02-02 20:33:36,964 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:36,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 20:33:37,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:37,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:33:37,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:33:37,004 INFO L182 omatonBuilderFactory]: Interpolants [6440#true, 6441#false, 6442#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 6443#(not (= 0 |ldv_malloc_#res.base|)), 6444#(not (= 0 |alloc_17_#t~ret3.base|)), 6445#(not (= 0 alloc_17_~p~0.base))] [2018-02-02 20:33:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 20:33:37,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:33:37,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:33:37,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:37,005 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand 6 states. [2018-02-02 20:33:37,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:37,036 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-02-02 20:33:37,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:33:37,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-02 20:33:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:37,037 INFO L225 Difference]: With dead ends: 139 [2018-02-02 20:33:37,037 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 20:33:37,037 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:33:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 20:33:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-02-02 20:33:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 20:33:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-02 20:33:37,040 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 83 [2018-02-02 20:33:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:37,041 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-02 20:33:37,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:33:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-02 20:33:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:33:37,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:37,042 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:33:37,042 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash 558282765, now seen corresponding path program 1 times [2018-02-02 20:33:37,043 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:37,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 20:33:37,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:37,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:33:37,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:33:37,102 INFO L182 omatonBuilderFactory]: Interpolants [6726#true, 6727#false, 6728#(= alloc_17_~array.base |alloc_17_#in~array.base|), 6729#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 6730#(= 1 (select |#valid| entry_point_~array~0.base)), 6731#(= 1 (select |#valid| |free_17_#in~array.base|)), 6732#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:33:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 20:33:37,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:33:37,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:33:37,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:33:37,103 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 7 states. [2018-02-02 20:33:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:37,211 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2018-02-02 20:33:37,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:33:37,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-02-02 20:33:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:37,212 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:33:37,212 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 20:33:37,212 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:33:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 20:33:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2018-02-02 20:33:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 20:33:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2018-02-02 20:33:37,214 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 84 [2018-02-02 20:33:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:37,214 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2018-02-02 20:33:37,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:33:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2018-02-02 20:33:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:33:37,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:37,215 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:33:37,215 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash 558282766, now seen corresponding path program 1 times [2018-02-02 20:33:37,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:37,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 20:33:37,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:37,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:33:37,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:33:37,251 INFO L182 omatonBuilderFactory]: Interpolants [7045#true, 7046#false, 7047#(<= 10 entry_point_~len~0), 7048#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 7049#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 7050#(<= |alloc_17_#in~len| 1)] [2018-02-02 20:33:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 20:33:37,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:33:37,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:33:37,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:37,252 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand 6 states. [2018-02-02 20:33:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:37,316 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2018-02-02 20:33:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:33:37,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-02-02 20:33:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:37,317 INFO L225 Difference]: With dead ends: 185 [2018-02-02 20:33:37,317 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:33:37,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:33:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:33:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2018-02-02 20:33:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 20:33:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2018-02-02 20:33:37,321 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 84 [2018-02-02 20:33:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:37,322 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2018-02-02 20:33:37,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:33:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-02-02 20:33:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:33:37,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:37,324 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:37,324 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash 641539646, now seen corresponding path program 1 times [2018-02-02 20:33:37,325 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:37,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 20:33:37,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:37,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:33:37,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:33:37,670 INFO L182 omatonBuilderFactory]: Interpolants [7392#false, 7393#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 7394#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7395#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 7396#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7397#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7398#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7399#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7400#(and (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 7401#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7402#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7403#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 7404#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 7405#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7406#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0)), 7407#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7408#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7409#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7391#true] [2018-02-02 20:33:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 20:33:37,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:33:37,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:33:37,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:33:37,671 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 19 states. [2018-02-02 20:33:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:38,424 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2018-02-02 20:33:38,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:33:38,425 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-02-02 20:33:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:38,426 INFO L225 Difference]: With dead ends: 196 [2018-02-02 20:33:38,426 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 20:33:38,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:33:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 20:33:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 156. [2018-02-02 20:33:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 20:33:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2018-02-02 20:33:38,431 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 85 [2018-02-02 20:33:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:38,431 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2018-02-02 20:33:38,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:33:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2018-02-02 20:33:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:33:38,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:38,432 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:38,433 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:38,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1920478082, now seen corresponding path program 1 times [2018-02-02 20:33:38,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:38,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:33:38,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:33:38,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:33:38,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:38,485 INFO L182 omatonBuilderFactory]: Interpolants [7794#true, 7795#false, 7796#(<= 10 entry_point_~len~0), 7797#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 7798#(<= |free_17_#in~len| 0)] [2018-02-02 20:33:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:33:38,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:33:38,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:33:38,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:33:38,486 INFO L87 Difference]: Start difference. First operand 156 states and 174 transitions. Second operand 5 states. [2018-02-02 20:33:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:38,509 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2018-02-02 20:33:38,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:33:38,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-02-02 20:33:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:38,510 INFO L225 Difference]: With dead ends: 168 [2018-02-02 20:33:38,511 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 20:33:38,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 20:33:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-02-02 20:33:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 20:33:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2018-02-02 20:33:38,515 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 85 [2018-02-02 20:33:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:38,516 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2018-02-02 20:33:38,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:33:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-02-02 20:33:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:33:38,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:38,517 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1] [2018-02-02 20:33:38,517 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1810246633, now seen corresponding path program 1 times [2018-02-02 20:33:38,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:38,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 20:33:38,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:38,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:33:38,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:33:38,663 INFO L182 omatonBuilderFactory]: Interpolants [8128#(= alloc_17_~array.offset 0), 8129#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))), 8130#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8131#(= |old(#length)| |#length|), 8132#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8133#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (<= 0 alloc_17_~j~0) (= alloc_17_~array.offset 0)), 8121#true, 8122#false, 8123#(= 0 |ldv_malloc_#t~malloc1.offset|), 8124#(= 0 |ldv_malloc_#res.offset|), 8125#(= 0 |entry_point_#t~ret10.offset|), 8126#(= 0 entry_point_~array~0.offset), 8127#(= 0 |alloc_17_#in~array.offset|)] [2018-02-02 20:33:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 20:33:38,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:33:38,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:33:38,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:33:38,664 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 13 states. [2018-02-02 20:33:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:38,876 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2018-02-02 20:33:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:33:38,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-02-02 20:33:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:38,877 INFO L225 Difference]: With dead ends: 152 [2018-02-02 20:33:38,877 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 20:33:38,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:33:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 20:33:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-02-02 20:33:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 20:33:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2018-02-02 20:33:38,882 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 86 [2018-02-02 20:33:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:38,882 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2018-02-02 20:33:38,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:33:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2018-02-02 20:33:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:33:38,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:38,883 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-02 20:33:38,883 INFO L371 AbstractCegarLoop]: === Iteration 32 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash 283070766, now seen corresponding path program 1 times [2018-02-02 20:33:38,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:38,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 20:33:39,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:39,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:33:39,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:33:39,097 INFO L182 omatonBuilderFactory]: Interpolants [8455#true, 8456#false, 8457#(= 0 |ldv_malloc_#t~malloc1.offset|), 8458#(= 0 |ldv_malloc_#res.offset|), 8459#(= 0 |entry_point_#t~ret10.offset|), 8460#(= 0 entry_point_~array~0.offset), 8461#(= 0 |alloc_17_#in~array.offset|), 8462#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8463#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 8464#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 8465#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 8466#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 8467#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 8468#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 8469#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-02 20:33:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 20:33:39,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:33:39,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:33:39,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:33:39,098 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 15 states. [2018-02-02 20:33:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:39,326 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2018-02-02 20:33:39,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:33:39,327 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 20:33:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:39,327 INFO L225 Difference]: With dead ends: 174 [2018-02-02 20:33:39,327 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 20:33:39,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:33:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 20:33:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2018-02-02 20:33:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 20:33:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2018-02-02 20:33:39,330 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 87 [2018-02-02 20:33:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:39,331 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2018-02-02 20:33:39,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:33:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2018-02-02 20:33:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:33:39,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:39,331 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-02 20:33:39,331 INFO L371 AbstractCegarLoop]: === Iteration 33 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:39,332 INFO L82 PathProgramCache]: Analyzing trace with hash 283070767, now seen corresponding path program 1 times [2018-02-02 20:33:39,332 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:39,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 20:33:39,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:39,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:33:39,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:33:39,638 INFO L182 omatonBuilderFactory]: Interpolants [8832#(= 0 |ldv_malloc_#t~malloc1.offset|), 8833#(= 0 |ldv_malloc_#res.offset|), 8834#(= 0 |entry_point_#t~ret10.offset|), 8835#(= 0 entry_point_~array~0.offset), 8836#(= 0 |alloc_17_#in~array.offset|), 8837#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8838#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 8839#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 8840#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8841#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 8842#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 8843#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 8844#(= |#valid| |old(#valid)|), 8845#(and (= alloc_17_~array.offset 0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= alloc_17_~j~0 0)), 8846#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 8847#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 8830#true, 8831#false] [2018-02-02 20:33:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 20:33:39,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:33:39,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:33:39,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:33:39,639 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 18 states. [2018-02-02 20:33:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:40,010 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2018-02-02 20:33:40,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:33:40,010 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 20:33:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:40,011 INFO L225 Difference]: With dead ends: 174 [2018-02-02 20:33:40,011 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 20:33:40,012 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:33:40,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 20:33:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2018-02-02 20:33:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 20:33:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2018-02-02 20:33:40,014 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 87 [2018-02-02 20:33:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:40,015 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2018-02-02 20:33:40,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:33:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2018-02-02 20:33:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:33:40,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:40,016 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:33:40,016 INFO L371 AbstractCegarLoop]: === Iteration 34 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1189582988, now seen corresponding path program 1 times [2018-02-02 20:33:40,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:40,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 116 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:40,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:40,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:33:40,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:40,877 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:33:40,877 INFO L182 omatonBuilderFactory]: Interpolants [9216#(= 0 |ldv_malloc_#t~malloc1.offset|), 9217#(= 0 |ldv_malloc_#res.offset|), 9218#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 9219#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9220#(and (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (<= entry_point_~len~0 10)) (= 0 entry_point_~array~0.offset)), 9221#(and (= 0 entry_point_~array~0.offset) (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~len~0 10))) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))))), 9222#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 9223#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31)))), 9224#(and (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2)))), 9225#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23)))), 9226#(and (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)))), 9227#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15)))), 9228#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11)))), 9229#(and (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))) (= 0 entry_point_~array~0.offset)), 9230#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3)))), 9231#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 9232#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 9233#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9234#(= |#valid| |old(#valid)|), 9235#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|))), 9236#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 1 (select |#valid| free_17_~array.base))), 9237#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 9238#(= 1 (select |#valid| free_17_~array.base)), 9213#true, 9214#false, 9215#(<= entry_point_~len~0 10)] [2018-02-02 20:33:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 116 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:33:40,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:33:40,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:33:40,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:33:40,878 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 26 states. [2018-02-02 20:33:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:41,911 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2018-02-02 20:33:41,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:33:41,911 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-02-02 20:33:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:41,911 INFO L225 Difference]: With dead ends: 186 [2018-02-02 20:33:41,911 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 20:33:41,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:33:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 20:33:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2018-02-02 20:33:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 20:33:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 193 transitions. [2018-02-02 20:33:41,915 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 193 transitions. Word has length 87 [2018-02-02 20:33:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:41,915 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 193 transitions. [2018-02-02 20:33:41,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:33:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 193 transitions. [2018-02-02 20:33:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:33:41,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:41,916 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:33:41,916 INFO L371 AbstractCegarLoop]: === Iteration 35 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:41,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1189582989, now seen corresponding path program 1 times [2018-02-02 20:33:41,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:41,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 20:33:42,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:42,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:33:42,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:42,115 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:33:42,115 INFO L182 omatonBuilderFactory]: Interpolants [9637#true, 9638#false, 9639#(= 0 |ldv_malloc_#t~malloc1.offset|), 9640#(= 0 |ldv_malloc_#res.offset|), 9641#(= 0 |entry_point_#t~ret10.offset|), 9642#(= entry_point_~array~0.offset 0), 9643#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 9644#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 9645#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 9646#(= |old(#length)| |#length|), 9647#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 9648#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 9649#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 9650#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 9651#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-02 20:33:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 20:33:42,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:33:42,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:33:42,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:33:42,116 INFO L87 Difference]: Start difference. First operand 170 states and 193 transitions. Second operand 15 states. [2018-02-02 20:33:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:42,392 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-02-02 20:33:42,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:33:42,392 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 20:33:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:42,393 INFO L225 Difference]: With dead ends: 175 [2018-02-02 20:33:42,393 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 20:33:42,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:33:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 20:33:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2018-02-02 20:33:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 20:33:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2018-02-02 20:33:42,396 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 87 [2018-02-02 20:33:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:42,396 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2018-02-02 20:33:42,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:33:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2018-02-02 20:33:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:33:42,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:42,397 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:42,397 INFO L371 AbstractCegarLoop]: === Iteration 36 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1777632984, now seen corresponding path program 1 times [2018-02-02 20:33:42,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:42,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:33:43,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:43,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:33:43,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:43,293 INFO L182 omatonBuilderFactory]: Interpolants [10011#true, 10012#false, 10013#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10014#(= 0 |ldv_malloc_#t~malloc1.offset|), 10015#(= 0 |ldv_malloc_#res.offset|), 10016#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10017#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10018#(and (<= 10 entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10019#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2)), 10020#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 10021#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (= entry_point_~array~0.offset 0)), 10022#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 10023#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))))), 10024#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))))), 10025#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 10026#(and (= entry_point_~array~0.offset 0) (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8))))))), 10027#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 10028#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10029#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 10030#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))), 10031#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 10032#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 10033#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 10034#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10035#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 20:33:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:33:43,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:33:43,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:33:43,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:33:43,293 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand 25 states. [2018-02-02 20:33:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:45,530 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2018-02-02 20:33:45,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 20:33:45,530 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 20:33:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:45,531 INFO L225 Difference]: With dead ends: 181 [2018-02-02 20:33:45,531 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:33:45,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=610, Invalid=3550, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:33:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:33:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2018-02-02 20:33:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 20:33:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2018-02-02 20:33:45,536 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 88 [2018-02-02 20:33:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:45,536 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2018-02-02 20:33:45,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:33:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2018-02-02 20:33:45,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:33:45,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:45,537 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:45,537 INFO L371 AbstractCegarLoop]: === Iteration 37 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1777632983, now seen corresponding path program 1 times [2018-02-02 20:33:45,538 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:45,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:33:46,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:46,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:33:46,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:46,438 INFO L182 omatonBuilderFactory]: Interpolants [10469#true, 10470#false, 10471#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10472#(= 0 |ldv_malloc_#t~malloc1.offset|), 10473#(= 0 |ldv_malloc_#res.offset|), 10474#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10475#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10476#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10477#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 10478#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 10479#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 10480#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 10481#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 10482#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2)), 10483#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)) 4) 7) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 10484#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)) entry_point_~array~0.offset)))), 10485#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 4 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 10486#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10487#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset))))), 10488#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 10489#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 10490#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 10491#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 10492#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10493#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:33:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:33:46,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:33:46,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:33:46,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:33:46,439 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand 25 states. [2018-02-02 20:33:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:48,789 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2018-02-02 20:33:48,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:33:48,789 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 20:33:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:48,790 INFO L225 Difference]: With dead ends: 180 [2018-02-02 20:33:48,790 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 20:33:48,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=582, Invalid=3200, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:33:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 20:33:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2018-02-02 20:33:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 20:33:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2018-02-02 20:33:48,795 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 88 [2018-02-02 20:33:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:48,795 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2018-02-02 20:33:48,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:33:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2018-02-02 20:33:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:33:48,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:48,796 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1] [2018-02-02 20:33:48,796 INFO L371 AbstractCegarLoop]: === Iteration 38 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1448067279, now seen corresponding path program 1 times [2018-02-02 20:33:48,797 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:48,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 20:33:49,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:49,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:33:49,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:49,136 INFO L182 omatonBuilderFactory]: Interpolants [10920#true, 10921#false, 10922#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 10923#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 10924#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 10925#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 10926#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 10927#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 10928#(= |#valid| |old(#valid)|), 10929#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10930#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10931#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 10932#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 10933#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 10934#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 10935#(and (= alloc_17_~array.offset 0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 1 (select |#valid| alloc_17_~array.base)))) (<= alloc_17_~j~0 0)), 10936#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))), 10937#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 10938#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 20:33:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 20:33:49,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:33:49,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:33:49,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:33:49,136 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 19 states. [2018-02-02 20:33:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:49,528 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2018-02-02 20:33:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:33:49,528 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-02 20:33:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:49,528 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:33:49,529 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:33:49,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:33:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:33:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2018-02-02 20:33:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 20:33:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2018-02-02 20:33:49,531 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 89 [2018-02-02 20:33:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:49,531 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2018-02-02 20:33:49,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:33:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2018-02-02 20:33:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 20:33:49,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:49,532 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:49,532 INFO L371 AbstractCegarLoop]: === Iteration 39 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash -562035052, now seen corresponding path program 1 times [2018-02-02 20:33:49,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:49,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:33:49,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:49,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:33:49,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:49,577 INFO L182 omatonBuilderFactory]: Interpolants [11312#true, 11313#false, 11314#(<= 10 entry_point_~len~0), 11315#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 11316#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 11317#(<= |free_17_#in~len| 1)] [2018-02-02 20:33:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:33:49,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:33:49,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:33:49,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:49,578 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand 6 states. [2018-02-02 20:33:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:49,615 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2018-02-02 20:33:49,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:33:49,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-02-02 20:33:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:49,616 INFO L225 Difference]: With dead ends: 197 [2018-02-02 20:33:49,616 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 20:33:49,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:33:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 20:33:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-02-02 20:33:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 20:33:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 203 transitions. [2018-02-02 20:33:49,620 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 203 transitions. Word has length 91 [2018-02-02 20:33:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:49,620 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 203 transitions. [2018-02-02 20:33:49,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:33:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 203 transitions. [2018-02-02 20:33:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:33:49,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:49,621 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:49,621 INFO L371 AbstractCegarLoop]: === Iteration 40 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:49,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1992508207, now seen corresponding path program 1 times [2018-02-02 20:33:49,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:49,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 20:33:49,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:49,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:33:49,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:33:49,680 INFO L182 omatonBuilderFactory]: Interpolants [11696#true, 11697#false, 11698#(= alloc_17_~array.base |alloc_17_#in~array.base|), 11699#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 11700#(= |#valid| |old(#valid)|), 11701#(= 1 (select |#valid| entry_point_~array~0.base)), 11702#(= 1 (select |#valid| |free_17_#in~array.base|)), 11703#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:33:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 20:33:49,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:33:49,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:33:49,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:33:49,681 INFO L87 Difference]: Start difference. First operand 179 states and 203 transitions. Second operand 8 states. [2018-02-02 20:33:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:49,798 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-02-02 20:33:49,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:33:49,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-02-02 20:33:49,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:49,800 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:33:49,800 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:33:49,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:33:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:33:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2018-02-02 20:33:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 20:33:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-02-02 20:33:49,803 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 94 [2018-02-02 20:33:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:49,803 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-02-02 20:33:49,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:33:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-02-02 20:33:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:33:49,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:49,804 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:49,804 INFO L371 AbstractCegarLoop]: === Iteration 41 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1992508208, now seen corresponding path program 1 times [2018-02-02 20:33:49,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:49,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 20:33:49,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:49,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:33:49,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:33:49,900 INFO L182 omatonBuilderFactory]: Interpolants [12064#true, 12065#false, 12066#(= 0 |ldv_malloc_#t~malloc1.offset|), 12067#(= 0 |ldv_malloc_#res.offset|), 12068#(= 0 |entry_point_#t~ret10.offset|), 12069#(= 0 entry_point_~array~0.offset), 12070#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 12071#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 12072#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0)), 12073#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 12074#(not (= |alloc_17_#in~array.offset| 0))] [2018-02-02 20:33:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 20:33:49,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:33:49,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:33:49,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:33:49,901 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 11 states. [2018-02-02 20:33:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:50,028 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2018-02-02 20:33:50,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:33:50,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-02-02 20:33:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:50,029 INFO L225 Difference]: With dead ends: 173 [2018-02-02 20:33:50,029 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 20:33:50,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:33:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 20:33:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-02-02 20:33:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 20:33:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 189 transitions. [2018-02-02 20:33:50,033 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 189 transitions. Word has length 94 [2018-02-02 20:33:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:50,033 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 189 transitions. [2018-02-02 20:33:50,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:33:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 189 transitions. [2018-02-02 20:33:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 20:33:50,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:50,034 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:50,034 INFO L371 AbstractCegarLoop]: === Iteration 42 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:50,034 INFO L82 PathProgramCache]: Analyzing trace with hash 983276834, now seen corresponding path program 2 times [2018-02-02 20:33:50,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:50,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:33:50,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:50,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:33:50,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:50,836 INFO L182 omatonBuilderFactory]: Interpolants [12428#true, 12429#false, 12430#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12431#(= 0 |ldv_malloc_#t~malloc1.offset|), 12432#(= 0 |ldv_malloc_#res.offset|), 12433#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 12434#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12435#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12436#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 12437#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 12438#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 12439#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 12440#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2)), 12441#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2)), 12442#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 12443#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)))))) (= entry_point_~array~0.offset 0)), 12444#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12445#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12446#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 12447#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 12448#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12449#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 12450#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 12451#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 12452#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 12453#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:33:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:33:50,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:33:50,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:33:50,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:33:50,837 INFO L87 Difference]: Start difference. First operand 170 states and 189 transitions. Second operand 26 states. [2018-02-02 20:33:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:53,108 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2018-02-02 20:33:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:33:53,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2018-02-02 20:33:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:53,109 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:33:53,109 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:33:53,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=625, Invalid=3797, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 20:33:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:33:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2018-02-02 20:33:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 20:33:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2018-02-02 20:33:53,112 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 93 [2018-02-02 20:33:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:53,112 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2018-02-02 20:33:53,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:33:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2018-02-02 20:33:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:33:53,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:53,112 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-02 20:33:53,112 INFO L371 AbstractCegarLoop]: === Iteration 43 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1215322232, now seen corresponding path program 1 times [2018-02-02 20:33:53,113 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:53,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:33:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:33:53,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:53,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:33:53,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:33:53,159 INFO L182 omatonBuilderFactory]: Interpolants [12896#(= alloc_17_~i~0 0), 12897#(<= alloc_17_~i~0 1), 12898#(<= alloc_17_~j~0 0), 12899#(<= (+ alloc_17_~j~0 1) 0), 12894#true, 12895#false] [2018-02-02 20:33:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:33:53,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:33:53,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:33:53,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:33:53,160 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand 6 states. [2018-02-02 20:33:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:53,188 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2018-02-02 20:33:53,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:33:53,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-02-02 20:33:53,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:53,189 INFO L225 Difference]: With dead ends: 180 [2018-02-02 20:33:53,189 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 20:33:53,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:33:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 20:33:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2018-02-02 20:33:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 20:33:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-02-02 20:33:53,192 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 94 [2018-02-02 20:33:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:53,192 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-02-02 20:33:53,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:33:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-02-02 20:33:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:33:53,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:53,193 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:53,193 INFO L371 AbstractCegarLoop]: === Iteration 44 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash 416810834, now seen corresponding path program 2 times [2018-02-02 20:33:53,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:53,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:33:54,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:54,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:33:54,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:54,061 INFO L182 omatonBuilderFactory]: Interpolants [13257#true, 13258#false, 13259#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 13260#(= 0 |ldv_malloc_#t~malloc1.offset|), 13261#(= 0 |ldv_malloc_#res.offset|), 13262#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 13263#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13264#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 13265#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)))))), 13266#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 13267#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))) 4) 3) entry_point_~i~2)), 13268#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))))), 13269#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))))), 13270#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))), 13271#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 13272#(and (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 8))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 13273#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 13274#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 13275#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 13276#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 13277#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 13278#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 13279#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 13280#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 13281#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 20:33:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:33:54,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:33:54,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:33:54,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:33:54,062 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand 25 states. [2018-02-02 20:33:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:55,996 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2018-02-02 20:33:55,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:33:55,996 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 20:33:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:55,997 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:33:55,997 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:33:55,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=539, Invalid=3493, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 20:33:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:33:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2018-02-02 20:33:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 20:33:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 190 transitions. [2018-02-02 20:33:56,000 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 190 transitions. Word has length 94 [2018-02-02 20:33:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:56,001 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 190 transitions. [2018-02-02 20:33:56,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:33:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 190 transitions. [2018-02-02 20:33:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:33:56,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:56,001 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:56,002 INFO L371 AbstractCegarLoop]: === Iteration 45 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:56,002 INFO L82 PathProgramCache]: Analyzing trace with hash 416810835, now seen corresponding path program 2 times [2018-02-02 20:33:56,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:56,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:33:56,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:56,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:33:56,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:56,690 INFO L182 omatonBuilderFactory]: Interpolants [13715#true, 13716#false, 13717#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 13718#(= 0 |ldv_malloc_#t~malloc1.offset|), 13719#(= 0 |ldv_malloc_#res.offset|), 13720#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 13721#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13722#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13723#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 13724#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)))), 13725#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 13726#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 13727#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 13728#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 13729#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 13730#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset))))), 13731#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 13732#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))))), 13733#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 13734#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 13735#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 13736#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 13737#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 13738#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 13739#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:33:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:33:56,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:33:56,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:33:56,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:33:56,690 INFO L87 Difference]: Start difference. First operand 172 states and 190 transitions. Second operand 25 states. [2018-02-02 20:33:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:58,607 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-02-02 20:33:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:33:58,607 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 20:33:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:58,608 INFO L225 Difference]: With dead ends: 181 [2018-02-02 20:33:58,608 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:33:58,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=501, Invalid=3039, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:33:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:33:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2018-02-02 20:33:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 20:33:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2018-02-02 20:33:58,612 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 94 [2018-02-02 20:33:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:58,613 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-02-02 20:33:58,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:33:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2018-02-02 20:33:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 20:33:58,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:58,614 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:58,614 INFO L371 AbstractCegarLoop]: === Iteration 46 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash 904599989, now seen corresponding path program 2 times [2018-02-02 20:33:58,614 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:58,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 20:33:58,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:58,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:33:58,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:33:58,678 INFO L182 omatonBuilderFactory]: Interpolants [14164#true, 14165#false, 14166#(<= 10 entry_point_~len~0), 14167#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 14168#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 14169#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 14170#(<= |alloc_17_#in~len| 2)] [2018-02-02 20:33:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 20:33:58,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:33:58,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:33:58,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:33:58,678 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 7 states. [2018-02-02 20:33:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:58,719 INFO L93 Difference]: Finished difference Result 207 states and 227 transitions. [2018-02-02 20:33:58,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:33:58,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-02-02 20:33:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:58,720 INFO L225 Difference]: With dead ends: 207 [2018-02-02 20:33:58,720 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 20:33:58,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:33:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 20:33:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 178. [2018-02-02 20:33:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:33:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 195 transitions. [2018-02-02 20:33:58,724 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 195 transitions. Word has length 97 [2018-02-02 20:33:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:58,724 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 195 transitions. [2018-02-02 20:33:58,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:33:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 195 transitions. [2018-02-02 20:33:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 20:33:58,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:58,725 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:33:58,725 INFO L371 AbstractCegarLoop]: === Iteration 47 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:58,725 INFO L82 PathProgramCache]: Analyzing trace with hash 416534570, now seen corresponding path program 2 times [2018-02-02 20:33:58,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:58,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:33:58,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:58,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:33:58,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:33:58,786 INFO L182 omatonBuilderFactory]: Interpolants [14560#(<= 10 entry_point_~len~0), 14561#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 14562#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 14563#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 14564#(<= |free_17_#in~len| 2), 14558#true, 14559#false] [2018-02-02 20:33:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:33:58,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:33:58,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:33:58,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:33:58,787 INFO L87 Difference]: Start difference. First operand 178 states and 195 transitions. Second operand 7 states. [2018-02-02 20:33:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:58,810 INFO L93 Difference]: Finished difference Result 205 states and 218 transitions. [2018-02-02 20:33:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:33:58,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-02-02 20:33:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:58,812 INFO L225 Difference]: With dead ends: 205 [2018-02-02 20:33:58,812 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 20:33:58,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:33:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 20:33:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 184. [2018-02-02 20:33:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 20:33:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 204 transitions. [2018-02-02 20:33:58,815 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 204 transitions. Word has length 97 [2018-02-02 20:33:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:58,815 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 204 transitions. [2018-02-02 20:33:58,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:33:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 204 transitions. [2018-02-02 20:33:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:33:58,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:58,816 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:33:58,816 INFO L371 AbstractCegarLoop]: === Iteration 48 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:58,816 INFO L82 PathProgramCache]: Analyzing trace with hash 908016167, now seen corresponding path program 2 times [2018-02-02 20:33:58,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:58,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 20:33:59,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:59,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:33:59,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:33:59,188 INFO L182 omatonBuilderFactory]: Interpolants [14956#true, 14957#false, 14958#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 14959#(= 0 |ldv_malloc_#t~malloc1.offset|), 14960#(= 0 |ldv_malloc_#res.offset|), 14961#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 14962#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 14963#(= entry_point_~array~0.offset 0), 14964#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))), 14965#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))), 14966#(= 0 |alloc_17_#in~array.offset|), 14967#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 14968#(= alloc_17_~array.offset 0), 14969#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 14970#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 14971#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (* 4 alloc_17_~i~0)))), 14972#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 14973#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 14974#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-02 20:33:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 20:33:59,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:33:59,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:33:59,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:33:59,189 INFO L87 Difference]: Start difference. First operand 184 states and 204 transitions. Second operand 19 states. [2018-02-02 20:33:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:33:59,387 INFO L93 Difference]: Finished difference Result 190 states and 210 transitions. [2018-02-02 20:33:59,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:33:59,388 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2018-02-02 20:33:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:33:59,388 INFO L225 Difference]: With dead ends: 190 [2018-02-02 20:33:59,388 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 20:33:59,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:33:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 20:33:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2018-02-02 20:33:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 20:33:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 207 transitions. [2018-02-02 20:33:59,391 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 207 transitions. Word has length 100 [2018-02-02 20:33:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:33:59,391 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 207 transitions. [2018-02-02 20:33:59,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:33:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 207 transitions. [2018-02-02 20:33:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:33:59,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:33:59,392 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:33:59,392 INFO L371 AbstractCegarLoop]: === Iteration 49 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:33:59,392 INFO L82 PathProgramCache]: Analyzing trace with hash 908016168, now seen corresponding path program 2 times [2018-02-02 20:33:59,392 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:33:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:33:59,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:33:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 20:33:59,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:33:59,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:33:59,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:33:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:33:59,793 INFO L182 omatonBuilderFactory]: Interpolants [15392#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 15393#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 15394#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 15395#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 15396#(= |#valid| |old(#valid)|), 15397#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 15398#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 15377#true, 15378#false, 15379#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15380#(= 0 |ldv_malloc_#t~malloc1.offset|), 15381#(= 0 |ldv_malloc_#res.offset|), 15382#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15383#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15384#(= entry_point_~array~0.offset 0), 15385#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))), 15386#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))), 15387#(= 0 |alloc_17_#in~array.offset|), 15388#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15389#(= alloc_17_~array.offset 0), 15390#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 15391#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-02 20:33:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 20:33:59,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:33:59,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:33:59,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:33:59,794 INFO L87 Difference]: Start difference. First operand 186 states and 207 transitions. Second operand 22 states. [2018-02-02 20:34:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:00,149 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2018-02-02 20:34:00,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:34:00,149 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-02 20:34:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:00,150 INFO L225 Difference]: With dead ends: 191 [2018-02-02 20:34:00,150 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 20:34:00,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:34:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 20:34:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2018-02-02 20:34:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 20:34:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2018-02-02 20:34:00,154 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 100 [2018-02-02 20:34:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:00,154 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2018-02-02 20:34:00,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:34:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2018-02-02 20:34:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:34:00,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:00,155 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:00,155 INFO L371 AbstractCegarLoop]: === Iteration 50 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash 790845752, now seen corresponding path program 3 times [2018-02-02 20:34:00,156 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:00,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 2 proven. 217 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:34:00,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:00,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:34:00,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:34:00,926 INFO L182 omatonBuilderFactory]: Interpolants [15815#true, 15816#false, 15817#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15818#(= 0 |ldv_malloc_#t~malloc1.offset|), 15819#(= 0 |ldv_malloc_#res.offset|), 15820#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15821#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15822#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15823#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 15824#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 15825#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 15826#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 15827#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 15828#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 15829#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 15830#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 15831#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 15832#(and (or (<= (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 15833#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 15834#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 15835#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 15836#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 15837#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 15838#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 15839#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 15840#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:34:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 2 proven. 217 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:34:00,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:34:00,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:34:00,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:34:00,926 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand 26 states. [2018-02-02 20:34:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:03,071 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions. [2018-02-02 20:34:03,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 20:34:03,071 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-02 20:34:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:03,072 INFO L225 Difference]: With dead ends: 198 [2018-02-02 20:34:03,072 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 20:34:03,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=554, Invalid=3736, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 20:34:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 20:34:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-02-02 20:34:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 20:34:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions. [2018-02-02 20:34:03,076 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 99 [2018-02-02 20:34:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:03,076 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions. [2018-02-02 20:34:03,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:34:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions. [2018-02-02 20:34:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:34:03,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:03,077 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:03,077 INFO L371 AbstractCegarLoop]: === Iteration 51 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1853741113, now seen corresponding path program 1 times [2018-02-02 20:34:03,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:03,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:34:03,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:03,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:34:03,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:34:03,206 INFO L182 omatonBuilderFactory]: Interpolants [16320#(or (<= 4 (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 16321#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 16322#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 16323#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 16311#true, 16312#false, 16313#(= 0 |ldv_malloc_#t~malloc1.offset|), 16314#(= 0 |ldv_malloc_#res.offset|), 16315#(= 0 |entry_point_#t~ret10.offset|), 16316#(= 0 entry_point_~array~0.offset), 16317#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 16318#(and (or (<= 0 alloc_17_~j~0) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 16319#(and (or (not (= alloc_17_~array.offset 0)) (<= (+ alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|))] [2018-02-02 20:34:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:34:03,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:34:03,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:34:03,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:34:03,206 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand 13 states. [2018-02-02 20:34:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:03,356 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2018-02-02 20:34:03,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:34:03,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-02-02 20:34:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:03,357 INFO L225 Difference]: With dead ends: 198 [2018-02-02 20:34:03,357 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 20:34:03,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:34:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 20:34:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-02-02 20:34:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 20:34:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-02-02 20:34:03,359 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 101 [2018-02-02 20:34:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:03,359 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-02-02 20:34:03,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:34:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-02-02 20:34:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:34:03,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:03,360 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:03,360 INFO L371 AbstractCegarLoop]: === Iteration 52 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1253585412, now seen corresponding path program 3 times [2018-02-02 20:34:03,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:03,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:34:04,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:04,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:34:04,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:34:04,184 INFO L182 omatonBuilderFactory]: Interpolants [16719#true, 16720#false, 16721#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 16722#(= 0 |ldv_malloc_#t~malloc1.offset|), 16723#(= 0 |ldv_malloc_#res.offset|), 16724#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 16725#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 16726#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 40 (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 16727#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) 4))) 4) 1) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) 4))))), 16728#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) 4)))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) 4))) 4) 2) entry_point_~i~2)), 16729#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) 4)))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) 4))) 4) 3) entry_point_~i~2)), 16730#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) 4)))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) 4))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 16731#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) 4))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) 4)))) (= entry_point_~array~0.offset 0)), 16732#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) 4)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 16733#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ (* 4 entry_point_~i~2) 8) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 16734#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ (* 4 entry_point_~i~2) 8) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 16735#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 16736#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (= entry_point_~array~0.offset 0)), 16737#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 16738#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ 8 4)))), 16739#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ 8 4))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 16740#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)) 4)))), 16741#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))), 16742#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 16743#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 20:34:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:34:04,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:34:04,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:34:04,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:34:04,185 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 25 states. [2018-02-02 20:34:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:05,899 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2018-02-02 20:34:05,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:34:05,899 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-02 20:34:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:05,900 INFO L225 Difference]: With dead ends: 202 [2018-02-02 20:34:05,900 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 20:34:05,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=477, Invalid=3429, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 20:34:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 20:34:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2018-02-02 20:34:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:34:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2018-02-02 20:34:05,904 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 100 [2018-02-02 20:34:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:05,904 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2018-02-02 20:34:05,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:34:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2018-02-02 20:34:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:34:05,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:05,905 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:05,905 INFO L371 AbstractCegarLoop]: === Iteration 53 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1253585411, now seen corresponding path program 3 times [2018-02-02 20:34:05,905 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:05,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:34:06,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:06,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:34:06,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:34:06,493 INFO L182 omatonBuilderFactory]: Interpolants [17216#false, 17217#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17218#(= 0 |ldv_malloc_#t~malloc1.offset|), 17219#(= 0 |ldv_malloc_#res.offset|), 17220#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17221#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17222#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17223#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 17224#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)))) 4) 2) entry_point_~i~2)), 17225#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (= entry_point_~array~0.offset 0)), 17226#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))) 4) 4) entry_point_~i~2)), 17227#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))))), 17228#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= 0 entry_point_~array~0.offset)), 17229#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))), 17230#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 17231#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 17232#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))), 17233#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 17234#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 17235#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 17236#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 17237#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 17238#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 17239#(= |free_17_#t~mem9.base| 0), 17215#true] [2018-02-02 20:34:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:34:06,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:34:06,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:34:06,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:34:06,494 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand 25 states. [2018-02-02 20:34:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:08,180 INFO L93 Difference]: Finished difference Result 201 states and 218 transitions. [2018-02-02 20:34:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:34:08,180 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-02 20:34:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:08,180 INFO L225 Difference]: With dead ends: 201 [2018-02-02 20:34:08,181 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 20:34:08,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=434, Invalid=2872, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:34:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 20:34:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2018-02-02 20:34:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:34:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2018-02-02 20:34:08,183 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 100 [2018-02-02 20:34:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:08,183 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2018-02-02 20:34:08,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:34:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2018-02-02 20:34:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 20:34:08,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:08,184 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:34:08,184 INFO L371 AbstractCegarLoop]: === Iteration 54 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:08,184 INFO L82 PathProgramCache]: Analyzing trace with hash 725176200, now seen corresponding path program 2 times [2018-02-02 20:34:08,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:08,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 20:34:08,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:08,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:34:08,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:34:08,595 INFO L182 omatonBuilderFactory]: Interpolants [17700#true, 17701#false, 17702#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17703#(= 0 |ldv_malloc_#t~malloc1.offset|), 17704#(= 0 |ldv_malloc_#res.offset|), 17705#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17706#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17707#(= entry_point_~array~0.offset 0), 17708#(and (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) 4)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 17709#(and (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~len~0) (* 4 entry_point_~i~2))) (= entry_point_~array~0.offset 0)), 17710#(= 0 |alloc_17_#in~array.offset|), 17711#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 17712#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 17713#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 17714#(= |#valid| |old(#valid)|), 17715#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 17716#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 17717#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 17718#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 17719#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 17720#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 17721#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 17722#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 17723#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 20:34:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 20:34:08,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:34:08,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:34:08,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:34:08,596 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 24 states. [2018-02-02 20:34:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:09,009 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2018-02-02 20:34:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:34:09,010 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 102 [2018-02-02 20:34:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:09,010 INFO L225 Difference]: With dead ends: 208 [2018-02-02 20:34:09,010 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 20:34:09,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:34:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 20:34:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2018-02-02 20:34:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:34:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 214 transitions. [2018-02-02 20:34:09,013 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 214 transitions. Word has length 102 [2018-02-02 20:34:09,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:09,014 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 214 transitions. [2018-02-02 20:34:09,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:34:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 214 transitions. [2018-02-02 20:34:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 20:34:09,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:09,015 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:09,015 INFO L371 AbstractCegarLoop]: === Iteration 55 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1631399634, now seen corresponding path program 1 times [2018-02-02 20:34:09,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:09,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 20:34:09,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:09,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:34:09,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:34:09,515 INFO L182 omatonBuilderFactory]: Interpolants [18176#(= 0 entry_point_~array~0.offset), 18177#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 18178#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= 0 |alloc_17_#t~ret3.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 18179#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 18180#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))))), 18181#(or (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))) (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 18182#(or (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 18183#(or (and (= |alloc_17_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 18184#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 18185#(or (<= 1 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18186#(or (<= 0 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18187#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18188#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 18189#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 18190#(and (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 18191#(= 0 |free_17_#t~mem9.offset|), 18171#true, 18172#false, 18173#(= 0 |ldv_malloc_#t~malloc1.offset|), 18174#(= 0 |ldv_malloc_#res.offset|), 18175#(= 0 |entry_point_#t~ret10.offset|)] [2018-02-02 20:34:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 20:34:09,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:34:09,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:34:09,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:34:09,516 INFO L87 Difference]: Start difference. First operand 194 states and 214 transitions. Second operand 21 states. [2018-02-02 20:34:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:09,840 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2018-02-02 20:34:09,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:34:09,840 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-02-02 20:34:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:09,841 INFO L225 Difference]: With dead ends: 229 [2018-02-02 20:34:09,841 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 20:34:09,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:34:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 20:34:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 222. [2018-02-02 20:34:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 20:34:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 252 transitions. [2018-02-02 20:34:09,843 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 252 transitions. Word has length 102 [2018-02-02 20:34:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:09,844 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 252 transitions. [2018-02-02 20:34:09,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:34:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 252 transitions. [2018-02-02 20:34:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 20:34:09,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:09,845 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:09,845 INFO L371 AbstractCegarLoop]: === Iteration 56 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:09,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1631399633, now seen corresponding path program 1 times [2018-02-02 20:34:09,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:09,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:34:10,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:10,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:34:10,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:34:10,067 INFO L182 omatonBuilderFactory]: Interpolants [18660#true, 18661#false, 18662#(= 0 |ldv_malloc_#t~malloc1.offset|), 18663#(= 0 |ldv_malloc_#res.offset|), 18664#(= 0 |entry_point_#t~ret10.offset|), 18665#(= 0 entry_point_~array~0.offset), 18666#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 18667#(and (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 18668#(and (or (and (<= 0 alloc_17_~j~0) (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 18669#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 18670#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 18671#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 18672#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 18673#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 18674#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 18675#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:34:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:34:10,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:34:10,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:34:10,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:34:10,067 INFO L87 Difference]: Start difference. First operand 222 states and 252 transitions. Second operand 16 states. [2018-02-02 20:34:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:10,262 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2018-02-02 20:34:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:34:10,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-02-02 20:34:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:10,263 INFO L225 Difference]: With dead ends: 256 [2018-02-02 20:34:10,263 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 20:34:10,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:34:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 20:34:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 249. [2018-02-02 20:34:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 20:34:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 288 transitions. [2018-02-02 20:34:10,266 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 288 transitions. Word has length 102 [2018-02-02 20:34:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:10,266 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 288 transitions. [2018-02-02 20:34:10,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:34:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 288 transitions. [2018-02-02 20:34:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 20:34:10,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:10,266 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:10,267 INFO L371 AbstractCegarLoop]: === Iteration 57 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash -866938560, now seen corresponding path program 3 times [2018-02-02 20:34:10,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:10,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:34:10,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:10,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:34:10,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:34:10,308 INFO L182 omatonBuilderFactory]: Interpolants [19200#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 19201#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3)), 19202#(<= |free_17_#in~len| 3), 19195#true, 19196#false, 19197#(<= 10 entry_point_~len~0), 19198#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 19199#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1))] [2018-02-02 20:34:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:34:10,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:34:10,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:34:10,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:34:10,309 INFO L87 Difference]: Start difference. First operand 249 states and 288 transitions. Second operand 8 states. [2018-02-02 20:34:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:10,343 INFO L93 Difference]: Finished difference Result 303 states and 351 transitions. [2018-02-02 20:34:10,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:34:10,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2018-02-02 20:34:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:10,344 INFO L225 Difference]: With dead ends: 303 [2018-02-02 20:34:10,345 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 20:34:10,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:34:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 20:34:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 267. [2018-02-02 20:34:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 20:34:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 317 transitions. [2018-02-02 20:34:10,348 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 317 transitions. Word has length 103 [2018-02-02 20:34:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:10,348 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 317 transitions. [2018-02-02 20:34:10,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:34:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 317 transitions. [2018-02-02 20:34:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 20:34:10,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:10,349 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 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:34:10,349 INFO L371 AbstractCegarLoop]: === Iteration 58 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:10,349 INFO L82 PathProgramCache]: Analyzing trace with hash 28781774, now seen corresponding path program 4 times [2018-02-02 20:34:10,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:10,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:34:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 226 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:34:11,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:11,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:34:11,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:34:11,069 INFO L182 omatonBuilderFactory]: Interpolants [19776#false, 19777#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 19778#(= 0 |ldv_malloc_#t~malloc1.offset|), 19779#(= 0 |ldv_malloc_#res.offset|), 19780#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 19781#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 19782#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 19783#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 19784#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)))) 4) 2) entry_point_~i~2)), 19785#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (= entry_point_~array~0.offset 0)), 19786#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))) 4) 4) entry_point_~i~2)), 19787#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))))), 19788#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 19789#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 19790#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 19791#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 19792#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))), 19793#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 19794#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 19795#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 19796#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 19797#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 19798#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 19799#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 19800#(= 1 (select |#valid| free_17_~array.base)), 19775#true] [2018-02-02 20:34:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 226 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:34:11,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:34:11,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:34:11,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:34:11,069 INFO L87 Difference]: Start difference. First operand 267 states and 317 transitions. Second operand 26 states. [2018-02-02 20:34:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:12,793 INFO L93 Difference]: Finished difference Result 279 states and 327 transitions. [2018-02-02 20:34:12,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:34:12,793 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-02-02 20:34:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:12,794 INFO L225 Difference]: With dead ends: 279 [2018-02-02 20:34:12,794 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 20:34:12,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=492, Invalid=3668, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:34:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 20:34:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2018-02-02 20:34:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-02 20:34:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 323 transitions. [2018-02-02 20:34:12,796 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 323 transitions. Word has length 105 [2018-02-02 20:34:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:12,796 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 323 transitions. [2018-02-02 20:34:12,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:34:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 323 transitions. [2018-02-02 20:34:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:34:12,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:12,797 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:12,797 INFO L371 AbstractCegarLoop]: === Iteration 59 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1459612322, now seen corresponding path program 1 times [2018-02-02 20:34:12,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:12,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-02 20:34:13,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:13,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:34:13,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:34:13,087 INFO L182 omatonBuilderFactory]: Interpolants [20448#(= 0 |alloc_17_#t~mem6.offset|), 20431#true, 20432#false, 20433#(= 0 |ldv_malloc_#t~malloc1.offset|), 20434#(= 0 |ldv_malloc_#res.offset|), 20435#(= 0 |entry_point_#t~ret10.offset|), 20436#(= 0 entry_point_~array~0.offset), 20437#(= 0 |alloc_17_#in~array.offset|), 20438#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 20439#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 20440#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 20441#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 20442#(and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 20443#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0)), 20444#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))), 20445#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 20446#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 20447#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))] [2018-02-02 20:34:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-02 20:34:13,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:34:13,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:34:13,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:34:13,088 INFO L87 Difference]: Start difference. First operand 272 states and 323 transitions. Second operand 18 states. [2018-02-02 20:34:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:13,529 INFO L93 Difference]: Finished difference Result 299 states and 353 transitions. [2018-02-02 20:34:13,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:34:13,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-02-02 20:34:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:13,530 INFO L225 Difference]: With dead ends: 299 [2018-02-02 20:34:13,530 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 20:34:13,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:34:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 20:34:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 289. [2018-02-02 20:34:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-02-02 20:34:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 345 transitions. [2018-02-02 20:34:13,533 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 345 transitions. Word has length 107 [2018-02-02 20:34:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:13,533 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 345 transitions. [2018-02-02 20:34:13,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:34:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 345 transitions. [2018-02-02 20:34:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:34:13,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:13,534 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:13,534 INFO L371 AbstractCegarLoop]: === Iteration 60 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:13,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1459612321, now seen corresponding path program 2 times [2018-02-02 20:34:13,535 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:13,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 13 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 20:34:14,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:14,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:34:14,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:34:14,535 INFO L182 omatonBuilderFactory]: Interpolants [21071#true, 21072#false, 21073#(= 0 (select |#valid| 0)), 21074#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10)), 21075#(= (select |old(#valid)| 0) (select |#valid| 0)), 21076#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 21077#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 21078#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 21079#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 21080#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 21081#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0))) (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) 4)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 21082#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0)))), 21083#(and (= 0 (select |#valid| 0)) (= 0 |alloc_17_#in~array.offset|)), 21084#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 21085#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 21086#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 21087#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 21088#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |#valid| 0))), 21089#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= 0 (select |#valid| 0))), 21090#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 21091#(= |#valid| |old(#valid)|), 21092#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 21093#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 21094#(and (= alloc_17_~array.offset 0) (or (and (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (or (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (not (= 0 |alloc_17_#t~ret3.base|))) (<= (* 4 alloc_17_~i~0) 3))), 21095#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 1) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (or (not (= 0 alloc_17_~p~0.base)) (<= (* 4 alloc_17_~i~0) 3))), 21096#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (or (<= (* 4 alloc_17_~i~0) 3) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4)))) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4)), 21097#(and (= alloc_17_~array.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7)) (<= (* 4 alloc_17_~i~0) 8) (or (<= (* 4 alloc_17_~i~0) 7) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))))), 21098#(and (= alloc_17_~array.offset 0) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= alloc_17_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3))), 21099#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= |alloc_17_#t~mem6.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (or (not (= 1 (select |#valid| |alloc_17_#t~mem6.base|))) (and (<= alloc_17_~j~0 1) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))))))), 21100#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= alloc_17_~j~0 1)))), 21101#(and (= alloc_17_~array.offset 0) (or (and (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0))), 21102#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 21103#(= 1 (select |#valid| |alloc_17_#t~mem6.base|))] [2018-02-02 20:34:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 13 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 20:34:14,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:34:14,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:34:14,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:34:14,536 INFO L87 Difference]: Start difference. First operand 289 states and 345 transitions. Second operand 33 states. [2018-02-02 20:34:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:15,862 INFO L93 Difference]: Finished difference Result 299 states and 351 transitions. [2018-02-02 20:34:15,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:34:15,862 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2018-02-02 20:34:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:15,863 INFO L225 Difference]: With dead ends: 299 [2018-02-02 20:34:15,863 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 20:34:15,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=564, Invalid=3726, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 20:34:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 20:34:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 289. [2018-02-02 20:34:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-02-02 20:34:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 344 transitions. [2018-02-02 20:34:15,866 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 344 transitions. Word has length 107 [2018-02-02 20:34:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:15,866 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 344 transitions. [2018-02-02 20:34:15,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:34:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 344 transitions. [2018-02-02 20:34:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:34:15,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:15,867 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:15,867 INFO L371 AbstractCegarLoop]: === Iteration 61 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:15,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1090017500, now seen corresponding path program 1 times [2018-02-02 20:34:15,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:15,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:34:16,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:16,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:34:16,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:34:16,139 INFO L182 omatonBuilderFactory]: Interpolants [21760#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 21761#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 21762#(and (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 21763#(and (= 0 entry_point_~array~0.offset) (not (= 0 entry_point_~array~0.base))), 21764#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 21765#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 21766#(and (or (and (<= 0 alloc_17_~j~0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 21767#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 21768#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 21769#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 21770#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) entry_point_~array~0.base))), 21771#(and (= 0 |free_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|)) (= 1 (select |#valid| |free_17_#in~array.base|))), 21772#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) free_17_~array.base)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select |#valid| free_17_~array.base))), 21773#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 21774#(= 1 (select |#valid| free_17_~array.base)), 21758#true, 21759#false] [2018-02-02 20:34:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:34:16,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:34:16,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:34:16,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:34:16,140 INFO L87 Difference]: Start difference. First operand 289 states and 344 transitions. Second operand 17 states. [2018-02-02 20:34:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:16,395 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2018-02-02 20:34:16,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:34:16,396 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-02-02 20:34:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:16,396 INFO L225 Difference]: With dead ends: 291 [2018-02-02 20:34:16,396 INFO L226 Difference]: Without dead ends: 291 [2018-02-02 20:34:16,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:34:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-02 20:34:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-02-02 20:34:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-02-02 20:34:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 342 transitions. [2018-02-02 20:34:16,400 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 342 transitions. Word has length 107 [2018-02-02 20:34:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:16,400 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 342 transitions. [2018-02-02 20:34:16,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:34:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 342 transitions. [2018-02-02 20:34:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:34:16,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:16,401 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:16,401 INFO L371 AbstractCegarLoop]: === Iteration 62 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1090017501, now seen corresponding path program 1 times [2018-02-02 20:34:16,401 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:16,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-02 20:34:16,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:16,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:34:16,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:34:16,719 INFO L182 omatonBuilderFactory]: Interpolants [22373#true, 22374#false, 22375#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 22376#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 22377#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 22378#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 22379#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 22380#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 22381#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 22382#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 22383#(and (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 22384#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 22385#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 22386#(and (or (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (= 0 (select |old(#valid)| alloc_17_~array.base))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 22387#(= |old(#length)| |#length|), 22388#(or (= 0 (select |old(#valid)| |alloc_17_#in~array.base|)) (= (select |old(#length)| |alloc_17_#in~array.base|) (select |#length| |alloc_17_#in~array.base|))), 22389#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 22390#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 22391#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 22392#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 22393#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 22394#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-02 20:34:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-02 20:34:16,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:34:16,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:34:16,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:34:16,720 INFO L87 Difference]: Start difference. First operand 289 states and 342 transitions. Second operand 22 states. [2018-02-02 20:34:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:17,257 INFO L93 Difference]: Finished difference Result 300 states and 344 transitions. [2018-02-02 20:34:17,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:34:17,257 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2018-02-02 20:34:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:17,258 INFO L225 Difference]: With dead ends: 300 [2018-02-02 20:34:17,258 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 20:34:17,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:34:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 20:34:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 289. [2018-02-02 20:34:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-02-02 20:34:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 339 transitions. [2018-02-02 20:34:17,261 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 339 transitions. Word has length 107 [2018-02-02 20:34:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:17,261 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 339 transitions. [2018-02-02 20:34:17,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:34:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 339 transitions. [2018-02-02 20:34:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-02 20:34:17,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:17,261 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 4, 4, 4, 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:34:17,261 INFO L371 AbstractCegarLoop]: === Iteration 63 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:17,261 INFO L82 PathProgramCache]: Analyzing trace with hash 892235046, now seen corresponding path program 4 times [2018-02-02 20:34:17,262 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:17,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:34:18,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:18,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:34:18,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:34:18,021 INFO L182 omatonBuilderFactory]: Interpolants [23014#true, 23015#false, 23016#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 23017#(= 0 |ldv_malloc_#t~malloc1.offset|), 23018#(= 0 |ldv_malloc_#res.offset|), 23019#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 23020#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 23021#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 23022#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 23023#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 23024#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 23025#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 23026#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 23027#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 16 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))) (= 0 entry_point_~array~0.offset)), 23028#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 23029#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 23030#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)))), 23031#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 23032#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 23033#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 16)) (= free_17_~array.offset 0)), 23034#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12)))) (= free_17_~array.offset 0)), 23035#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 23036#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 23037#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 23038#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 20:34:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:34:18,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:34:18,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:34:18,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:34:18,021 INFO L87 Difference]: Start difference. First operand 289 states and 339 transitions. Second operand 25 states. [2018-02-02 20:34:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:19,652 INFO L93 Difference]: Finished difference Result 300 states and 347 transitions. [2018-02-02 20:34:19,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:34:19,652 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-02-02 20:34:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:19,653 INFO L225 Difference]: With dead ends: 300 [2018-02-02 20:34:19,653 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 20:34:19,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=424, Invalid=3358, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:34:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 20:34:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 290. [2018-02-02 20:34:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 20:34:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 341 transitions. [2018-02-02 20:34:19,655 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 341 transitions. Word has length 106 [2018-02-02 20:34:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:19,656 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 341 transitions. [2018-02-02 20:34:19,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:34:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 341 transitions. [2018-02-02 20:34:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-02 20:34:19,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:19,656 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 4, 4, 4, 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:34:19,656 INFO L371 AbstractCegarLoop]: === Iteration 64 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash 892235047, now seen corresponding path program 4 times [2018-02-02 20:34:19,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:19,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:34:20,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:20,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:34:20,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:34:20,261 INFO L182 omatonBuilderFactory]: Interpolants [23704#true, 23705#false, 23706#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 23707#(= 0 |ldv_malloc_#t~malloc1.offset|), 23708#(= 0 |ldv_malloc_#res.offset|), 23709#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 23710#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 23711#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 23712#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 23713#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 23714#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 23715#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24))) (- entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 23716#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 23717#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 16)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 23718#(and (= 0 entry_point_~array~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 23719#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 23720#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (= entry_point_~array~0.offset 0)), 23721#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 23722#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 23723#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 16)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 23724#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12)))) (= free_17_~array.offset 0)), 23725#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 23726#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 23727#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 23728#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:34:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:34:20,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:34:20,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:34:20,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:34:20,262 INFO L87 Difference]: Start difference. First operand 290 states and 341 transitions. Second operand 25 states. [2018-02-02 20:34:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:21,856 INFO L93 Difference]: Finished difference Result 299 states and 346 transitions. [2018-02-02 20:34:21,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:34:21,857 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-02-02 20:34:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:21,858 INFO L225 Difference]: With dead ends: 299 [2018-02-02 20:34:21,858 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 20:34:21,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=371, Invalid=2709, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:34:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 20:34:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 290. [2018-02-02 20:34:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 20:34:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 340 transitions. [2018-02-02 20:34:21,861 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 340 transitions. Word has length 106 [2018-02-02 20:34:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:21,861 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 340 transitions. [2018-02-02 20:34:21,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:34:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 340 transitions. [2018-02-02 20:34:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 20:34:21,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:21,862 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:21,862 INFO L371 AbstractCegarLoop]: === Iteration 65 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -569195816, now seen corresponding path program 1 times [2018-02-02 20:34:21,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:21,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:34:23,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:23,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 20:34:23,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:34:23,223 INFO L182 omatonBuilderFactory]: Interpolants [24384#(= 0 |ldv_malloc_#t~malloc1.offset|), 24385#(= 0 |ldv_malloc_#res.offset|), 24386#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 24387#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 24388#(and (<= 10 entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 24389#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 24390#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 24391#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 24392#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 24393#(and (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)))), 24394#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 6) entry_point_~i~2)), 24395#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (<= (+ (div (+ (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 24396#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 24397#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 4 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))) (= entry_point_~array~0.offset 0)), 24398#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 24399#(and (= entry_point_~array~0.offset 0) (or (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 24400#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 24401#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 24402#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24403#(and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 24404#(and (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 24405#(or (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (and (= (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base))))) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 24406#(or (and (= |alloc_17_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (and (= (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base))))) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 24407#(and (= (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base))))) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 24408#(and (or (not (= |alloc_17_#in~array.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 24409#(and (or (not (= |alloc_17_#in~array.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 24410#(and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (not (= |alloc_17_#in~array.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 24411#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 24412#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 24413#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 24414#(= 0 |free_17_#t~mem9.offset|), 24381#true, 24382#false, 24383#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10))] [2018-02-02 20:34:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:34:23,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 20:34:23,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 20:34:23,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:34:23,224 INFO L87 Difference]: Start difference. First operand 290 states and 340 transitions. Second operand 34 states. [2018-02-02 20:34:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:27,015 INFO L93 Difference]: Finished difference Result 298 states and 343 transitions. [2018-02-02 20:34:27,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 20:34:27,015 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2018-02-02 20:34:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:27,016 INFO L225 Difference]: With dead ends: 298 [2018-02-02 20:34:27,016 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 20:34:27,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=749, Invalid=5571, Unknown=0, NotChecked=0, Total=6320 [2018-02-02 20:34:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 20:34:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 290. [2018-02-02 20:34:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 20:34:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 339 transitions. [2018-02-02 20:34:27,021 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 339 transitions. Word has length 108 [2018-02-02 20:34:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:27,021 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 339 transitions. [2018-02-02 20:34:27,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 20:34:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 339 transitions. [2018-02-02 20:34:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 20:34:27,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:27,022 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:27,022 INFO L371 AbstractCegarLoop]: === Iteration 66 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash -569195815, now seen corresponding path program 1 times [2018-02-02 20:34:27,023 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:27,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:34:28,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:28,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:34:28,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:34:28,244 INFO L182 omatonBuilderFactory]: Interpolants [25095#true, 25096#false, 25097#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 25098#(= 0 |ldv_malloc_#t~malloc1.offset|), 25099#(= 0 |ldv_malloc_#res.offset|), 25100#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 25101#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 25102#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 25103#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 25104#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 25105#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25106#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 25107#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2)), 25108#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2)), 25109#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25110#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)))))), 25111#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 25112#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 25113#(and (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))) (= entry_point_~array~0.offset 0)), 25114#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 25115#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 25116#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25117#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25118#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25119#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25120#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 25121#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= |alloc_17_#in~array.offset| 0))), 25122#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 25123#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 25124#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 25125#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 25126#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:34:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:34:28,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:34:28,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:34:28,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:34:28,245 INFO L87 Difference]: Start difference. First operand 290 states and 339 transitions. Second operand 32 states. [2018-02-02 20:34:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:31,741 INFO L93 Difference]: Finished difference Result 297 states and 342 transitions. [2018-02-02 20:34:31,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 20:34:31,742 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 108 [2018-02-02 20:34:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:31,742 INFO L225 Difference]: With dead ends: 297 [2018-02-02 20:34:31,743 INFO L226 Difference]: Without dead ends: 297 [2018-02-02 20:34:31,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=684, Invalid=4572, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 20:34:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-02-02 20:34:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2018-02-02 20:34:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 20:34:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 338 transitions. [2018-02-02 20:34:31,747 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 338 transitions. Word has length 108 [2018-02-02 20:34:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:31,747 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 338 transitions. [2018-02-02 20:34:31,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:34:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 338 transitions. [2018-02-02 20:34:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 20:34:31,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:31,748 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 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] [2018-02-02 20:34:31,748 INFO L371 AbstractCegarLoop]: === Iteration 67 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1766865151, now seen corresponding path program 1 times [2018-02-02 20:34:31,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:31,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 20:34:32,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:32,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:34:32,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:34:32,476 INFO L182 omatonBuilderFactory]: Interpolants [25796#true, 25797#false, 25798#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 25799#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 25800#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 25801#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|) (= 1 (select |#valid| |entry_point_#t~ret10.base|))), 25802#(and (= 1 (select |#valid| entry_point_~array~0.base)) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 25803#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 25804#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (or (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 25805#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= (* 4 entry_point_~len~0) (* 4 entry_point_~i~2))))), 25806#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 25807#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 25808#(= |#valid| |old(#valid)|), 25809#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 25810#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 25811#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 25812#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 25813#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 25814#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (and (<= (* 4 alloc_17_~i~0) 4) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 25815#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (and (<= (* 4 alloc_17_~i~0) 8) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 25816#(and (= alloc_17_~array.offset 0) (or (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3)) (<= alloc_17_~j~0 1)), 25817#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 1) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))), 25818#(and (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0)) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 0)), 25819#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| alloc_17_~array.base))), 25820#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 25821#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 20:34:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 20:34:32,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:34:32,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:34:32,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:34:32,477 INFO L87 Difference]: Start difference. First operand 290 states and 338 transitions. Second operand 26 states. [2018-02-02 20:34:33,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:33,109 INFO L93 Difference]: Finished difference Result 299 states and 344 transitions. [2018-02-02 20:34:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:34:33,109 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-02-02 20:34:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:33,110 INFO L225 Difference]: With dead ends: 299 [2018-02-02 20:34:33,110 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 20:34:33,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=1658, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:34:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 20:34:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 286. [2018-02-02 20:34:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-02 20:34:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 333 transitions. [2018-02-02 20:34:33,113 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 333 transitions. Word has length 109 [2018-02-02 20:34:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:33,113 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 333 transitions. [2018-02-02 20:34:33,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:34:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 333 transitions. [2018-02-02 20:34:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 20:34:33,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:33,114 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:33,114 INFO L371 AbstractCegarLoop]: === Iteration 68 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1853951591, now seen corresponding path program 1 times [2018-02-02 20:34:33,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:33,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-02 20:34:33,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:33,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:34:33,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:34:33,164 INFO L182 omatonBuilderFactory]: Interpolants [26448#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 26449#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 26450#(<= |alloc_17_#in~len| 3), 26443#true, 26444#false, 26445#(<= 10 entry_point_~len~0), 26446#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 26447#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1))] [2018-02-02 20:34:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-02 20:34:33,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:34:33,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:34:33,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:34:33,164 INFO L87 Difference]: Start difference. First operand 286 states and 333 transitions. Second operand 8 states. [2018-02-02 20:34:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:33,204 INFO L93 Difference]: Finished difference Result 325 states and 375 transitions. [2018-02-02 20:34:33,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:34:33,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-02-02 20:34:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:33,205 INFO L225 Difference]: With dead ends: 325 [2018-02-02 20:34:33,205 INFO L226 Difference]: Without dead ends: 322 [2018-02-02 20:34:33,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:34:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-02 20:34:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2018-02-02 20:34:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 20:34:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 339 transitions. [2018-02-02 20:34:33,208 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 339 transitions. Word has length 111 [2018-02-02 20:34:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:33,208 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 339 transitions. [2018-02-02 20:34:33,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:34:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 339 transitions. [2018-02-02 20:34:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 20:34:33,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:33,210 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 4, 4, 4, 4, 4, 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:34:33,210 INFO L371 AbstractCegarLoop]: === Iteration 69 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:33,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1022907946, now seen corresponding path program 4 times [2018-02-02 20:34:33,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:33,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:34:33,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:33,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:34:33,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:34:33,283 INFO L182 omatonBuilderFactory]: Interpolants [27072#(<= 10 entry_point_~len~0), 27073#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 27074#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 27075#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 27076#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3)), 27077#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 4)), 27078#(<= |free_17_#in~len| 4), 27070#true, 27071#false] [2018-02-02 20:34:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:34:33,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:34:33,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:34:33,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:34:33,283 INFO L87 Difference]: Start difference. First operand 292 states and 339 transitions. Second operand 9 states. [2018-02-02 20:34:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:33,319 INFO L93 Difference]: Finished difference Result 350 states and 400 transitions. [2018-02-02 20:34:33,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:34:33,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2018-02-02 20:34:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:33,320 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:34:33,320 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 20:34:33,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:34:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 20:34:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 310. [2018-02-02 20:34:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 20:34:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 367 transitions. [2018-02-02 20:34:33,323 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 367 transitions. Word has length 109 [2018-02-02 20:34:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:33,323 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 367 transitions. [2018-02-02 20:34:33,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:34:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 367 transitions. [2018-02-02 20:34:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 20:34:33,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:33,324 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 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:34:33,324 INFO L371 AbstractCegarLoop]: === Iteration 70 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:33,324 INFO L82 PathProgramCache]: Analyzing trace with hash 466057188, now seen corresponding path program 5 times [2018-02-02 20:34:33,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:33,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:34:33,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:33,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:34:33,888 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:34:33,888 INFO L182 omatonBuilderFactory]: Interpolants [27741#true, 27742#false, 27743#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 27744#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 27745#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 27746#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 27747#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 27748#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) entry_point_~array~0.base))), 27749#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 27750#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 27751#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 27752#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 27753#(and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 27754#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base)))), 27755#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 27756#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base))) (= entry_point_~array~0.offset 0)), 27757#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 27758#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 27759#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16) |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 27760#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 16) free_17_~array.base))), 27761#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12))) free_17_~array.base)) (= free_17_~array.offset 0)), 27762#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))) free_17_~array.base)) (= free_17_~array.offset 0)), 27763#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4))) free_17_~array.base)) (= free_17_~array.offset 0)), 27764#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))) free_17_~array.base)) (= free_17_~array.offset 0)), 27765#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 27766#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:34:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:34:33,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:34:33,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:34:33,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:34:33,889 INFO L87 Difference]: Start difference. First operand 310 states and 367 transitions. Second operand 26 states. [2018-02-02 20:34:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:34:35,885 INFO L93 Difference]: Finished difference Result 322 states and 377 transitions. [2018-02-02 20:34:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:34:35,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2018-02-02 20:34:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:34:35,886 INFO L225 Difference]: With dead ends: 322 [2018-02-02 20:34:35,886 INFO L226 Difference]: Without dead ends: 322 [2018-02-02 20:34:35,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=445, Invalid=3715, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:34:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-02 20:34:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2018-02-02 20:34:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 20:34:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 373 transitions. [2018-02-02 20:34:35,891 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 373 transitions. Word has length 111 [2018-02-02 20:34:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:34:35,891 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 373 transitions. [2018-02-02 20:34:35,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:34:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 373 transitions. [2018-02-02 20:34:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 20:34:35,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:34:35,892 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:34:35,893 INFO L371 AbstractCegarLoop]: === Iteration 71 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 20:34:35,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1659969166, now seen corresponding path program 2 times [2018-02-02 20:34:35,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:34:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:34:35,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:34:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 1 proven. 220 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:34:37,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:34:37,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 20:34:37,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:34:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:34:37,519 INFO L182 omatonBuilderFactory]: Interpolants [28483#true, 28484#false, 28485#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 28486#(= 0 |ldv_malloc_#t~malloc1.offset|), 28487#(= 0 |ldv_malloc_#res.offset|), 28488#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 28489#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 28490#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 28491#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 28492#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 28493#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 28494#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 28495#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2)), 28496#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2)), 28497#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 28498#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)))))) (= 0 entry_point_~array~0.offset)), 28499#(and (= 0 entry_point_~array~0.offset) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 28500#(and (= 0 entry_point_~array~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 28501#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 28502#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 28503#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 28504#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 28505#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 28506#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 28507#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 28508#(and (or (and (<= 0 alloc_17_~j~0) (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 28509#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= 1 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 28510#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= 0 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 28511#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 28512#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 28513#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 28514#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= 1 (select |#valid| free_17_~array.base)) (= free_17_~array.offset 0)), 28515#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= |free_17_#t~mem9.base| 0) (= free_17_~i~1 0) (= 1 (select |#valid| free_17_~array.base)) (= free_17_~array.offset 0)), 28516#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~i~1 0) (= 1 (select |#valid| free_17_~array.base)) (= free_17_~array.offset 0)), 28517#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 1 (select |#valid| free_17_~array.base)) (= free_17_~array.offset 0)), 28518#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 28519#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:34:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 1 proven. 220 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:34:37,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 20:34:37,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 20:34:37,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1235, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:34:37,520 INFO L87 Difference]: Start difference. First operand 315 states and 373 transitions. Second operand 37 states. Received shutdown request... [2018-02-02 20:34:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:34:38,016 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:34:38,020 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:34:38,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:34:38 BoogieIcfgContainer [2018-02-02 20:34:38,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:34:38,021 INFO L168 Benchmark]: Toolchain (without parser) took 70408.24 ms. Allocated memory was 385.4 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 342.0 MB in the beginning and 1.1 GB in the end (delta: -738.3 MB). Peak memory consumption was 489.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:34:38,022 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 385.4 MB. Free memory is still 348.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:34:38,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.86 ms. Allocated memory is still 385.4 MB. Free memory was 342.0 MB in the beginning and 328.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:34:38,022 INFO L168 Benchmark]: Boogie Preprocessor took 22.81 ms. Allocated memory is still 385.4 MB. Free memory was 328.7 MB in the beginning and 327.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:34:38,022 INFO L168 Benchmark]: RCFGBuilder took 239.73 ms. Allocated memory is still 385.4 MB. Free memory was 327.4 MB in the beginning and 302.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:34:38,022 INFO L168 Benchmark]: TraceAbstraction took 69971.08 ms. Allocated memory was 385.4 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 302.3 MB in the beginning and 1.1 GB in the end (delta: -778.0 MB). Peak memory consumption was 449.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:34:38,023 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.16 ms. Allocated memory is still 385.4 MB. Free memory is still 348.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.86 ms. Allocated memory is still 385.4 MB. Free memory was 342.0 MB in the beginning and 328.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.81 ms. Allocated memory is still 385.4 MB. Free memory was 328.7 MB in the beginning and 327.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 239.73 ms. Allocated memory is still 385.4 MB. Free memory was 327.4 MB in the beginning and 302.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69971.08 ms. Allocated memory was 385.4 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 302.3 MB in the beginning and 1.1 GB in the end (delta: -778.0 MB). Peak memory consumption was 449.9 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 free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 12 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 15 error locations. TIMEOUT Result, 69.9s OverallTime, 71 OverallIterations, 11 TraceHistogramMax, 44.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4640 SDtfs, 6327 SDslu, 31808 SDs, 0 SdLazy, 34232 SolverSat, 2240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2294 GetRequests, 171 SyntacticMatches, 205 SemanticMatches, 1917 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17249 ImplicationChecksByTransitivity, 43.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 7587/12508 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 70 MinimizatonAttempts, 794 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 5693 NumberOfCodeBlocks, 5693 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 5622 ConstructedInterpolants, 0 QuantifiedInterpolants, 5772381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 11 PerfectInterpolantSequences, 7587/12508 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/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-34-38-028.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-34-38-028.csv Completed graceful shutdown