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_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:38:42,131 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:38:42,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:38:42,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:38:42,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:38:42,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:38:42,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:38:42,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:38:42,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:38:42,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:38:42,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:38:42,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:38:42,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:38:42,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:38:42,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:38:42,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:38:42,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:38:42,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:38:42,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:38:42,159 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:38:42,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:38:42,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:38:42,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:38:42,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:38:42,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:38:42,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:38:42,164 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:38:42,164 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:38:42,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:38:42,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:38:42,165 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:38:42,165 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:38:42,174 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:38:42,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:38:42,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:38:42,175 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:38:42,175 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:38:42,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:38:42,175 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:38:42,176 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:38:42,176 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:38:42,176 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:38:42,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:38:42,176 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:38:42,176 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:38:42,176 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:38:42,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:38:42,176 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:38:42,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:38:42,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:38:42,177 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:38:42,177 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:38:42,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:38:42,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:38:42,177 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:38:42,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:38:42,209 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:38:42,211 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:38:42,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:38:42,212 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:38:42,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-02 20:38:42,338 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:38:42,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:38:42,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:38:42,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:38:42,346 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:38:42,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:38:42" (1/1) ... [2018-02-02 20:38:42,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4918ec45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42, skipping insertion in model container [2018-02-02 20:38:42,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:38:42" (1/1) ... [2018-02-02 20:38:42,361 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:38:42,397 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:38:42,489 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:38:42,506 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:38:42,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42 WrapperNode [2018-02-02 20:38:42,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:38:42,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:38:42,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:38:42,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:38:42,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42" (1/1) ... [2018-02-02 20:38:42,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42" (1/1) ... [2018-02-02 20:38:42,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42" (1/1) ... [2018-02-02 20:38:42,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42" (1/1) ... [2018-02-02 20:38:42,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42" (1/1) ... [2018-02-02 20:38:42,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42" (1/1) ... [2018-02-02 20:38:42,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42" (1/1) ... [2018-02-02 20:38:42,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:38:42,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:38:42,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:38:42,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:38:42,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42" (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:38:42,595 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:38:42,596 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:38:42,596 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-02-02 20:38:42,596 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 20:38:42,596 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 20:38:42,596 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 20:38:42,596 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 20:38:42,596 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:38:42,596 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 20:38:42,597 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-02 20:38:42,598 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 20:38:42,598 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 20:38:42,598 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 20:38:42,598 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:38:42,598 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:38:42,598 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:38:42,828 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:38:42,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:38:42 BoogieIcfgContainer [2018-02-02 20:38:42,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:38:42,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:38:42,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:38:42,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:38:42,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:38:42" (1/3) ... [2018-02-02 20:38:42,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f8e14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:38:42, skipping insertion in model container [2018-02-02 20:38:42,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:42" (2/3) ... [2018-02-02 20:38:42,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f8e14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:38:42, skipping insertion in model container [2018-02-02 20:38:42,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:38:42" (3/3) ... [2018-02-02 20:38:42,835 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-02 20:38:42,840 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:38:42,845 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 20:38:42,867 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:38:42,868 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:38:42,868 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:38:42,868 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:38:42,868 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:38:42,868 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:38:42,868 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:38:42,868 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:38:42,868 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:38:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-02-02 20:38:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:38:42,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:42,885 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:42,885 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:42,888 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-02-02 20:38:42,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:42,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:43,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:38:43,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,033 INFO L182 omatonBuilderFactory]: Interpolants [85#true, 86#false, 87#(= |#valid| |old(#valid)|)] [2018-02-02 20:38:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:38:43,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:38:43,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:38:43,108 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-02-02 20:38:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:43,240 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-02-02 20:38:43,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:38:43,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-02 20:38:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:43,252 INFO L225 Difference]: With dead ends: 133 [2018-02-02 20:38:43,252 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 20:38:43,253 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:38:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 20:38:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-02-02 20:38:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 20:38:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-02-02 20:38:43,291 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-02-02 20:38:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:43,292 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-02-02 20:38:43,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:38:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-02-02 20:38:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:38:43,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:43,294 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:43,294 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-02-02 20:38:43,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:43,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:43,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:38:43,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,358 INFO L182 omatonBuilderFactory]: Interpolants [304#true, 305#false, 306#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 307#(and (= 0 |entry_point_#t~ret12.base|) (= 0 |entry_point_#t~ret12.offset|)), 308#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 20:38:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:38:43,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:38:43,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:43,359 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-02-02 20:38:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:43,381 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-02 20:38:43,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:43,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 20:38:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:43,383 INFO L225 Difference]: With dead ends: 85 [2018-02-02 20:38:43,383 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 20:38:43,384 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:38:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 20:38:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 20:38:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 20:38:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-02 20:38:43,391 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-02-02 20:38:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:43,391 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-02 20:38:43,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:38:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-02 20:38:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:38:43,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:43,392 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:43,392 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:43,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-02-02 20:38:43,394 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:43,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:43,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:38:43,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,448 INFO L182 omatonBuilderFactory]: Interpolants [480#(not (= entry_point_~array~0.base 0)), 475#true, 476#false, 477#(not (= |ldv_malloc_#t~malloc2.base| 0)), 478#(not (= |ldv_malloc_#res.base| 0)), 479#(not (= |entry_point_#t~ret12.base| 0))] [2018-02-02 20:38:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:43,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:43,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:43,449 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-02 20:38:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:43,491 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-02 20:38:43,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:38:43,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 20:38:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:43,493 INFO L225 Difference]: With dead ends: 81 [2018-02-02 20:38:43,493 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 20:38:43,493 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:38:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 20:38:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 20:38:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 20:38:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 20:38:43,498 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-02-02 20:38:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:43,499 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 20:38:43,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 20:38:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:38:43,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:43,500 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:43,500 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:43,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-02-02 20:38:43,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:43,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:43,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:38:43,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,549 INFO L182 omatonBuilderFactory]: Interpolants [645#true, 646#false, 647#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 648#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 649#(= 1 (select |#valid| |entry_point_#t~ret12.base|)), 650#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 20:38:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:43,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:43,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:43,550 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-02-02 20:38:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:43,615 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 20:38:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:38:43,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 20:38:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:43,616 INFO L225 Difference]: With dead ends: 80 [2018-02-02 20:38:43,616 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 20:38:43,617 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:38:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 20:38:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 20:38:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 20:38:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-02 20:38:43,619 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-02-02 20:38:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:43,619 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-02 20:38:43,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-02 20:38:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:38:43,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:43,620 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:43,620 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:43,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-02-02 20:38:43,621 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:43,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:43,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:38:43,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,836 INFO L182 omatonBuilderFactory]: Interpolants [816#(<= 1 |entry_point_#t~ret11|), 817#(and (<= entry_point_~len~0 16777215) (<= 1 entry_point_~len~0)), 818#(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))), 819#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 820#(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|))), 821#(and (<= 4 (select |#length| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|)), 822#(and (= entry_point_~array~0.offset 0) (<= 4 (select |#length| entry_point_~array~0.base))), 823#(and (= entry_point_~array~0.offset 0) (<= 4 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 813#true, 814#false, 815#(<= 1 |ldv_positive_#res|)] [2018-02-02 20:38:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:43,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:38:43,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:38:43,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:38:43,837 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-02-02 20:38:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:44,074 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-02 20:38:44,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:38:44,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-02 20:38:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:44,076 INFO L225 Difference]: With dead ends: 84 [2018-02-02 20:38:44,076 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 20:38:44,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:38:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 20:38:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-02 20:38:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 20:38:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-02 20:38:44,083 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-02-02 20:38:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:44,083 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-02 20:38:44,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:38:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-02 20:38:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:38:44,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:44,084 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:44,084 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-02-02 20:38:44,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:44,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:44,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:44,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:38:44,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:44,350 INFO L182 omatonBuilderFactory]: Interpolants [1008#(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))), 1009#(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)), 1010#(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))), 1011#(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))), 1001#true, 1002#false, 1003#(<= entry_point_~len~0 16777215), 1004#(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))), 1005#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 4294967296) |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (= 0 |ldv_malloc_#t~malloc2.offset|))), 1006#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 4294967296) |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 1007#(or (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|)))] [2018-02-02 20:38:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:44,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:38:44,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:38:44,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:38:44,351 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 11 states. [2018-02-02 20:38:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:44,565 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-02 20:38:44,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:38:44,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-02 20:38:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:44,566 INFO L225 Difference]: With dead ends: 83 [2018-02-02 20:38:44,566 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 20:38:44,567 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:38:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 20:38:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 20:38:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 20:38:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 20:38:44,571 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29 [2018-02-02 20:38:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:44,571 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 20:38:44,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:38:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 20:38:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:38:44,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:44,573 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:44,573 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times [2018-02-02 20:38:44,574 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:44,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:44,623 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:38:44,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:44,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:38:44,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:44,624 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:38:44,624 INFO L182 omatonBuilderFactory]: Interpolants [1190#true, 1191#false, 1192#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1193#(and (= 0 |alloc_17_#t~ret4.offset|) (= 0 |alloc_17_#t~ret4.base|)), 1194#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 20:38:44,624 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:38:44,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:38:44,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:38:44,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:44,624 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-02-02 20:38:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:44,634 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-02 20:38:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:44,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-02 20:38:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:44,635 INFO L225 Difference]: With dead ends: 85 [2018-02-02 20:38:44,635 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 20:38:44,635 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:38:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 20:38:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-02-02 20:38:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 20:38:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-02 20:38:44,640 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-02 20:38:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:44,641 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-02 20:38:44,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:38:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-02 20:38:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:38:44,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:44,642 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:44,642 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times [2018-02-02 20:38:44,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:44,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:44,682 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:38:44,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:44,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:38:44,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:44,683 INFO L182 omatonBuilderFactory]: Interpolants [1363#true, 1364#false, 1365#(= 1 (select |#valid| entry_point_~array~0.base)), 1366#(= |#valid| |old(#valid)|), 1367#(= 1 (select |#valid| |free_17_#in~array.base|)), 1368#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:38:44,683 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:38:44,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:44,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:44,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:44,684 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-02-02 20:38:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:44,781 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-02-02 20:38:44,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:38:44,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 20:38:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:44,783 INFO L225 Difference]: With dead ends: 126 [2018-02-02 20:38:44,783 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 20:38:44,783 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:38:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 20:38:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-02-02 20:38:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 20:38:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-02 20:38:44,787 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41 [2018-02-02 20:38:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:44,787 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-02 20:38:44,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-02 20:38:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:38:44,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:44,788 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:44,788 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:44,788 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times [2018-02-02 20:38:44,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:44,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:44,850 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:38:44,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:44,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:38:44,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:44,851 INFO L182 omatonBuilderFactory]: Interpolants [1609#true, 1610#false, 1611#(<= 1 |ldv_positive_#res|), 1612#(<= 1 |entry_point_#t~ret11|), 1613#(<= 1 entry_point_~len~0), 1614#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 1615#(<= |alloc_17_#in~len| 0)] [2018-02-02 20:38:44,851 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:38:44,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:38:44,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:38:44,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:44,852 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 7 states. [2018-02-02 20:38:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:44,900 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-02-02 20:38:44,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:44,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-02 20:38:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:44,901 INFO L225 Difference]: With dead ends: 133 [2018-02-02 20:38:44,901 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:38:44,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:38:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:38:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2018-02-02 20:38:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 20:38:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-02-02 20:38:44,905 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 41 [2018-02-02 20:38:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:44,905 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-02-02 20:38:44,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:38:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-02-02 20:38:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:38:44,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:44,906 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:44,906 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times [2018-02-02 20:38:44,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:44,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:45,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:45,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:38:45,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:45,054 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:38:45,054 INFO L182 omatonBuilderFactory]: Interpolants [1858#true, 1859#false, 1860#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 1861#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1862#(= 1 (select |#valid| |entry_point_#t~ret12.base|)), 1863#(= 1 (select |#valid| entry_point_~array~0.base)), 1864#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 1865#(= 1 (select |#valid| alloc_17_~array.base)), 1866#(= |#valid| |old(#valid)|), 1867#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 1868#(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|)))))] [2018-02-02 20:38:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:45,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:38:45,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:38:45,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:38:45,055 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand 11 states. [2018-02-02 20:38:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:45,320 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-02-02 20:38:45,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:38:45,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-02 20:38:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:45,322 INFO L225 Difference]: With dead ends: 153 [2018-02-02 20:38:45,322 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 20:38:45,322 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:38:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 20:38:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 112. [2018-02-02 20:38:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 20:38:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2018-02-02 20:38:45,328 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 42 [2018-02-02 20:38:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:45,328 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2018-02-02 20:38:45,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:38:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2018-02-02 20:38:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:38:45,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:45,329 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:45,330 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386837, now seen corresponding path program 1 times [2018-02-02 20:38:45,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:45,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:45,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:45,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:38:45,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:45,489 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:38:45,489 INFO L182 omatonBuilderFactory]: Interpolants [2148#true, 2149#false, 2150#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 2151#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 2152#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 2153#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 2154#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1) (<= 4 (select |#length| entry_point_~array~0.base))), 2155#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (<= 4 (select |#length| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 2156#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 4 (select |#length| alloc_17_~array.base))), 2157#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 2158#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 2159#(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|))))), 2160#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 4 (select |#length| alloc_17_~array.base)))] [2018-02-02 20:38:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:45,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:45,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:45,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:45,490 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 13 states. [2018-02-02 20:38:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:45,926 INFO L93 Difference]: Finished difference Result 186 states and 211 transitions. [2018-02-02 20:38:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:38:45,926 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-02-02 20:38:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:45,927 INFO L225 Difference]: With dead ends: 186 [2018-02-02 20:38:45,927 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 20:38:45,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:38:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 20:38:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 116. [2018-02-02 20:38:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 20:38:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-02-02 20:38:45,931 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 42 [2018-02-02 20:38:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:45,931 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-02-02 20:38:45,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-02-02 20:38:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:38:45,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:45,931 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:45,932 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1548167688, now seen corresponding path program 1 times [2018-02-02 20:38:45,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:45,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:45,960 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:38:45,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:45,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:38:45,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:45,960 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:38:45,961 INFO L182 omatonBuilderFactory]: Interpolants [2481#true, 2482#false, 2483#(= alloc_17_~i~0 0), 2484#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-02 20:38:45,961 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:38:45,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:38:45,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:38:45,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:38:45,961 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 4 states. [2018-02-02 20:38:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:45,991 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-02 20:38:45,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:45,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-02 20:38:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:45,992 INFO L225 Difference]: With dead ends: 125 [2018-02-02 20:38:45,992 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 20:38:45,992 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:38:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 20:38:45,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2018-02-02 20:38:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:38:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2018-02-02 20:38:45,996 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 43 [2018-02-02 20:38:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:45,996 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-02-02 20:38:45,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:38:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2018-02-02 20:38:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:38:45,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:45,997 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:45,997 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1943737008, now seen corresponding path program 1 times [2018-02-02 20:38:45,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:46,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:46,086 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:38:46,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:46,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:38:46,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:46,087 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:38:46,087 INFO L182 omatonBuilderFactory]: Interpolants [2736#(= 0 entry_point_~array~0.offset), 2737#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 2738#(= |old(#length)| |#length|), 2739#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 2740#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 2731#true, 2732#false, 2733#(= 0 |ldv_malloc_#t~malloc2.offset|), 2734#(= 0 |ldv_malloc_#res.offset|), 2735#(= 0 |entry_point_#t~ret12.offset|)] [2018-02-02 20:38:46,087 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:38:46,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:38:46,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:38:46,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:38:46,088 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 10 states. [2018-02-02 20:38:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:46,280 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2018-02-02 20:38:46,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:38:46,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-02-02 20:38:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:46,281 INFO L225 Difference]: With dead ends: 140 [2018-02-02 20:38:46,281 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 20:38:46,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:38:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 20:38:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2018-02-02 20:38:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 20:38:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2018-02-02 20:38:46,285 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 51 [2018-02-02 20:38:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:46,285 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2018-02-02 20:38:46,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:38:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-02-02 20:38:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:38:46,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:46,287 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:46,287 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 126305131, now seen corresponding path program 1 times [2018-02-02 20:38:46,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:46,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:46,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:46,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:38:46,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:46,461 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:38:46,461 INFO L182 omatonBuilderFactory]: Interpolants [3014#true, 3015#false, 3016#(= 0 |ldv_malloc_#t~malloc2.offset|), 3017#(= 0 |ldv_malloc_#res.offset|), 3018#(= 0 |entry_point_#t~ret12.offset|), 3019#(= entry_point_~array~0.offset 0), 3020#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 3021#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~i~2 0)), 3022#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 3023#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 3024#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 3025#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 3026#(= 0 |free_17_#t~mem10.offset|)] [2018-02-02 20:38:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:46,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:46,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:46,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:46,462 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 13 states. [2018-02-02 20:38:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:46,754 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-02-02 20:38:46,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:38:46,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-02 20:38:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:46,755 INFO L225 Difference]: With dead ends: 164 [2018-02-02 20:38:46,755 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 20:38:46,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:38:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 20:38:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-02-02 20:38:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 20:38:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2018-02-02 20:38:46,762 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 52 [2018-02-02 20:38:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:46,762 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2018-02-02 20:38:46,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2018-02-02 20:38:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:38:46,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:46,763 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:46,763 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash 126305132, now seen corresponding path program 1 times [2018-02-02 20:38:46,765 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:46,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:46,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:46,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:38:46,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:46,929 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:38:46,929 INFO L182 omatonBuilderFactory]: Interpolants [3360#true, 3361#false, 3362#(= 0 |ldv_malloc_#t~malloc2.offset|), 3363#(= 0 |ldv_malloc_#res.offset|), 3364#(= 0 |entry_point_#t~ret12.offset|), 3365#(= entry_point_~array~0.offset 0), 3366#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 3367#(and (= 0 (select (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) (= entry_point_~i~2 0)), 3368#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 3369#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 3370#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 3371#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 3372#(= 0 |free_17_#t~mem10.base|)] [2018-02-02 20:38:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:46,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:46,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:46,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:46,929 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand 13 states. [2018-02-02 20:38:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:47,141 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2018-02-02 20:38:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:38:47,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-02 20:38:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:47,141 INFO L225 Difference]: With dead ends: 163 [2018-02-02 20:38:47,141 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 20:38:47,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:38:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 20:38:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2018-02-02 20:38:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 20:38:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2018-02-02 20:38:47,144 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 52 [2018-02-02 20:38:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:47,145 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2018-02-02 20:38:47,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2018-02-02 20:38:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:38:47,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:47,145 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:47,145 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2101833613, now seen corresponding path program 1 times [2018-02-02 20:38:47,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:47,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:38:47,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:47,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:38:47,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:47,183 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:38:47,184 INFO L182 omatonBuilderFactory]: Interpolants [3701#true, 3702#false, 3703#(not (= |ldv_malloc_#t~malloc2.base| 0)), 3704#(not (= |ldv_malloc_#res.base| 0)), 3705#(not (= |alloc_17_#t~ret4.base| 0)), 3706#(not (= alloc_17_~p~0.base 0))] [2018-02-02 20:38:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:38:47,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:47,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:47,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:47,184 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 6 states. [2018-02-02 20:38:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:47,203 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-02 20:38:47,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:47,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-02-02 20:38:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:47,204 INFO L225 Difference]: With dead ends: 125 [2018-02-02 20:38:47,204 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 20:38:47,204 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:38:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 20:38:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-02 20:38:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:38:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2018-02-02 20:38:47,207 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 53 [2018-02-02 20:38:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:47,207 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2018-02-02 20:38:47,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2018-02-02 20:38:47,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:38:47,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:47,208 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:47,208 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:47,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243012, now seen corresponding path program 1 times [2018-02-02 20:38:47,209 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:47,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:38:47,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:47,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:38:47,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:47,261 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:38:47,261 INFO L182 omatonBuilderFactory]: Interpolants [3959#true, 3960#false, 3961#(= alloc_17_~array.base |alloc_17_#in~array.base|), 3962#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 3963#(= 1 (select |#valid| entry_point_~array~0.base)), 3964#(= 1 (select |#valid| |free_17_#in~array.base|)), 3965#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:38:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:38:47,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:38:47,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:38:47,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:47,262 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand 7 states. [2018-02-02 20:38:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:47,364 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2018-02-02 20:38:47,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:38:47,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-02-02 20:38:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:47,365 INFO L225 Difference]: With dead ends: 142 [2018-02-02 20:38:47,365 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 20:38:47,365 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:38:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 20:38:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-02-02 20:38:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:38:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-02-02 20:38:47,369 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 54 [2018-02-02 20:38:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:47,369 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-02-02 20:38:47,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:38:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-02-02 20:38:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:38:47,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:47,370 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:47,370 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243011, now seen corresponding path program 1 times [2018-02-02 20:38:47,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:47,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:38:47,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:47,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:38:47,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:47,512 INFO L182 omatonBuilderFactory]: Interpolants [4241#true, 4242#false, 4243#(= 0 |ldv_malloc_#t~malloc2.offset|), 4244#(= 0 |ldv_malloc_#res.offset|), 4245#(= 0 |entry_point_#t~ret12.offset|), 4246#(= 0 entry_point_~array~0.offset), 4247#(and (or (= alloc_17_~len |alloc_17_#in~len|) (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|)), 4248#(or (and (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| |alloc_17_#in~array.base|)) (= alloc_17_~len |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.offset| 0))), 4249#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= (* 4 alloc_17_~i~0) (select |#length| |alloc_17_#in~array.base|)))), 4250#(or (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 4251#(and (= 0 entry_point_~array~0.offset) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base))), 4252#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 4253#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 4254#(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:38:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:38:47,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:38:47,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:38:47,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:38:47,512 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 14 states. [2018-02-02 20:38:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:47,743 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2018-02-02 20:38:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:38:47,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-02-02 20:38:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:47,744 INFO L225 Difference]: With dead ends: 161 [2018-02-02 20:38:47,744 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 20:38:47,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:38:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 20:38:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-02-02 20:38:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 20:38:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-02-02 20:38:47,747 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 54 [2018-02-02 20:38:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:47,747 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-02-02 20:38:47,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:38:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-02-02 20:38:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:38:47,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:47,748 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:47,748 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:47,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762242, now seen corresponding path program 1 times [2018-02-02 20:38:47,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:47,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:48,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:48,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:38:48,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:48,154 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:38:48,154 INFO L182 omatonBuilderFactory]: Interpolants [4576#false, 4577#(= 0 |ldv_malloc_#t~malloc2.offset|), 4578#(= 0 |ldv_malloc_#res.offset|), 4579#(= 0 |entry_point_#t~ret12.offset|), 4580#(= 0 entry_point_~array~0.offset), 4581#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 4582#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 4583#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 4584#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 4585#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 4586#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 4587#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 4588#(or (and (<= 2 alloc_17_~len) (= alloc_17_~len |alloc_17_#in~len|)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 4589#(or (<= 2 |alloc_17_#in~len|) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 4590#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 4591#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 1) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 4592#(and (or (and (or (<= free_17_~len 1) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (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))))), 4593#(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)))) (or (and (<= free_17_~i~1 0) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))), 4594#(= 0 |free_17_#t~mem10.offset|), 4575#true] [2018-02-02 20:38:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:48,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:38:48,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:38:48,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:38:48,154 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 20 states. [2018-02-02 20:38:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:48,443 INFO L93 Difference]: Finished difference Result 259 states and 317 transitions. [2018-02-02 20:38:48,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:38:48,448 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-02 20:38:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:48,449 INFO L225 Difference]: With dead ends: 259 [2018-02-02 20:38:48,449 INFO L226 Difference]: Without dead ends: 259 [2018-02-02 20:38:48,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:38:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-02 20:38:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 219. [2018-02-02 20:38:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:38:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 281 transitions. [2018-02-02 20:38:48,454 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 281 transitions. Word has length 55 [2018-02-02 20:38:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:48,455 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 281 transitions. [2018-02-02 20:38:48,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:38:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 281 transitions. [2018-02-02 20:38:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:38:48,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:48,456 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:48,456 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762241, now seen corresponding path program 1 times [2018-02-02 20:38:48,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:48,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:48,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:48,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:38:48,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:48,970 INFO L182 omatonBuilderFactory]: Interpolants [5088#false, 5089#(= 0 |ldv_malloc_#t~malloc2.offset|), 5090#(= 0 |ldv_malloc_#res.offset|), 5091#(= 0 |entry_point_#t~ret12.offset|), 5092#(= 0 entry_point_~array~0.offset), 5093#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 5094#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 5095#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 5096#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 5097#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 5098#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 5099#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 5100#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))))), 5101#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 5102#(or (and (<= 2 alloc_17_~len) (= alloc_17_~len |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 5103#(or (<= 2 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 5104#(and (= 0 entry_point_~array~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= entry_point_~len~0 1)), 5105#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 1)), 5106#(and (or (and (or (<= free_17_~len 1) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (or (= 1 (select |#valid| (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))))), 5107#(and (or (= 1 (select |#valid| (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)))) (or (and (<= free_17_~i~1 0) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))), 5108#(= 1 (select |#valid| |free_17_#t~mem10.base|)), 5087#true] [2018-02-02 20:38:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:48,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:38:48,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:38:48,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:38:48,971 INFO L87 Difference]: Start difference. First operand 219 states and 281 transitions. Second operand 22 states. [2018-02-02 20:38:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:49,306 INFO L93 Difference]: Finished difference Result 235 states and 304 transitions. [2018-02-02 20:38:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:38:49,306 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-02-02 20:38:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:49,307 INFO L225 Difference]: With dead ends: 235 [2018-02-02 20:38:49,307 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 20:38:49,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:38:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 20:38:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 202. [2018-02-02 20:38:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 20:38:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 257 transitions. [2018-02-02 20:38:49,315 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 257 transitions. Word has length 55 [2018-02-02 20:38:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:49,315 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 257 transitions. [2018-02-02 20:38:49,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:38:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2018-02-02 20:38:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:38:49,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:49,316 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:49,316 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:49,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2041198635, now seen corresponding path program 2 times [2018-02-02 20:38:49,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:49,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:49,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:49,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:38:49,424 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:49,424 INFO L182 omatonBuilderFactory]: Interpolants [5568#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 5569#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 5570#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 5571#(<= |alloc_17_#in~len| 1), 5560#true, 5561#false, 5562#(= 0 |ldv_malloc_#t~malloc2.offset|), 5563#(= 0 |ldv_malloc_#res.offset|), 5564#(= 0 |entry_point_#t~ret12.offset|), 5565#(= entry_point_~array~0.offset 0), 5566#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 5567#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))] [2018-02-02 20:38:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:49,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:38:49,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:38:49,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:38:49,425 INFO L87 Difference]: Start difference. First operand 202 states and 257 transitions. Second operand 12 states. [2018-02-02 20:38:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:49,568 INFO L93 Difference]: Finished difference Result 225 states and 282 transitions. [2018-02-02 20:38:49,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:38:49,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-02-02 20:38:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:49,570 INFO L225 Difference]: With dead ends: 225 [2018-02-02 20:38:49,570 INFO L226 Difference]: Without dead ends: 225 [2018-02-02 20:38:49,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:38:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-02 20:38:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 202. [2018-02-02 20:38:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 20:38:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 256 transitions. [2018-02-02 20:38:49,576 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 256 transitions. Word has length 59 [2018-02-02 20:38:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:49,576 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 256 transitions. [2018-02-02 20:38:49,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:38:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 256 transitions. [2018-02-02 20:38:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:38:49,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:49,577 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:49,577 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2012095048, now seen corresponding path program 1 times [2018-02-02 20:38:49,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:49,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:49,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:49,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:38:49,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:49,699 INFO L182 omatonBuilderFactory]: Interpolants [6016#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4))), 6017#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))), 6005#true, 6006#false, 6007#(= 0 |ldv_malloc_#t~malloc2.offset|), 6008#(= 0 |ldv_malloc_#res.offset|), 6009#(= 0 |entry_point_#t~ret12.offset|), 6010#(= 0 entry_point_~array~0.offset), 6011#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 6012#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 6013#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 6014#(and (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 1)), 6015#(and (= alloc_17_~array.offset 0) (<= alloc_17_~len 1))] [2018-02-02 20:38:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:49,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:49,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:49,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:49,699 INFO L87 Difference]: Start difference. First operand 202 states and 256 transitions. Second operand 13 states. [2018-02-02 20:38:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:49,812 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2018-02-02 20:38:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:38:49,813 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-02-02 20:38:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:49,814 INFO L225 Difference]: With dead ends: 207 [2018-02-02 20:38:49,814 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 20:38:49,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:38:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 20:38:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 174. [2018-02-02 20:38:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:38:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2018-02-02 20:38:49,819 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 55 [2018-02-02 20:38:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:49,819 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2018-02-02 20:38:49,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2018-02-02 20:38:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:38:49,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:49,820 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:49,820 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:49,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1345976352, now seen corresponding path program 1 times [2018-02-02 20:38:49,821 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:49,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:49,873 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:38:49,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:49,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:38:49,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:49,874 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:38:49,874 INFO L182 omatonBuilderFactory]: Interpolants [6407#true, 6408#false, 6409#(<= 1 |ldv_positive_#res|), 6410#(<= 1 |entry_point_#t~ret11|), 6411#(<= 1 entry_point_~len~0), 6412#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 6413#(<= |free_17_#in~len| 0)] [2018-02-02 20:38:49,874 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:38:49,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:38:49,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:38:49,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:49,875 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand 7 states. [2018-02-02 20:38:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:49,907 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2018-02-02 20:38:49,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:49,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-02-02 20:38:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:49,908 INFO L225 Difference]: With dead ends: 186 [2018-02-02 20:38:49,908 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 20:38:49,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:38:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 20:38:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2018-02-02 20:38:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 20:38:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 189 transitions. [2018-02-02 20:38:49,912 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 189 transitions. Word has length 56 [2018-02-02 20:38:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:49,913 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 189 transitions. [2018-02-02 20:38:49,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:38:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 189 transitions. [2018-02-02 20:38:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:38:49,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:49,914 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:49,914 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1550179515, now seen corresponding path program 1 times [2018-02-02 20:38:49,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:49,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:50,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:50,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:38:50,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:50,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:38:50,021 INFO L182 omatonBuilderFactory]: Interpolants [6767#true, 6768#false, 6769#(= 0 |ldv_malloc_#t~malloc2.offset|), 6770#(= 0 |ldv_malloc_#res.offset|), 6771#(= 0 |entry_point_#t~ret12.offset|), 6772#(= 0 entry_point_~array~0.offset), 6773#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 6774#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 6775#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 6776#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 1)), 6777#(and (<= free_17_~len 1) (= free_17_~array.offset 0)), 6778#(<= free_17_~len (+ free_17_~i~1 1)), 6779#(<= free_17_~len free_17_~i~1)] [2018-02-02 20:38:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:50,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:50,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:50,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:50,022 INFO L87 Difference]: Start difference. First operand 165 states and 189 transitions. Second operand 13 states. [2018-02-02 20:38:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:50,109 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2018-02-02 20:38:50,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:38:50,111 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-02-02 20:38:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:50,111 INFO L225 Difference]: With dead ends: 184 [2018-02-02 20:38:50,112 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 20:38:50,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:38:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 20:38:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2018-02-02 20:38:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:38:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 202 transitions. [2018-02-02 20:38:50,114 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 202 transitions. Word has length 57 [2018-02-02 20:38:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:50,115 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 202 transitions. [2018-02-02 20:38:50,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 202 transitions. [2018-02-02 20:38:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:38:50,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:50,115 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:50,115 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash 631093502, now seen corresponding path program 1 times [2018-02-02 20:38:50,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:50,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:50,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:50,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:38:50,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:50,557 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:38:50,557 INFO L182 omatonBuilderFactory]: Interpolants [7151#true, 7152#false, 7153#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 7154#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 7155#(or (and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))) (<= 2 entry_point_~len~0)), 7156#(or (<= 2 entry_point_~len~0) (and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0))), 7157#(or (and (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (<= entry_point_~len~0 1)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (not (= entry_point_~array~0.base 0))) (= entry_point_~array~0.offset 0)) (and (<= 2 entry_point_~len~0) (= entry_point_~i~2 0))), 7158#(or (and (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (not (= entry_point_~array~0.base 0))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 0)) (and (<= 2 entry_point_~len~0) (= entry_point_~i~2 0))), 7159#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))) (and (<= 2 entry_point_~len~0) (= entry_point_~i~2 0))), 7160#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 7161#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 7162#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7163#(= |#valid| |old(#valid)|), 7164#(and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (or (and (not (= free_17_~array.offset 0)) (= |free_17_#in~array.offset| free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0))), 7165#(or (and (= |#valid| |old(#valid)|) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|))) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 7166#(or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0))), 7167#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 20:38:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:50,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:38:50,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:38:50,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:38:50,557 INFO L87 Difference]: Start difference. First operand 178 states and 202 transitions. Second operand 17 states. [2018-02-02 20:38:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:51,022 INFO L93 Difference]: Finished difference Result 218 states and 257 transitions. [2018-02-02 20:38:51,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:38:51,022 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-02-02 20:38:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:51,023 INFO L225 Difference]: With dead ends: 218 [2018-02-02 20:38:51,023 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 20:38:51,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:38:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 20:38:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 183. [2018-02-02 20:38:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 20:38:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2018-02-02 20:38:51,026 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 59 [2018-02-02 20:38:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:51,026 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-02-02 20:38:51,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:38:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-02-02 20:38:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:38:51,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:51,027 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:51,027 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1742435855, now seen corresponding path program 2 times [2018-02-02 20:38:51,028 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:51,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:38:51,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:51,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:38:51,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:51,364 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:38:51,364 INFO L182 omatonBuilderFactory]: Interpolants [7587#true, 7588#false, 7589#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 7590#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7591#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 7592#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7593#(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)), 7594#(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)), 7595#(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)), 7596#(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|)), 7597#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7598#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7599#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 7600#(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|))))), 7601#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7602#(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)), 7603#(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)), 7604#(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)), 7605#(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))] [2018-02-02 20:38:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:38:51,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:38:51,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:38:51,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:38:51,365 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 19 states. [2018-02-02 20:38:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,017 INFO L93 Difference]: Finished difference Result 219 states and 249 transitions. [2018-02-02 20:38:52,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:38:52,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-02-02 20:38:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,018 INFO L225 Difference]: With dead ends: 219 [2018-02-02 20:38:52,018 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 20:38:52,018 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 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:38:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 20:38:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 182. [2018-02-02 20:38:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 20:38:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2018-02-02 20:38:52,022 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 59 [2018-02-02 20:38:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,023 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2018-02-02 20:38:52,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:38:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2018-02-02 20:38:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:38:52,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,024 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,024 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,024 INFO L82 PathProgramCache]: Analyzing trace with hash -805582722, now seen corresponding path program 1 times [2018-02-02 20:38:52,025 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,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:38:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:38:52,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:52,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:38:52,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,167 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:38:52,167 INFO L182 omatonBuilderFactory]: Interpolants [8039#true, 8040#false, 8041#(= 0 |ldv_malloc_#t~malloc2.offset|), 8042#(= 0 |ldv_malloc_#res.offset|), 8043#(= 0 |entry_point_#t~ret12.offset|), 8044#(= 0 entry_point_~array~0.offset), 8045#(= 0 |alloc_17_#in~array.offset|), 8046#(= alloc_17_~array.offset 0), 8047#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))), 8048#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8049#(= |old(#length)| |#length|), 8050#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8051#(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))] [2018-02-02 20:38:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:38:52,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:52,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:52,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:52,168 INFO L87 Difference]: Start difference. First operand 182 states and 207 transitions. Second operand 13 states. [2018-02-02 20:38:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,495 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-02-02 20:38:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:38:52,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-02-02 20:38:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,497 INFO L225 Difference]: With dead ends: 180 [2018-02-02 20:38:52,497 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 20:38:52,497 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:38:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 20:38:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-02-02 20:38:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 20:38:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 205 transitions. [2018-02-02 20:38:52,500 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 205 transitions. Word has length 60 [2018-02-02 20:38:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,500 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 205 transitions. [2018-02-02 20:38:52,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2018-02-02 20:38:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:38:52,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,501 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,501 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,501 INFO L82 PathProgramCache]: Analyzing trace with hash 796739391, now seen corresponding path program 1 times [2018-02-02 20:38:52,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:38:52,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:52,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:38:52,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,954 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:38:52,954 INFO L182 omatonBuilderFactory]: Interpolants [8448#(and (= alloc_17_~array.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 8449#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))), 8450#(= 0 |alloc_17_#t~mem7.offset|), 8431#true, 8432#false, 8433#(= 0 |ldv_malloc_#t~malloc2.offset|), 8434#(= 0 |ldv_malloc_#res.offset|), 8435#(= 0 |entry_point_#t~ret12.offset|), 8436#(= 0 entry_point_~array~0.offset), 8437#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 8438#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 8439#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 8440#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 8441#(and (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 2)), 8442#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (= alloc_17_~array.offset 0) (or (<= alloc_17_~len 2) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8443#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (or (and (= 0 |alloc_17_#t~ret4.offset|) (<= alloc_17_~len 2)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.offset 0)), 8444#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~len 2) (= 0 alloc_17_~p~0.offset)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8445#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0) (<= alloc_17_~len 2) (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8446#(and (= alloc_17_~array.offset 0) (or (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 3)) (and (<= alloc_17_~len 2) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))))), 8447#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)))] [2018-02-02 20:38:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:38:52,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:38:52,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:38:52,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:38:52,955 INFO L87 Difference]: Start difference. First operand 180 states and 205 transitions. Second operand 20 states. [2018-02-02 20:38:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:53,661 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-02-02 20:38:53,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:38:53,661 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-02-02 20:38:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:53,662 INFO L225 Difference]: With dead ends: 251 [2018-02-02 20:38:53,662 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 20:38:53,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:38:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 20:38:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2018-02-02 20:38:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 20:38:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 266 transitions. [2018-02-02 20:38:53,668 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 266 transitions. Word has length 61 [2018-02-02 20:38:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:53,669 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 266 transitions. [2018-02-02 20:38:53,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:38:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 266 transitions. [2018-02-02 20:38:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:38:53,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:53,670 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:53,670 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash 796739392, now seen corresponding path program 1 times [2018-02-02 20:38:53,671 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:53,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:54,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:54,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:38:54,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:54,102 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:38:54,102 INFO L182 omatonBuilderFactory]: Interpolants [8962#true, 8963#false, 8964#(= 0 |ldv_malloc_#t~malloc2.offset|), 8965#(= 0 |ldv_malloc_#res.offset|), 8966#(= 0 |entry_point_#t~ret12.offset|), 8967#(= 0 entry_point_~array~0.offset), 8968#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 8969#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 8970#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 8971#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 8972#(and (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 2)), 8973#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (= alloc_17_~array.offset 0) (or (<= alloc_17_~len 2) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8974#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 8975#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 8976#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (or (and (<= alloc_17_~len 2) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.offset 0)), 8977#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (<= alloc_17_~len 2)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.offset 0)), 8978#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (<= alloc_17_~len 2)), 8979#(and (or (and (<= alloc_17_~len 2) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 3))) (= alloc_17_~array.offset 0)), 8980#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 8981#(= |#valid| |old(#valid)|), 8982#(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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))) (<= alloc_17_~j~0 0)), 8983#(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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))), 8984#(= 1 (select |#valid| |alloc_17_#t~mem7.base|))] [2018-02-02 20:38:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:54,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:38:54,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:38:54,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:38:54,103 INFO L87 Difference]: Start difference. First operand 231 states and 266 transitions. Second operand 23 states. [2018-02-02 20:38:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:54,897 INFO L93 Difference]: Finished difference Result 260 states and 299 transitions. [2018-02-02 20:38:54,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:38:54,897 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-02-02 20:38:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:54,898 INFO L225 Difference]: With dead ends: 260 [2018-02-02 20:38:54,898 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 20:38:54,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1587, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:38:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 20:38:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 233. [2018-02-02 20:38:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 20:38:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2018-02-02 20:38:54,901 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 61 [2018-02-02 20:38:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:54,902 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2018-02-02 20:38:54,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:38:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2018-02-02 20:38:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:38:54,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:54,902 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:54,902 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1218510372, now seen corresponding path program 2 times [2018-02-02 20:38:54,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:54,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:55,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:55,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:38:55,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:55,254 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:38:55,254 INFO L182 omatonBuilderFactory]: Interpolants [9518#true, 9519#false, 9520#(= 0 |ldv_malloc_#t~malloc2.offset|), 9521#(= 0 |ldv_malloc_#res.offset|), 9522#(= 0 |entry_point_#t~ret12.offset|), 9523#(= 0 entry_point_~array~0.offset), 9524#(and (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 entry_point_~array~0.offset)), 9525#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (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) entry_point_~array~0.offset)) (= 0 entry_point_~array~0.offset)), 9526#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) 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))), 9527#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (< 1 entry_point_~i~2)), 9528#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 9529#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9530#(= |#valid| |old(#valid)|), 9531#(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|))), 9532#(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))), 9533#(and (= 1 (select |#valid| free_17_~array.base)) (= 0 |free_17_#t~mem10.base|)), 9534#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:38:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:55,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:38:55,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:38:55,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:38:55,255 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand 17 states. [2018-02-02 20:38:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:55,569 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2018-02-02 20:38:55,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:38:55,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-02-02 20:38:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:55,570 INFO L225 Difference]: With dead ends: 263 [2018-02-02 20:38:55,570 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 20:38:55,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:38:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 20:38:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 251. [2018-02-02 20:38:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 20:38:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2018-02-02 20:38:55,573 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 61 [2018-02-02 20:38:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:55,573 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2018-02-02 20:38:55,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:38:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2018-02-02 20:38:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:38:55,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:55,574 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:55,574 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:55,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1218510371, now seen corresponding path program 1 times [2018-02-02 20:38:55,575 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:55,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:55,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:55,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:38:55,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:55,744 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:38:55,744 INFO L182 omatonBuilderFactory]: Interpolants [10063#true, 10064#false, 10065#(= 0 |ldv_malloc_#t~malloc2.offset|), 10066#(= 0 |ldv_malloc_#res.offset|), 10067#(= 0 |entry_point_#t~ret12.offset|), 10068#(= entry_point_~array~0.offset 0), 10069#(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)), 10070#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10071#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10072#(= |old(#length)| |#length|), 10073#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 10074#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 10075#(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)), 10076#(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)), 10077#(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:38:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:55,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:38:55,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:38:55,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:38:55,745 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand 15 states. [2018-02-02 20:38:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:56,147 INFO L93 Difference]: Finished difference Result 258 states and 289 transitions. [2018-02-02 20:38:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:38:56,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-02-02 20:38:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:56,149 INFO L225 Difference]: With dead ends: 258 [2018-02-02 20:38:56,149 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 20:38:56,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 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:38:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 20:38:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2018-02-02 20:38:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 20:38:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 285 transitions. [2018-02-02 20:38:56,154 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 285 transitions. Word has length 61 [2018-02-02 20:38:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:56,154 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 285 transitions. [2018-02-02 20:38:56,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:38:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 285 transitions. [2018-02-02 20:38:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:38:56,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:56,156 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:56,156 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1523736181, now seen corresponding path program 1 times [2018-02-02 20:38:56,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:56,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:56,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:56,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:38:56,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:56,674 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:38:56,675 INFO L182 omatonBuilderFactory]: Interpolants [10624#(or (and (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (= (select |#valid| |free_17_#in~array.base|) 0)) (= |#valid| |old(#valid)|) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (<= 2 |free_17_#in~len|)), 10625#(= 1 (select |#valid| entry_point_~array~0.base)), 10601#true, 10602#false, 10603#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 10604#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 10605#(and (= 0 |entry_point_#t~ret12.offset|) (= 1 (select |#valid| |entry_point_#t~ret12.base|))), 10606#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset)), 10607#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 10608#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 10609#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 10610#(= |#valid| |old(#valid)|), 10611#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= |#valid| |old(#valid)|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10612#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= |#valid| |old(#valid)|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10613#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 10614#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10615#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10616#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10617#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (and (<= 2 alloc_17_~len) (= alloc_17_~len |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 10618#(and (or (<= 2 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (= 1 (select |#valid| |alloc_17_#in~array.base|))), 10619#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 10620#(and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))))), 10621#(and (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (<= (+ free_17_~i~1 1) free_17_~len)) (= free_17_~len |free_17_#in~len|))))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)), 10622#(and (or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (and (= |free_17_#t~mem10.base| |free_17_#in~array.base|) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|))) (= |#valid| |old(#valid)|)), 10623#(or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (and (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (= (select |#valid| |free_17_#in~array.base|) 0)) (= |#valid| |old(#valid)|) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)))] [2018-02-02 20:38:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:56,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:38:56,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:38:56,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:38:56,675 INFO L87 Difference]: Start difference. First operand 251 states and 285 transitions. Second operand 25 states. [2018-02-02 20:38:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:57,219 INFO L93 Difference]: Finished difference Result 306 states and 359 transitions. [2018-02-02 20:38:57,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:38:57,219 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-02 20:38:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:57,220 INFO L225 Difference]: With dead ends: 306 [2018-02-02 20:38:57,220 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 20:38:57,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:38:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 20:38:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 236. [2018-02-02 20:38:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-02 20:38:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 270 transitions. [2018-02-02 20:38:57,227 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 270 transitions. Word has length 62 [2018-02-02 20:38:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:57,228 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 270 transitions. [2018-02-02 20:38:57,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:38:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 270 transitions. [2018-02-02 20:38:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:38:57,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:57,229 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:57,229 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:57,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1834734922, now seen corresponding path program 1 times [2018-02-02 20:38:57,230 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:57,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:57,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:57,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:38:57,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:57,677 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:38:57,677 INFO L182 omatonBuilderFactory]: Interpolants [11182#true, 11183#false, 11184#(= |#valid| |old(#valid)|), 11185#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 11186#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 11187#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret12.base| (select |#valid| |entry_point_#t~ret12.base|))) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0)), 11188#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 11189#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 11190#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 11191#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 1) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 11192#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (<= entry_point_~len~0 1) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 11193#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 11194#(and (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))))), 11195#(and (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (<= (+ free_17_~i~1 1) free_17_~len)) (= free_17_~len |free_17_#in~len|)))))), 11196#(or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 11197#(or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 11198#(or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (<= 2 |free_17_#in~len|)), 11199#(and (not (= entry_point_~array~0.base 0)) (= (select |old(#valid)| entry_point_~array~0.base) (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (= (store |old(#valid)| entry_point_~array~0.base (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (store |#valid| entry_point_~array~0.base 0)))] [2018-02-02 20:38:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:57,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:38:57,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:38:57,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:38:57,678 INFO L87 Difference]: Start difference. First operand 236 states and 270 transitions. Second operand 18 states. [2018-02-02 20:38:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:58,185 INFO L93 Difference]: Finished difference Result 272 states and 317 transitions. [2018-02-02 20:38:58,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:38:58,186 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-02-02 20:38:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:58,187 INFO L225 Difference]: With dead ends: 272 [2018-02-02 20:38:58,187 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 20:38:58,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:38:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 20:38:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 230. [2018-02-02 20:38:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 20:38:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 263 transitions. [2018-02-02 20:38:58,193 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 263 transitions. Word has length 62 [2018-02-02 20:38:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:58,193 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 263 transitions. [2018-02-02 20:38:58,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:38:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 263 transitions. [2018-02-02 20:38:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:38:58,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:58,194 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:58,194 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash 880884190, now seen corresponding path program 1 times [2018-02-02 20:38:58,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:58,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:38:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:58,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:58,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:38:58,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:58,427 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:38:58,427 INFO L182 omatonBuilderFactory]: Interpolants [11712#true, 11713#false, 11714#(= 0 |ldv_malloc_#t~malloc2.offset|), 11715#(= 0 |ldv_malloc_#res.offset|), 11716#(= 0 |entry_point_#t~ret12.offset|), 11717#(= entry_point_~array~0.offset 0), 11718#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 11719#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 11720#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 11721#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 11722#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 11723#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 11724#(and (= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 11725#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 11726#(= 0 |free_17_#t~mem10.offset|)] [2018-02-02 20:38:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:58,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:38:58,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:38:58,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:38:58,428 INFO L87 Difference]: Start difference. First operand 230 states and 263 transitions. Second operand 15 states. [2018-02-02 20:38:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:58,763 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2018-02-02 20:38:58,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:38:58,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 20:38:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:58,764 INFO L225 Difference]: With dead ends: 244 [2018-02-02 20:38:58,764 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 20:38:58,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:38:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 20:38:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-02-02 20:38:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 20:38:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2018-02-02 20:38:58,767 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 62 [2018-02-02 20:38:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:58,768 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2018-02-02 20:38:58,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:38:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2018-02-02 20:38:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:38:58,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:58,768 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:58,768 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash 880884191, now seen corresponding path program 1 times [2018-02-02 20:38:58,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:58,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:58,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:58,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:38:58,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:58,955 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:38:58,955 INFO L182 omatonBuilderFactory]: Interpolants [12229#true, 12230#false, 12231#(= 0 |ldv_malloc_#t~malloc2.offset|), 12232#(= 0 |ldv_malloc_#res.offset|), 12233#(= 0 |entry_point_#t~ret12.offset|), 12234#(= entry_point_~array~0.offset 0), 12235#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 12236#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 12237#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 12238#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 12239#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12240#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 12241#(and (= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))), 12242#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 12243#(= 0 |free_17_#t~mem10.base|)] [2018-02-02 20:38:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:58,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:38:58,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:38:58,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:38:58,956 INFO L87 Difference]: Start difference. First operand 231 states and 265 transitions. Second operand 15 states. [2018-02-02 20:38:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:59,287 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2018-02-02 20:38:59,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:38:59,287 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 20:38:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:59,288 INFO L225 Difference]: With dead ends: 243 [2018-02-02 20:38:59,288 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 20:38:59,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:38:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 20:38:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2018-02-02 20:38:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 20:38:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 264 transitions. [2018-02-02 20:38:59,293 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 264 transitions. Word has length 62 [2018-02-02 20:38:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:59,293 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 264 transitions. [2018-02-02 20:38:59,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:38:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 264 transitions. [2018-02-02 20:38:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:38:59,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:59,294 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:59,294 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1162377056, now seen corresponding path program 1 times [2018-02-02 20:38:59,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:59,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:59,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:59,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:38:59,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:59,725 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:38:59,725 INFO L182 omatonBuilderFactory]: Interpolants [12739#true, 12740#false, 12741#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 12742#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 12743#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 12744#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12745#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= entry_point_~i~2 0)), 12746#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12747#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12748#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12749#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 2)), 12750#(and (= alloc_17_~array.offset 0) (or (= (select |#valid| alloc_17_~array.base) 1) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (<= alloc_17_~len 2)), 12751#(= |#valid| |old(#valid)|), 12752#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 12753#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 12754#(and (= alloc_17_~array.offset 0) (<= alloc_17_~len 2) (or (not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 12755#(and (= alloc_17_~array.offset 0) (<= alloc_17_~len 2) (or (not (= alloc_17_~array.base alloc_17_~p~0.base)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 12756#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (<= alloc_17_~len 2)), 12757#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~len 2) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 3)))), 12758#(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)))), 12759#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 0) (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))), 12760#(and (<= 0 alloc_17_~j~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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 12761#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 12762#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 20:38:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:59,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:38:59,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:38:59,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:38:59,725 INFO L87 Difference]: Start difference. First operand 231 states and 264 transitions. Second operand 24 states. [2018-02-02 20:39:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:00,461 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2018-02-02 20:39:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:39:00,461 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-02-02 20:39:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:00,462 INFO L225 Difference]: With dead ends: 253 [2018-02-02 20:39:00,462 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 20:39:00,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:39:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 20:39:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 233. [2018-02-02 20:39:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 20:39:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 266 transitions. [2018-02-02 20:39:00,466 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 266 transitions. Word has length 63 [2018-02-02 20:39:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:00,466 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 266 transitions. [2018-02-02 20:39:00,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:39:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 266 transitions. [2018-02-02 20:39:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:39:00,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:00,467 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:00,467 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash -115145315, now seen corresponding path program 1 times [2018-02-02 20:39:00,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:00,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:39:01,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:01,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:39:01,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:01,126 INFO L182 omatonBuilderFactory]: Interpolants [13287#true, 13288#false, 13289#(= |#valid| |old(#valid)|), 13290#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 13291#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13292#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0) (= 1 (select |#valid| |entry_point_#t~ret12.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13293#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13294#(and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 13295#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 13296#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0))), 13297#(and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (not (= |alloc_17_#t~ret4.base| 0)) (= (store |old(#valid)| |alloc_17_#t~ret4.base| (select |#valid| |alloc_17_#t~ret4.base|)) |#valid|) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= (select |old(#valid)| |alloc_17_#t~ret4.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 13298#(and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (and (not (= alloc_17_~p~0.base 0)) (= |#valid| (store |old(#valid)| alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (= (select |old(#valid)| alloc_17_~p~0.base) 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 13299#(or (and (= alloc_17_~i~0 0) (not (= |alloc_17_#in~array.offset| 0))) (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 0) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 1))), 13300#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 0) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 1))), 13301#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 13302#(and (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= free_17_~array.offset 0)) (= |free_17_#in~array.offset| free_17_~array.offset)))), 13303#(or (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 13304#(or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (not (= |free_17_#in~array.offset| 0)) (and (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))))), 13305#(and (not (= entry_point_~array~0.base 0)) (= (select |old(#valid)| entry_point_~array~0.base) (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (= (store |old(#valid)| entry_point_~array~0.base (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (store |#valid| entry_point_~array~0.base 0)))] [2018-02-02 20:39:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:39:01,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:39:01,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:39:01,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:39:01,126 INFO L87 Difference]: Start difference. First operand 233 states and 266 transitions. Second operand 19 states. [2018-02-02 20:39:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:01,898 INFO L93 Difference]: Finished difference Result 292 states and 341 transitions. [2018-02-02 20:39:01,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:39:01,898 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-02-02 20:39:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:01,899 INFO L225 Difference]: With dead ends: 292 [2018-02-02 20:39:01,899 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 20:39:01,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:39:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 20:39:01,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 235. [2018-02-02 20:39:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-02 20:39:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 280 transitions. [2018-02-02 20:39:01,902 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 280 transitions. Word has length 65 [2018-02-02 20:39:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:01,902 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 280 transitions. [2018-02-02 20:39:01,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:39:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 280 transitions. [2018-02-02 20:39:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:39:01,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:01,903 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:01,903 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:01,904 INFO L82 PathProgramCache]: Analyzing trace with hash 32703062, now seen corresponding path program 2 times [2018-02-02 20:39:01,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:01,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 20:39:02,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:02,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:39:02,225 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:02,225 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:39:02,226 INFO L182 omatonBuilderFactory]: Interpolants [13856#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 13857#(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)), 13858#(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))))), 13859#(= 0 |alloc_17_#t~mem7.offset|), 13845#true, 13846#false, 13847#(= 0 |ldv_malloc_#t~malloc2.offset|), 13848#(= 0 |ldv_malloc_#res.offset|), 13849#(= 0 |entry_point_#t~ret12.offset|), 13850#(= 0 entry_point_~array~0.offset), 13851#(= 0 |alloc_17_#in~array.offset|), 13852#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 13853#(and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 13854#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 13855#(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)))))] [2018-02-02 20:39:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 20:39:02,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:39:02,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:39:02,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:39:02,226 INFO L87 Difference]: Start difference. First operand 235 states and 280 transitions. Second operand 15 states. [2018-02-02 20:39:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:02,506 INFO L93 Difference]: Finished difference Result 267 states and 316 transitions. [2018-02-02 20:39:02,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:39:02,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-02-02 20:39:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:02,507 INFO L225 Difference]: With dead ends: 267 [2018-02-02 20:39:02,507 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 20:39:02,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:39:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 20:39:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 242. [2018-02-02 20:39:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 20:39:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 290 transitions. [2018-02-02 20:39:02,513 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 290 transitions. Word has length 65 [2018-02-02 20:39:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:02,513 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 290 transitions. [2018-02-02 20:39:02,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:39:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 290 transitions. [2018-02-02 20:39:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:39:02,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:02,514 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:02,514 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:02,514 INFO L82 PathProgramCache]: Analyzing trace with hash 32703063, now seen corresponding path program 2 times [2018-02-02 20:39:02,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:02,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:39:02,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:02,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:02,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:02,872 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:39:02,872 INFO L182 omatonBuilderFactory]: Interpolants [14400#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 14401#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 14402#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))), 14403#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 14404#(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)))))), 14405#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 14406#(= |#valid| |old(#valid)|), 14407#(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)), 14408#(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)))))), 14409#(= 1 (select |#valid| |alloc_17_#t~mem7.base|)), 14392#true, 14393#false, 14394#(= 0 |ldv_malloc_#t~malloc2.offset|), 14395#(= 0 |ldv_malloc_#res.offset|), 14396#(= 0 |entry_point_#t~ret12.offset|), 14397#(= 0 entry_point_~array~0.offset), 14398#(= 0 |alloc_17_#in~array.offset|), 14399#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0))] [2018-02-02 20:39:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:39:02,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:39:02,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:39:02,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:02,872 INFO L87 Difference]: Start difference. First operand 242 states and 290 transitions. Second operand 18 states. [2018-02-02 20:39:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:03,326 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2018-02-02 20:39:03,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:39:03,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-02-02 20:39:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:03,327 INFO L225 Difference]: With dead ends: 251 [2018-02-02 20:39:03,327 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 20:39:03,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:39:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 20:39:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2018-02-02 20:39:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 20:39:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 292 transitions. [2018-02-02 20:39:03,332 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 292 transitions. Word has length 65 [2018-02-02 20:39:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:03,332 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 292 transitions. [2018-02-02 20:39:03,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:39:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 292 transitions. [2018-02-02 20:39:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:39:03,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:03,333 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:03,333 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash -375554797, now seen corresponding path program 2 times [2018-02-02 20:39:03,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:03,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:03,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:03,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:39:03,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:03,483 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:39:03,483 INFO L182 omatonBuilderFactory]: Interpolants [14931#true, 14932#false, 14933#(= 0 |ldv_malloc_#t~malloc2.offset|), 14934#(= 0 |ldv_malloc_#res.offset|), 14935#(= 0 |entry_point_#t~ret12.offset|), 14936#(= entry_point_~array~0.offset 0), 14937#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 14938#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 14939#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 14940#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 14941#(and (= free_17_~len |free_17_#in~len|) (<= free_17_~i~1 1)), 14942#(<= |free_17_#in~len| 1)] [2018-02-02 20:39:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:03,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:39:03,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:39:03,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:39:03,484 INFO L87 Difference]: Start difference. First operand 244 states and 292 transitions. Second operand 12 states. [2018-02-02 20:39:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:03,558 INFO L93 Difference]: Finished difference Result 267 states and 313 transitions. [2018-02-02 20:39:03,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:39:03,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-02-02 20:39:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:03,559 INFO L225 Difference]: With dead ends: 267 [2018-02-02 20:39:03,559 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 20:39:03,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:39:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 20:39:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 229. [2018-02-02 20:39:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-02 20:39:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 271 transitions. [2018-02-02 20:39:03,562 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 271 transitions. Word has length 66 [2018-02-02 20:39:03,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:03,562 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 271 transitions. [2018-02-02 20:39:03,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:39:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 271 transitions. [2018-02-02 20:39:03,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:39:03,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:03,562 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:03,562 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1965154507, now seen corresponding path program 1 times [2018-02-02 20:39:03,563 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:03,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:39:03,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:03,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:39:03,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:03,694 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:39:03,694 INFO L182 omatonBuilderFactory]: Interpolants [15446#true, 15447#false, 15448#(= alloc_17_~array.base |alloc_17_#in~array.base|), 15449#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 15450#(= |#valid| |old(#valid)|), 15451#(= 1 (select |#valid| entry_point_~array~0.base)), 15452#(= 1 (select |#valid| |free_17_#in~array.base|)), 15453#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:39:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:39:03,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:39:03,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:39:03,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:39:03,695 INFO L87 Difference]: Start difference. First operand 229 states and 271 transitions. Second operand 8 states. [2018-02-02 20:39:03,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:03,820 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2018-02-02 20:39:03,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:39:03,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-02-02 20:39:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:03,821 INFO L225 Difference]: With dead ends: 232 [2018-02-02 20:39:03,821 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 20:39:03,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:39:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 20:39:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 215. [2018-02-02 20:39:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 20:39:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2018-02-02 20:39:03,825 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 68 [2018-02-02 20:39:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:03,825 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2018-02-02 20:39:03,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:39:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2018-02-02 20:39:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:39:03,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:03,826 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:03,826 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1965154506, now seen corresponding path program 1 times [2018-02-02 20:39:03,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:03,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 20:39:03,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:03,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:39:03,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:03,923 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:39:03,923 INFO L182 omatonBuilderFactory]: Interpolants [15920#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 15921#(not (= |alloc_17_#in~array.offset| 0)), 15911#true, 15912#false, 15913#(= 0 |ldv_malloc_#t~malloc2.offset|), 15914#(= 0 |ldv_malloc_#res.offset|), 15915#(= 0 |entry_point_#t~ret12.offset|), 15916#(= 0 entry_point_~array~0.offset), 15917#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 15918#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 15919#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0))] [2018-02-02 20:39:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 20:39:03,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:39:03,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:39:03,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:39:03,924 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand 11 states. [2018-02-02 20:39:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:04,112 INFO L93 Difference]: Finished difference Result 223 states and 260 transitions. [2018-02-02 20:39:04,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:39:04,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-02 20:39:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:04,114 INFO L225 Difference]: With dead ends: 223 [2018-02-02 20:39:04,114 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 20:39:04,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:39:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 20:39:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-02 20:39:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 20:39:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 253 transitions. [2018-02-02 20:39:04,117 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 253 transitions. Word has length 68 [2018-02-02 20:39:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:04,117 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 253 transitions. [2018-02-02 20:39:04,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:39:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 253 transitions. [2018-02-02 20:39:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:39:04,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:04,118 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:04,118 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 916929714, now seen corresponding path program 3 times [2018-02-02 20:39:04,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:04,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:04,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:04,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:39:04,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:04,274 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:39:04,274 INFO L182 omatonBuilderFactory]: Interpolants [16384#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= free_17_~array.offset 0)), 16385#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4)) (= free_17_~array.offset 0)), 16386#(<= free_17_~len (+ free_17_~i~1 1)), 16387#(<= free_17_~len free_17_~i~1), 16372#true, 16373#false, 16374#(= 0 |ldv_malloc_#t~malloc2.offset|), 16375#(= 0 |ldv_malloc_#res.offset|), 16376#(= 0 |entry_point_#t~ret12.offset|), 16377#(= 0 entry_point_~array~0.offset), 16378#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 16379#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 16380#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 16381#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 16382#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 2)), 16383#(and (<= free_17_~len 2) (= free_17_~array.offset 0))] [2018-02-02 20:39:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:04,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:39:04,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:39:04,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:39:04,275 INFO L87 Difference]: Start difference. First operand 217 states and 253 transitions. Second operand 16 states. [2018-02-02 20:39:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:04,397 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2018-02-02 20:39:04,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:39:04,397 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-02 20:39:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:04,398 INFO L225 Difference]: With dead ends: 287 [2018-02-02 20:39:04,398 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 20:39:04,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:39:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 20:39:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2018-02-02 20:39:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 20:39:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 323 transitions. [2018-02-02 20:39:04,402 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 323 transitions. Word has length 67 [2018-02-02 20:39:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:04,402 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 323 transitions. [2018-02-02 20:39:04,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:39:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 323 transitions. [2018-02-02 20:39:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:39:04,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:04,403 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:04,403 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1362872503, now seen corresponding path program 2 times [2018-02-02 20:39:04,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:04,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 20:39:04,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:04,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:39:04,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:04,765 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:39:04,765 INFO L182 omatonBuilderFactory]: Interpolants [16960#true, 16961#false, 16962#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 16963#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 16964#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 16965#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 16966#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 16967#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 16968#(= |#valid| |old(#valid)|), 16969#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 16970#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 16971#(and (not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 16972#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 16973#(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)))))), 16974#(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)))), 16975#(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)), 16976#(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))), 16977#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 16978#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 20:39:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 20:39:04,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:39:04,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:39:04,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:39:04,766 INFO L87 Difference]: Start difference. First operand 274 states and 323 transitions. Second operand 19 states. [2018-02-02 20:39:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:05,139 INFO L93 Difference]: Finished difference Result 289 states and 337 transitions. [2018-02-02 20:39:05,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:39:05,139 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-02 20:39:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:05,140 INFO L225 Difference]: With dead ends: 289 [2018-02-02 20:39:05,140 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 20:39:05,140 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:39:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 20:39:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2018-02-02 20:39:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 20:39:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 325 transitions. [2018-02-02 20:39:05,143 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 325 transitions. Word has length 67 [2018-02-02 20:39:05,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:05,143 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 325 transitions. [2018-02-02 20:39:05,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:39:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 325 transitions. [2018-02-02 20:39:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:39:05,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:05,144 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:05,144 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:05,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2118087437, now seen corresponding path program 1 times [2018-02-02 20:39:05,145 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:05,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:05,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:05,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:39:05,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:05,176 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:39:05,176 INFO L182 omatonBuilderFactory]: Interpolants [17562#true, 17563#false, 17564#(= alloc_17_~i~0 0), 17565#(<= alloc_17_~i~0 1), 17566#(<= alloc_17_~j~0 0), 17567#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-02 20:39:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:05,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:39:05,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:39:05,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:39:05,176 INFO L87 Difference]: Start difference. First operand 276 states and 325 transitions. Second operand 6 states. [2018-02-02 20:39:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:05,206 INFO L93 Difference]: Finished difference Result 299 states and 347 transitions. [2018-02-02 20:39:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:39:05,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-02-02 20:39:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:05,217 INFO L225 Difference]: With dead ends: 299 [2018-02-02 20:39:05,217 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 20:39:05,217 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:39:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 20:39:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 285. [2018-02-02 20:39:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-02 20:39:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 333 transitions. [2018-02-02 20:39:05,222 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 333 transitions. Word has length 68 [2018-02-02 20:39:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:05,223 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 333 transitions. [2018-02-02 20:39:05,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:39:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 333 transitions. [2018-02-02 20:39:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:39:05,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:05,224 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:05,224 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash 701115179, now seen corresponding path program 2 times [2018-02-02 20:39:05,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:05,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:05,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:05,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:39:05,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:05,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:39:05,446 INFO L182 omatonBuilderFactory]: Interpolants [18158#true, 18159#false, 18160#(= 0 |ldv_malloc_#t~malloc2.offset|), 18161#(= 0 |ldv_malloc_#res.offset|), 18162#(= 0 |entry_point_#t~ret12.offset|), 18163#(= entry_point_~array~0.offset 0), 18164#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 18165#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 18166#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 18167#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 18168#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 18169#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 18170#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 18171#(and (or (not (= free_17_~array.offset 0)) (<= free_17_~i~1 1)) (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|)), 18172#(and (= 1 (select |#valid| |free_17_#in~array.base|)) (or (not (= |free_17_#in~array.offset| 0)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1)))))), 18173#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1))))) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0))), 18174#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 20:39:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:05,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:39:05,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:39:05,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:39:05,447 INFO L87 Difference]: Start difference. First operand 285 states and 333 transitions. Second operand 17 states. [2018-02-02 20:39:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:05,854 INFO L93 Difference]: Finished difference Result 329 states and 388 transitions. [2018-02-02 20:39:05,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:39:05,854 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-02-02 20:39:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:05,855 INFO L225 Difference]: With dead ends: 329 [2018-02-02 20:39:05,855 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 20:39:05,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:39:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 20:39:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 292. [2018-02-02 20:39:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 20:39:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 341 transitions. [2018-02-02 20:39:05,859 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 341 transitions. Word has length 69 [2018-02-02 20:39:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:05,859 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 341 transitions. [2018-02-02 20:39:05,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:39:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 341 transitions. [2018-02-02 20:39:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:39:05,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:05,860 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:05,860 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:05,860 INFO L82 PathProgramCache]: Analyzing trace with hash 881428740, now seen corresponding path program 3 times [2018-02-02 20:39:05,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:05,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 20:39:06,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:06,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:06,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:39:06,272 INFO L182 omatonBuilderFactory]: Interpolants [18848#(= 0 |free_17_#t~mem10.offset|), 18831#true, 18832#false, 18833#(= 0 |ldv_malloc_#t~malloc2.offset|), 18834#(= 0 |ldv_malloc_#res.offset|), 18835#(= 0 |entry_point_#t~ret12.offset|), 18836#(= 0 entry_point_~array~0.offset), 18837#(and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 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|))), 18838#(and (or (and (= 0 |alloc_17_#t~ret4.offset|) (= 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 (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 18839#(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 (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 18840#(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 (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 18841#(or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 18842#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 18843#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 18844#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18845#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 18846#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 18847#(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:39:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 20:39:06,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:39:06,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:39:06,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:06,272 INFO L87 Difference]: Start difference. First operand 292 states and 341 transitions. Second operand 18 states. [2018-02-02 20:39:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:06,663 INFO L93 Difference]: Finished difference Result 447 states and 524 transitions. [2018-02-02 20:39:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:39:06,664 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-02-02 20:39:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:06,665 INFO L225 Difference]: With dead ends: 447 [2018-02-02 20:39:06,665 INFO L226 Difference]: Without dead ends: 447 [2018-02-02 20:39:06,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:39:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-02-02 20:39:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 422. [2018-02-02 20:39:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 20:39:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 508 transitions. [2018-02-02 20:39:06,672 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 508 transitions. Word has length 72 [2018-02-02 20:39:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:06,672 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 508 transitions. [2018-02-02 20:39:06,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:39:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 508 transitions. [2018-02-02 20:39:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:39:06,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:06,673 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:06,673 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash 881428741, now seen corresponding path program 2 times [2018-02-02 20:39:06,674 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:06,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:39:07,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:07,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:39:07,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:39:07,264 INFO L182 omatonBuilderFactory]: Interpolants [19744#(and (= alloc_17_~i~0 0) (or (and (= 1 (select |#valid| alloc_17_~p~0.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))), 19745#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19746#(and (or (and (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19747#(= |#valid| |old(#valid)|), 19748#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 19749#(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|))))), 19750#(and (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 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))), 19751#(or (not (= |alloc_17_#in~array.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 19752#(and (= 0 entry_point_~array~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 19753#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|)), 19754#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 19755#(= 1 (select |#valid| |free_17_#t~mem10.base|)), 19733#true, 19734#false, 19735#(= 0 |ldv_malloc_#t~malloc2.offset|), 19736#(= 0 |ldv_malloc_#res.offset|), 19737#(= 0 |entry_point_#t~ret12.offset|), 19738#(= 0 entry_point_~array~0.offset), 19739#(and (= alloc_17_~i~0 0) (or (not (= 0 (+ (* 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))), 19740#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 19741#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 19742#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 19743#(and (= alloc_17_~i~0 0) (or (and (= 1 (select |#valid| |alloc_17_#t~ret4.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)))] [2018-02-02 20:39:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:39:07,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:39:07,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:39:07,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:39:07,265 INFO L87 Difference]: Start difference. First operand 422 states and 508 transitions. Second operand 23 states. [2018-02-02 20:39:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:08,122 INFO L93 Difference]: Finished difference Result 435 states and 516 transitions. [2018-02-02 20:39:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:39:08,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-02-02 20:39:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:08,124 INFO L225 Difference]: With dead ends: 435 [2018-02-02 20:39:08,124 INFO L226 Difference]: Without dead ends: 435 [2018-02-02 20:39:08,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:39:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-02 20:39:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 422. [2018-02-02 20:39:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 20:39:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 506 transitions. [2018-02-02 20:39:08,129 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 506 transitions. Word has length 72 [2018-02-02 20:39:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:08,129 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 506 transitions. [2018-02-02 20:39:08,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:39:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 506 transitions. [2018-02-02 20:39:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:39:08,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:08,130 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:08,130 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1957426551, now seen corresponding path program 4 times [2018-02-02 20:39:08,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:08,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:39:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:08,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:08,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:39:08,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:08,536 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:39:08,536 INFO L182 omatonBuilderFactory]: Interpolants [20641#true, 20642#false, 20643#(= 0 |ldv_malloc_#t~malloc2.offset|), 20644#(= 0 |ldv_malloc_#res.offset|), 20645#(= 0 |entry_point_#t~ret12.offset|), 20646#(= entry_point_~array~0.offset 0), 20647#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 20648#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 20649#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 20650#(and (= entry_point_~array~0.offset 0) (or (= 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 1))), 20651#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= entry_point_~i~2 2)) (= entry_point_~array~0.offset 0)), 20652#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= entry_point_~len~0 2)) (= entry_point_~array~0.offset 0)), 20653#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 20654#(and (= 0 |free_17_#in~array.offset|) (or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)) (<= |free_17_#in~len| 2))), 20655#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (<= free_17_~len 2)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 20656#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4))) (= free_17_~array.offset 0)), 20657#(and (or (<= free_17_~len (+ free_17_~i~1 1)) (= 0 |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 20658#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len (+ free_17_~i~1 1))), 20659#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len free_17_~i~1)), 20660#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:39:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:08,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:39:08,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:39:08,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:39:08,537 INFO L87 Difference]: Start difference. First operand 422 states and 506 transitions. Second operand 20 states. [2018-02-02 20:39:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:09,000 INFO L93 Difference]: Finished difference Result 433 states and 514 transitions. [2018-02-02 20:39:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:39:09,000 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2018-02-02 20:39:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:09,001 INFO L225 Difference]: With dead ends: 433 [2018-02-02 20:39:09,002 INFO L226 Difference]: Without dead ends: 433 [2018-02-02 20:39:09,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:39:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-02 20:39:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 423. [2018-02-02 20:39:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-02 20:39:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 507 transitions. [2018-02-02 20:39:09,009 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 507 transitions. Word has length 71 [2018-02-02 20:39:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:09,009 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 507 transitions. [2018-02-02 20:39:09,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:39:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 507 transitions. [2018-02-02 20:39:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:39:09,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:09,010 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:09,010 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:09,010 INFO L82 PathProgramCache]: Analyzing trace with hash 496408573, now seen corresponding path program 3 times [2018-02-02 20:39:09,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:09,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:09,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:09,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:39:09,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:09,560 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:39:09,560 INFO L182 omatonBuilderFactory]: Interpolants [21568#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 21569#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (and (= free_17_~array.base |free_17_#in~array.base|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~i~1 0)))), 21570#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 1 free_17_~i~1) (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (<= free_17_~i~1 1)))), 21571#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1)))))), 21572#(or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 21573#(and (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base))), 21554#true, 21555#false, 21556#(= |#valid| |old(#valid)|), 21557#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (store |#valid| |ldv_malloc_#t~malloc2.base| (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)) |old(#valid)|) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 21558#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 21559#(and (= |old(#valid)| (store |#valid| |entry_point_#t~ret12.base| (select |old(#valid)| |entry_point_#t~ret12.base|))) (= 0 (select |old(#valid)| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 21560#(and (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 21561#(and (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 21562#(and (= 0 (select (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) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 21563#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select |old(#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))), 21564#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 21565#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 21566#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21567#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0))))] [2018-02-02 20:39:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:09,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:39:09,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:39:09,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:39:09,561 INFO L87 Difference]: Start difference. First operand 423 states and 507 transitions. Second operand 20 states. [2018-02-02 20:39:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:09,979 INFO L93 Difference]: Finished difference Result 478 states and 588 transitions. [2018-02-02 20:39:09,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:39:09,979 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-02-02 20:39:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:09,980 INFO L225 Difference]: With dead ends: 478 [2018-02-02 20:39:09,981 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 20:39:09,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:39:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 20:39:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 393. [2018-02-02 20:39:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-02 20:39:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 475 transitions. [2018-02-02 20:39:09,985 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 475 transitions. Word has length 72 [2018-02-02 20:39:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:09,985 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 475 transitions. [2018-02-02 20:39:09,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:39:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 475 transitions. [2018-02-02 20:39:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:39:09,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:09,985 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:09,986 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash -550680879, now seen corresponding path program 2 times [2018-02-02 20:39:09,986 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:09,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:39:10,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:10,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:39:10,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:39:10,472 INFO L182 omatonBuilderFactory]: Interpolants [22464#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 22465#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 22466#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (or (<= (+ (* 4 entry_point_~len~0) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))))), 22467#(or (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 2) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0))), 22468#(or (and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 22469#(and (<= entry_point_~i~2 2) (= 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) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))), 22470#(and (or (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 11)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (select |#length| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) (- 4)))))))) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 12)) (= entry_point_~array~0.offset 0)), 22471#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (select |#length| entry_point_~array~0.base) (- 4))))) (<= (select |#length| entry_point_~array~0.base) 11)) (<= (select |#length| entry_point_~array~0.base) 12) (= entry_point_~array~0.offset 0)), 22472#(and (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22473#(= |old(#length)| |#length|), 22474#(and (<= (select |#length| |free_17_#in~array.base|) 12) (or (<= (select |#length| |free_17_#in~array.base|) 11) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ (select |#length| |free_17_#in~array.base|) (- 4)))))), 22475#(and (<= (select |#length| free_17_~array.base) 12) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))) (<= (select |#length| free_17_~array.base) 11))), 22476#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 12))), 22477#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)))), 22478#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))), 22479#(= 0 |free_17_#t~mem10.offset|), 22457#true, 22458#false, 22459#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 22460#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= (+ |ldv_malloc_#in~size| 1) 0)))), 22461#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|)))), 22462#(or (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| |entry_point_#t~ret12.base|) (* 4 entry_point_~len~0))) (= 0 |entry_point_#t~ret12.offset|)) (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0)), 22463#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)))] [2018-02-02 20:39:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:39:10,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:39:10,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:39:10,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:39:10,473 INFO L87 Difference]: Start difference. First operand 393 states and 475 transitions. Second operand 23 states. [2018-02-02 20:39:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:11,533 INFO L93 Difference]: Finished difference Result 436 states and 525 transitions. [2018-02-02 20:39:11,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:39:11,533 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-02-02 20:39:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:11,534 INFO L225 Difference]: With dead ends: 436 [2018-02-02 20:39:11,534 INFO L226 Difference]: Without dead ends: 436 [2018-02-02 20:39:11,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:39:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-02 20:39:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 424. [2018-02-02 20:39:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 20:39:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 515 transitions. [2018-02-02 20:39:11,538 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 515 transitions. Word has length 72 [2018-02-02 20:39:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:11,539 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 515 transitions. [2018-02-02 20:39:11,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:39:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 515 transitions. [2018-02-02 20:39:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:39:11,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:11,540 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:11,540 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash -550680878, now seen corresponding path program 2 times [2018-02-02 20:39:11,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:11,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:39:12,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:12,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:39:12,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:39:12,107 INFO L182 omatonBuilderFactory]: Interpolants [23392#(= |old(#length)| |#length|), 23393#(and (<= (select |#length| |free_17_#in~array.base|) 12) (or (<= (select |#length| |free_17_#in~array.base|) 11) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (select |#length| |free_17_#in~array.base|) (- 4)))))), 23394#(and (or (<= (select |#length| free_17_~array.base) 11) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) 12)), 23395#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 12))), 23396#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 8))), 23397#(or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))), 23398#(= 0 |free_17_#t~mem10.base|), 23376#true, 23377#false, 23378#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 23379#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= (+ |ldv_malloc_#in~size| 1) 0)))), 23380#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|)))), 23381#(or (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| |entry_point_#t~ret12.base|) (* 4 entry_point_~len~0))) (= 0 |entry_point_#t~ret12.offset|)) (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0)), 23382#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0))), 23383#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 23384#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 23385#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (or (<= (+ (* 4 entry_point_~len~0) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))))), 23386#(or (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 2) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0))), 23387#(or (and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 23388#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))), 23389#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (select |#length| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) (- 4))))))) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 11))) (= entry_point_~array~0.offset 0) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 12))), 23390#(and (<= (select |#length| entry_point_~array~0.base) 12) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (select |#length| entry_point_~array~0.base) (- 4))))) (<= (select |#length| entry_point_~array~0.base) 11))), 23391#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|))] [2018-02-02 20:39:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:39:12,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:39:12,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:39:12,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:39:12,107 INFO L87 Difference]: Start difference. First operand 424 states and 515 transitions. Second operand 23 states. [2018-02-02 20:39:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:13,078 INFO L93 Difference]: Finished difference Result 435 states and 524 transitions. [2018-02-02 20:39:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:39:13,078 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-02-02 20:39:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:13,079 INFO L225 Difference]: With dead ends: 435 [2018-02-02 20:39:13,079 INFO L226 Difference]: Without dead ends: 435 [2018-02-02 20:39:13,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:39:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-02 20:39:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-02-02 20:39:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 20:39:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 514 transitions. [2018-02-02 20:39:13,083 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 514 transitions. Word has length 72 [2018-02-02 20:39:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:13,083 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 514 transitions. [2018-02-02 20:39:13,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:39:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 514 transitions. [2018-02-02 20:39:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:39:13,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:13,084 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:13,084 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:13,084 INFO L82 PathProgramCache]: Analyzing trace with hash -698710182, now seen corresponding path program 3 times [2018-02-02 20:39:13,085 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:13,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:13,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:13,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:13,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:13,315 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:39:13,315 INFO L182 omatonBuilderFactory]: Interpolants [24288#true, 24289#false, 24290#(= 0 |ldv_malloc_#t~malloc2.offset|), 24291#(= 0 |ldv_malloc_#res.offset|), 24292#(= 0 |entry_point_#t~ret12.offset|), 24293#(= entry_point_~array~0.offset 0), 24294#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 24295#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 24296#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 24297#(and (<= entry_point_~i~2 2) (= 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) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 24298#(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) (+ (+ (- entry_point_~array~0.offset) 8) entry_point_~array~0.offset)))), 24299#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 8) entry_point_~array~0.offset)))), 24300#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 24301#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 24302#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 24303#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 24304#(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)), 24305#(= 0 |free_17_#t~mem10.offset|)] [2018-02-02 20:39:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:13,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:39:13,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:39:13,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:13,315 INFO L87 Difference]: Start difference. First operand 424 states and 514 transitions. Second operand 18 states. [2018-02-02 20:39:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:13,682 INFO L93 Difference]: Finished difference Result 442 states and 529 transitions. [2018-02-02 20:39:13,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:39:13,683 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2018-02-02 20:39:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:13,684 INFO L225 Difference]: With dead ends: 442 [2018-02-02 20:39:13,684 INFO L226 Difference]: Without dead ends: 442 [2018-02-02 20:39:13,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:39:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-02 20:39:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 425. [2018-02-02 20:39:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 20:39:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 516 transitions. [2018-02-02 20:39:13,688 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 516 transitions. Word has length 76 [2018-02-02 20:39:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:13,688 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 516 transitions. [2018-02-02 20:39:13,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:39:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 516 transitions. [2018-02-02 20:39:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:39:13,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:13,689 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:13,689 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:13,689 INFO L82 PathProgramCache]: Analyzing trace with hash -698710181, now seen corresponding path program 3 times [2018-02-02 20:39:13,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:13,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:14,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:14,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:39:14,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:14,128 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:39:14,128 INFO L182 omatonBuilderFactory]: Interpolants [25216#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 25217#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 entry_point_~len~0)), 25218#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 25219#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 25220#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 25221#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 25222#(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)), 25223#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 25224#(= 0 |free_17_#t~mem10.base|), 25204#true, 25205#false, 25206#(= 0 |ldv_malloc_#t~malloc2.offset|), 25207#(= 0 |ldv_malloc_#res.offset|), 25208#(= 0 |entry_point_#t~ret12.offset|), 25209#(= 0 entry_point_~array~0.offset), 25210#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 25211#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 25212#(and (<= entry_point_~i~2 2) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25213#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25214#(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 8))) (= entry_point_~array~0.offset 0)), 25215#(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 8))) (= entry_point_~array~0.offset 0) (<= (+ entry_point_~i~2 1) entry_point_~len~0))] [2018-02-02 20:39:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:14,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:39:14,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:39:14,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:39:14,129 INFO L87 Difference]: Start difference. First operand 425 states and 516 transitions. Second operand 21 states. [2018-02-02 20:39:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:14,671 INFO L93 Difference]: Finished difference Result 441 states and 528 transitions. [2018-02-02 20:39:14,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:39:14,671 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-02 20:39:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:14,672 INFO L225 Difference]: With dead ends: 441 [2018-02-02 20:39:14,672 INFO L226 Difference]: Without dead ends: 441 [2018-02-02 20:39:14,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:39:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-02 20:39:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 425. [2018-02-02 20:39:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 20:39:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 515 transitions. [2018-02-02 20:39:14,675 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 515 transitions. Word has length 76 [2018-02-02 20:39:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:14,675 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 515 transitions. [2018-02-02 20:39:14,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:39:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 515 transitions. [2018-02-02 20:39:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:39:14,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:14,676 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:14,676 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:14,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2142667465, now seen corresponding path program 1 times [2018-02-02 20:39:14,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:14,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:14,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:14,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:39:14,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:14,837 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:39:14,837 INFO L182 omatonBuilderFactory]: Interpolants [26118#true, 26119#false, 26120#(= 0 |ldv_malloc_#t~malloc2.offset|), 26121#(= 0 |ldv_malloc_#res.offset|), 26122#(= 0 |entry_point_#t~ret12.offset|), 26123#(= 0 entry_point_~array~0.offset), 26124#(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|)), 26125#(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|)), 26126#(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|)), 26127#(or (<= 4 (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 26128#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 26129#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 26130#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 20:39:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:14,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:39:14,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:39:14,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:39:14,838 INFO L87 Difference]: Start difference. First operand 425 states and 515 transitions. Second operand 13 states. [2018-02-02 20:39:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:15,006 INFO L93 Difference]: Finished difference Result 436 states and 517 transitions. [2018-02-02 20:39:15,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:39:15,007 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2018-02-02 20:39:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:15,008 INFO L225 Difference]: With dead ends: 436 [2018-02-02 20:39:15,008 INFO L226 Difference]: Without dead ends: 436 [2018-02-02 20:39:15,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:39:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-02 20:39:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 383. [2018-02-02 20:39:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 20:39:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 455 transitions. [2018-02-02 20:39:15,014 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 455 transitions. Word has length 75 [2018-02-02 20:39:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:15,014 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 455 transitions. [2018-02-02 20:39:15,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:39:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 455 transitions. [2018-02-02 20:39:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:39:15,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:15,015 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:15,015 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:15,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1998182003, now seen corresponding path program 1 times [2018-02-02 20:39:15,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:15,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:15,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:15,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:39:15,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:15,290 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:39:15,290 INFO L182 omatonBuilderFactory]: Interpolants [26956#true, 26957#false, 26958#(= 0 |ldv_malloc_#t~malloc2.offset|), 26959#(= 0 |ldv_malloc_#res.offset|), 26960#(= 0 |entry_point_#t~ret12.offset|), 26961#(= 0 entry_point_~array~0.offset), 26962#(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))), 26963#(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|))), 26964#(and (or (and (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (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))), 26965#(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))), 26966#(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))), 26967#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 26968#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 26969#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 26970#(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)), 26971#(= 0 |free_17_#t~mem10.base|)] [2018-02-02 20:39:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:15,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:39:15,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:39:15,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:39:15,291 INFO L87 Difference]: Start difference. First operand 383 states and 455 transitions. Second operand 16 states. [2018-02-02 20:39:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:15,517 INFO L93 Difference]: Finished difference Result 434 states and 511 transitions. [2018-02-02 20:39:15,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:39:15,518 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-02-02 20:39:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:15,519 INFO L225 Difference]: With dead ends: 434 [2018-02-02 20:39:15,519 INFO L226 Difference]: Without dead ends: 434 [2018-02-02 20:39:15,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:39:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-02-02 20:39:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 383. [2018-02-02 20:39:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 20:39:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 455 transitions. [2018-02-02 20:39:15,522 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 455 transitions. Word has length 76 [2018-02-02 20:39:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:15,522 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 455 transitions. [2018-02-02 20:39:15,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:39:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 455 transitions. [2018-02-02 20:39:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 20:39:15,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:15,523 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:15,523 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:15,523 INFO L82 PathProgramCache]: Analyzing trace with hash 189822284, now seen corresponding path program 1 times [2018-02-02 20:39:15,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:15,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:16,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:16,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:39:16,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:16,216 INFO L182 omatonBuilderFactory]: Interpolants [27803#true, 27804#false, 27805#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 27806#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 27807#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 27808#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 27809#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1) (= entry_point_~i~2 0)), 27810#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1)), 27811#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 27812#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2) (= (select |#valid| entry_point_~array~0.base) 1)), 27813#(= |#valid| |old(#valid)|), 27814#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 27815#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))), 27816#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 27817#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 27818#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))), 27819#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 27820#(and (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| 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 (= alloc_17_~len |alloc_17_#in~len|) (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)))))), 27821#(or (and (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (and (= alloc_17_~len |alloc_17_#in~len|) (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))))), 27822#(or (and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 9 (+ (* 4 alloc_17_~len) 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))) (and (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))), 27823#(or (and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 9 (+ (* 4 alloc_17_~len) 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)))), 27824#(or (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= |alloc_17_#in~array.offset| 0)) (<= 3 alloc_17_~len)))), 27825#(or (<= 3 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 27826#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 27827#(and (not (= |free_17_#in~array.base| (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|))), 27828#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select |#valid| free_17_~array.base))), 27829#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 27830#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:39:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:16,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:39:16,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:39:16,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:39:16,216 INFO L87 Difference]: Start difference. First operand 383 states and 455 transitions. Second operand 28 states. [2018-02-02 20:39:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:17,193 INFO L93 Difference]: Finished difference Result 406 states and 478 transitions. [2018-02-02 20:39:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:39:17,193 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 77 [2018-02-02 20:39:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:17,194 INFO L225 Difference]: With dead ends: 406 [2018-02-02 20:39:17,194 INFO L226 Difference]: Without dead ends: 406 [2018-02-02 20:39:17,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=1654, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:39:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-02-02 20:39:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 397. [2018-02-02 20:39:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-02 20:39:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 471 transitions. [2018-02-02 20:39:17,198 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 471 transitions. Word has length 77 [2018-02-02 20:39:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:17,198 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 471 transitions. [2018-02-02 20:39:17,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:39:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 471 transitions. [2018-02-02 20:39:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 20:39:17,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:17,198 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:17,198 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:17,198 INFO L82 PathProgramCache]: Analyzing trace with hash 189822285, now seen corresponding path program 1 times [2018-02-02 20:39:17,199 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:17,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:39:17,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:17,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:39:17,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:39:17,390 INFO L182 omatonBuilderFactory]: Interpolants [28672#(and (or (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))) (= alloc_17_~len |alloc_17_#in~len|)), 28673#(and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= |alloc_17_#in~array.offset| 0)) (<= (* 4 alloc_17_~i~0) (select |#length| |alloc_17_#in~array.base|)))), 28674#(or (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 28675#(and (= 0 entry_point_~array~0.offset) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base))), 28676#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 28677#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 28678#(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)), 28679#(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)), 28680#(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)), 28665#true, 28666#false, 28667#(= 0 |ldv_malloc_#t~malloc2.offset|), 28668#(= 0 |ldv_malloc_#res.offset|), 28669#(= 0 |entry_point_#t~ret12.offset|), 28670#(= 0 entry_point_~array~0.offset), 28671#(and (= alloc_17_~len |alloc_17_#in~len|) (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:39:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 20:39:17,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:39:17,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:39:17,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:39:17,391 INFO L87 Difference]: Start difference. First operand 397 states and 471 transitions. Second operand 16 states. [2018-02-02 20:39:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:17,613 INFO L93 Difference]: Finished difference Result 434 states and 506 transitions. [2018-02-02 20:39:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:39:17,613 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-02-02 20:39:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:17,614 INFO L225 Difference]: With dead ends: 434 [2018-02-02 20:39:17,614 INFO L226 Difference]: Without dead ends: 434 [2018-02-02 20:39:17,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:39:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-02-02 20:39:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 425. [2018-02-02 20:39:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 20:39:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 502 transitions. [2018-02-02 20:39:17,618 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 502 transitions. Word has length 77 [2018-02-02 20:39:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:17,618 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 502 transitions. [2018-02-02 20:39:17,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:39:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 502 transitions. [2018-02-02 20:39:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:39:17,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:17,619 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 20:39:17,619 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1589523566, now seen corresponding path program 1 times [2018-02-02 20:39:17,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:17,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:39:18,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:18,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:18,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:39:18,034 INFO L182 omatonBuilderFactory]: Interpolants [29568#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 29569#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 29570#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 29571#(= 0 |free_17_#t~mem10.offset|), 29554#true, 29555#false, 29556#(= 0 |ldv_malloc_#t~malloc2.offset|), 29557#(= 0 |ldv_malloc_#res.offset|), 29558#(= 0 |entry_point_#t~ret12.offset|), 29559#(= entry_point_~array~0.offset 0), 29560#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 29561#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 29562#(and (= alloc_17_~i~0 0) (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))), 29563#(and (or (not (= alloc_17_~array.offset 0)) (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29564#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= 0 |alloc_17_#t~ret4.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))), 29565#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= 0 alloc_17_~p~0.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))), 29566#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))))), 29567#(and (= 0 entry_point_~array~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))))] [2018-02-02 20:39:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:39:18,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:39:18,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:39:18,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:18,035 INFO L87 Difference]: Start difference. First operand 425 states and 502 transitions. Second operand 18 states. [2018-02-02 20:39:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:18,400 INFO L93 Difference]: Finished difference Result 459 states and 530 transitions. [2018-02-02 20:39:18,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:39:18,400 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-02 20:39:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:18,401 INFO L225 Difference]: With dead ends: 459 [2018-02-02 20:39:18,401 INFO L226 Difference]: Without dead ends: 459 [2018-02-02 20:39:18,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:39:18,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-02 20:39:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 429. [2018-02-02 20:39:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-02 20:39:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 509 transitions. [2018-02-02 20:39:18,405 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 509 transitions. Word has length 78 [2018-02-02 20:39:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:18,405 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 509 transitions. [2018-02-02 20:39:18,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:39:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 509 transitions. [2018-02-02 20:39:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:39:18,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:18,406 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 20:39:18,406 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:18,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1589523567, now seen corresponding path program 1 times [2018-02-02 20:39:18,406 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:18,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:19,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:19,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:39:19,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:19,128 INFO L182 omatonBuilderFactory]: Interpolants [30482#true, 30483#false, 30484#(= 0 |ldv_malloc_#t~malloc2.offset|), 30485#(= 0 |ldv_malloc_#res.offset|), 30486#(= 0 |entry_point_#t~ret12.offset|), 30487#(= 0 entry_point_~array~0.offset), 30488#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 30489#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 30490#(and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 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|))), 30491#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 30492#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 30493#(and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (not (= |alloc_17_#t~ret4.base| 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 30494#(and (or (and (not (= alloc_17_~p~0.base 0)) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 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 (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 30495#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| 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 (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 30496#(or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 30497#(= |#valid| |old(#valid)|), 30498#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (<= |ldv_malloc_#in~size| ldv_malloc_~size) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|)))))), 30499#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 30500#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)))), 30501#(or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0))) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 30502#(or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0) 0)) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 1 (select |#valid| alloc_17_~p~0.base)) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 30503#(or (not (= |alloc_17_#in~array.offset| 0)) (and (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 30504#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 30505#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)))), 30506#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 4) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~i~1 0) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))) (= free_17_~array.offset 0)), 30507#(and (not (= |free_17_#t~mem10.base| 0)) (= free_17_~i~1 0) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 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)), 30508#(and (= free_17_~i~1 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4))))) (= free_17_~array.offset 0)), 30509#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))) (= free_17_~array.offset 0)), 30510#(= 1 (select |#valid| |free_17_#t~mem10.base|))] [2018-02-02 20:39:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:19,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:39:19,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:39:19,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:39:19,129 INFO L87 Difference]: Start difference. First operand 429 states and 509 transitions. Second operand 29 states. [2018-02-02 20:39:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:20,086 INFO L93 Difference]: Finished difference Result 436 states and 511 transitions. [2018-02-02 20:39:20,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:39:20,087 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2018-02-02 20:39:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:20,087 INFO L225 Difference]: With dead ends: 436 [2018-02-02 20:39:20,088 INFO L226 Difference]: Without dead ends: 436 [2018-02-02 20:39:20,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:39:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-02 20:39:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 429. [2018-02-02 20:39:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-02 20:39:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 507 transitions. [2018-02-02 20:39:20,091 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 507 transitions. Word has length 78 [2018-02-02 20:39:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:20,091 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 507 transitions. [2018-02-02 20:39:20,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:39:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 507 transitions. [2018-02-02 20:39:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:39:20,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:20,092 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2018-02-02 20:39:20,092 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash 10795767, now seen corresponding path program 3 times [2018-02-02 20:39:20,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:20,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 20:39:20,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:20,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:20,334 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:39:20,335 INFO L182 omatonBuilderFactory]: Interpolants [31400#true, 31401#false, 31402#(= 0 |ldv_malloc_#t~malloc2.offset|), 31403#(= 0 |ldv_malloc_#res.offset|), 31404#(= 0 |entry_point_#t~ret12.offset|), 31405#(= 0 entry_point_~array~0.offset), 31406#(= 0 |alloc_17_#in~array.offset|), 31407#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 31408#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0)), 31409#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 31410#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 31411#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#res.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 31412#(and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.offset 0)), 31413#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 31414#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (- (* (- 4) alloc_17_~i~0))))), 31415#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (- (+ (* (- 4) alloc_17_~i~0) 4)))) (= alloc_17_~array.offset 0)), 31416#(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))))), 31417#(= 0 |alloc_17_#t~mem7.offset|)] [2018-02-02 20:39:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 20:39:20,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:39:20,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:39:20,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:20,335 INFO L87 Difference]: Start difference. First operand 429 states and 507 transitions. Second operand 18 states. [2018-02-02 20:39:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:20,742 INFO L93 Difference]: Finished difference Result 445 states and 526 transitions. [2018-02-02 20:39:20,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:39:20,742 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-02 20:39:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:20,744 INFO L225 Difference]: With dead ends: 445 [2018-02-02 20:39:20,744 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 20:39:20,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:39:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 20:39:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 433. [2018-02-02 20:39:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-02 20:39:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 513 transitions. [2018-02-02 20:39:20,749 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 513 transitions. Word has length 78 [2018-02-02 20:39:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:20,749 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 513 transitions. [2018-02-02 20:39:20,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:39:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 513 transitions. [2018-02-02 20:39:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:39:20,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:20,750 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1] [2018-02-02 20:39:20,750 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1552577, now seen corresponding path program 3 times [2018-02-02 20:39:20,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:20,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:39:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 20:39:21,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:21,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:39:21,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:21,164 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:39:21,164 INFO L182 omatonBuilderFactory]: Interpolants [32352#(= 1 (select |#valid| |alloc_17_#t~mem7.base|)), 32332#true, 32333#false, 32334#(= 0 |ldv_malloc_#t~malloc2.offset|), 32335#(= 0 |ldv_malloc_#res.offset|), 32336#(= 0 |entry_point_#t~ret12.offset|), 32337#(= entry_point_~array~0.offset 0), 32338#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 32339#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 3)) (= entry_point_~array~0.offset 0)), 32340#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 4)) (= entry_point_~array~0.offset 0)), 32341#(= 0 |alloc_17_#in~array.offset|), 32342#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 32343#(= alloc_17_~array.offset 0), 32344#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 32345#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 32346#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))), 32347#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 32348#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 32349#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 32350#(= |#valid| |old(#valid)|), 32351#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))] [2018-02-02 20:39:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 20:39:21,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:39:21,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:39:21,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:39:21,165 INFO L87 Difference]: Start difference. First operand 433 states and 513 transitions. Second operand 21 states. [2018-02-02 20:39:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:21,606 INFO L93 Difference]: Finished difference Result 435 states and 511 transitions. [2018-02-02 20:39:21,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:39:21,606 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-02 20:39:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:21,607 INFO L225 Difference]: With dead ends: 435 [2018-02-02 20:39:21,607 INFO L226 Difference]: Without dead ends: 435 [2018-02-02 20:39:21,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:39:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-02 20:39:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 433. [2018-02-02 20:39:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-02 20:39:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 511 transitions. [2018-02-02 20:39:21,611 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 511 transitions. Word has length 82 [2018-02-02 20:39:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:21,611 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 511 transitions. [2018-02-02 20:39:21,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:39:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 511 transitions. [2018-02-02 20:39:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 20:39:21,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:21,612 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:21,612 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:21,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1884049311, now seen corresponding path program 5 times [2018-02-02 20:39:21,613 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:21,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:21,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:21,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:39:21,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:21,735 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:39:21,735 INFO L182 omatonBuilderFactory]: Interpolants [33256#true, 33257#false, 33258#(= 0 |ldv_malloc_#t~malloc2.offset|), 33259#(= 0 |ldv_malloc_#res.offset|), 33260#(= 0 |entry_point_#t~ret12.offset|), 33261#(= 0 entry_point_~array~0.offset), 33262#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 33263#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 33264#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 33265#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 33266#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 3)), 33267#(and (<= |free_17_#in~len| 3) (= 0 |free_17_#in~array.offset|)), 33268#(and (<= free_17_~len 3) (= free_17_~array.offset 0)), 33269#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 33270#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= free_17_~array.offset 0)), 33271#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4)) (= free_17_~array.offset 0)), 33272#(<= free_17_~len (+ free_17_~i~1 1)), 33273#(<= free_17_~len free_17_~i~1)] [2018-02-02 20:39:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:21,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:39:21,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:39:21,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:21,736 INFO L87 Difference]: Start difference. First operand 433 states and 511 transitions. Second operand 18 states. [2018-02-02 20:39:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:21,879 INFO L93 Difference]: Finished difference Result 552 states and 650 transitions. [2018-02-02 20:39:21,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:39:21,879 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-02 20:39:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:21,880 INFO L225 Difference]: With dead ends: 552 [2018-02-02 20:39:21,880 INFO L226 Difference]: Without dead ends: 552 [2018-02-02 20:39:21,881 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:39:21,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-02-02 20:39:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 532. [2018-02-02 20:39:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-02-02 20:39:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 640 transitions. [2018-02-02 20:39:21,885 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 640 transitions. Word has length 77 [2018-02-02 20:39:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:21,886 INFO L432 AbstractCegarLoop]: Abstraction has 532 states and 640 transitions. [2018-02-02 20:39:21,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:39:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 640 transitions. [2018-02-02 20:39:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:39:21,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:21,886 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:21,886 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 221183158, now seen corresponding path program 6 times [2018-02-02 20:39:21,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:21,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:22,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:22,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:39:22,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:22,186 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:39:22,186 INFO L182 omatonBuilderFactory]: Interpolants [34373#true, 34374#false, 34375#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 34376#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 34377#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 34378#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 34379#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 34380#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 34381#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 34382#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 34383#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (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 (+ (- entry_point_~array~0.offset) 8)))))), 34384#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8))))) (= entry_point_~array~0.offset 0)), 34385#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 34386#(and (= 0 |free_17_#in~array.offset|) (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8)))), 34387#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) 8)))), 34388#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 34389#(not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))), 34390#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 34391#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:39:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:22,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:39:22,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:39:22,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:39:22,187 INFO L87 Difference]: Start difference. First operand 532 states and 640 transitions. Second operand 19 states. [2018-02-02 20:39:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:22,742 INFO L93 Difference]: Finished difference Result 550 states and 656 transitions. [2018-02-02 20:39:22,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:39:22,742 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2018-02-02 20:39:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:22,744 INFO L225 Difference]: With dead ends: 550 [2018-02-02 20:39:22,744 INFO L226 Difference]: Without dead ends: 550 [2018-02-02 20:39:22,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1235, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:39:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-02-02 20:39:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 537. [2018-02-02 20:39:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-02-02 20:39:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 646 transitions. [2018-02-02 20:39:22,751 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 646 transitions. Word has length 81 [2018-02-02 20:39:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:22,751 INFO L432 AbstractCegarLoop]: Abstraction has 537 states and 646 transitions. [2018-02-02 20:39:22,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:39:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 646 transitions. [2018-02-02 20:39:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:39:22,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:22,752 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:22,752 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:22,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1784798488, now seen corresponding path program 3 times [2018-02-02 20:39:22,753 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:22,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:39:23,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:23,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:39:23,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:23,148 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:39:23,148 INFO L182 omatonBuilderFactory]: Interpolants [35520#(= 0 |ldv_malloc_#t~malloc2.offset|), 35521#(= 0 |ldv_malloc_#res.offset|), 35522#(= 0 |entry_point_#t~ret12.offset|), 35523#(= entry_point_~array~0.offset 0), 35524#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 35525#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 35526#(= 0 |alloc_17_#in~array.offset|), 35527#(= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0), 35528#(and (= (select |#valid| alloc_17_~array.base) 1) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)), 35529#(= (select |#valid| alloc_17_~array.base) 1), 35530#(= |#valid| |old(#valid)|), 35531#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 35532#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 35533#(not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)), 35534#(not (= alloc_17_~array.base alloc_17_~p~0.base)), 35535#(and (= 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)))))), 35536#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4)))))) (= 1 (select |#valid| alloc_17_~array.base))), 35537#(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))), 35538#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 35518#true, 35519#false] [2018-02-02 20:39:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:39:23,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:39:23,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:39:23,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:39:23,149 INFO L87 Difference]: Start difference. First operand 537 states and 646 transitions. Second operand 21 states. [2018-02-02 20:39:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:23,553 INFO L93 Difference]: Finished difference Result 543 states and 650 transitions. [2018-02-02 20:39:23,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:39:23,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-02-02 20:39:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:23,554 INFO L225 Difference]: With dead ends: 543 [2018-02-02 20:39:23,554 INFO L226 Difference]: Without dead ends: 543 [2018-02-02 20:39:23,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:39:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-02 20:39:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2018-02-02 20:39:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-02-02 20:39:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 650 transitions. [2018-02-02 20:39:23,559 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 650 transitions. Word has length 80 [2018-02-02 20:39:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:23,559 INFO L432 AbstractCegarLoop]: Abstraction has 541 states and 650 transitions. [2018-02-02 20:39:23,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:39:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 650 transitions. [2018-02-02 20:39:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:39:23,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:23,560 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:23,560 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1904855336, now seen corresponding path program 3 times [2018-02-02 20:39:23,560 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:23,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:23,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:23,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:23,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:23,890 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:39:23,890 INFO L182 omatonBuilderFactory]: Interpolants [36672#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= free_17_~i~1 2) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))))), 36673#(or (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 8))) (* 4 free_17_~i~1))) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 36674#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 8))) (* 4 free_17_~i~1))) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 36675#(= 1 (select |#valid| entry_point_~array~0.base)), 36658#true, 36659#false, 36660#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 36661#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 36662#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 36663#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 36664#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 36665#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 36666#(and (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (not (= entry_point_~array~0.base 0)) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 36667#(and (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 36668#(and (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 8) entry_point_~array~0.offset))))), 36669#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 36670#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 36671#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (<= free_17_~i~1 1))))] [2018-02-02 20:39:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:23,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:39:23,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:39:23,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:23,890 INFO L87 Difference]: Start difference. First operand 541 states and 650 transitions. Second operand 18 states. [2018-02-02 20:39:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:24,620 INFO L93 Difference]: Finished difference Result 643 states and 783 transitions. [2018-02-02 20:39:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:39:24,620 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2018-02-02 20:39:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:24,621 INFO L225 Difference]: With dead ends: 643 [2018-02-02 20:39:24,622 INFO L226 Difference]: Without dead ends: 643 [2018-02-02 20:39:24,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:39:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-02-02 20:39:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 544. [2018-02-02 20:39:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-02-02 20:39:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 653 transitions. [2018-02-02 20:39:24,628 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 653 transitions. Word has length 79 [2018-02-02 20:39:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:24,628 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 653 transitions. [2018-02-02 20:39:24,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:39:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 653 transitions. [2018-02-02 20:39:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:39:24,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:24,629 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:24,629 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1733256636, now seen corresponding path program 4 times [2018-02-02 20:39:24,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:24,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:24,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:24,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:39:24,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:24,873 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:39:24,873 INFO L182 omatonBuilderFactory]: Interpolants [37920#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 37921#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 12))), 37922#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 37923#(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)), 37924#(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)), 37925#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0)), 37926#(= 0 |free_17_#t~mem10.offset|), 37908#true, 37909#false, 37910#(= 0 |ldv_malloc_#t~malloc2.offset|), 37911#(= 0 |ldv_malloc_#res.offset|), 37912#(= 0 |entry_point_#t~ret12.offset|), 37913#(= entry_point_~array~0.offset 0), 37914#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 37915#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 37916#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 37917#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 37918#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 37919#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0))] [2018-02-02 20:39:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:24,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:39:24,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:39:24,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:39:24,873 INFO L87 Difference]: Start difference. First operand 544 states and 653 transitions. Second operand 19 states. [2018-02-02 20:39:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:25,367 INFO L93 Difference]: Finished difference Result 566 states and 672 transitions. [2018-02-02 20:39:25,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:39:25,368 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-02-02 20:39:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:25,369 INFO L225 Difference]: With dead ends: 566 [2018-02-02 20:39:25,369 INFO L226 Difference]: Without dead ends: 566 [2018-02-02 20:39:25,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:39:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-02-02 20:39:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 545. [2018-02-02 20:39:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-02-02 20:39:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 655 transitions. [2018-02-02 20:39:25,376 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 655 transitions. Word has length 82 [2018-02-02 20:39:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:25,376 INFO L432 AbstractCegarLoop]: Abstraction has 545 states and 655 transitions. [2018-02-02 20:39:25,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:39:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 655 transitions. [2018-02-02 20:39:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:39:25,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:25,377 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:25,377 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:25,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1733256635, now seen corresponding path program 4 times [2018-02-02 20:39:25,378 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:25,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:25,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:25,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:39:25,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:25,615 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:39:25,615 INFO L182 omatonBuilderFactory]: Interpolants [39073#true, 39074#false, 39075#(= 0 |ldv_malloc_#t~malloc2.offset|), 39076#(= 0 |ldv_malloc_#res.offset|), 39077#(= 0 |entry_point_#t~ret12.offset|), 39078#(= entry_point_~array~0.offset 0), 39079#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 39080#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 39081#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 39082#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 39083#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 39084#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset)))), 39085#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 39086#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 39087#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 39088#(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))))), 39089#(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)), 39090#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0)), 39091#(= 0 |free_17_#t~mem10.base|)] [2018-02-02 20:39:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:25,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:39:25,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:39:25,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:39:25,616 INFO L87 Difference]: Start difference. First operand 545 states and 655 transitions. Second operand 19 states. [2018-02-02 20:39:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:26,068 INFO L93 Difference]: Finished difference Result 565 states and 671 transitions. [2018-02-02 20:39:26,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:39:26,068 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-02-02 20:39:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:26,069 INFO L225 Difference]: With dead ends: 565 [2018-02-02 20:39:26,069 INFO L226 Difference]: Without dead ends: 565 [2018-02-02 20:39:26,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:39:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-02-02 20:39:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 545. [2018-02-02 20:39:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-02-02 20:39:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 654 transitions. [2018-02-02 20:39:26,074 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 654 transitions. Word has length 82 [2018-02-02 20:39:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:26,074 INFO L432 AbstractCegarLoop]: Abstraction has 545 states and 654 transitions. [2018-02-02 20:39:26,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:39:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 654 transitions. [2018-02-02 20:39:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:39:26,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:26,074 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:26,074 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:26,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1362138814, now seen corresponding path program 2 times [2018-02-02 20:39:26,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:26,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-02 20:39:26,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:26,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:39:26,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:39:26,117 INFO L182 omatonBuilderFactory]: Interpolants [40227#true, 40228#false, 40229#(= entry_point_~i~2 0), 40230#(<= entry_point_~i~2 1), 40231#(<= entry_point_~i~2 2), 40232#(<= entry_point_~len~0 2), 40233#(<= |alloc_17_#in~len| 2), 40234#(<= alloc_17_~len 2), 40235#(<= alloc_17_~i~0 1), 40236#(<= alloc_17_~j~0 0), 40237#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-02 20:39:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-02 20:39:26,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:39:26,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:39:26,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:39:26,117 INFO L87 Difference]: Start difference. First operand 545 states and 654 transitions. Second operand 11 states. [2018-02-02 20:39:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:26,197 INFO L93 Difference]: Finished difference Result 541 states and 644 transitions. [2018-02-02 20:39:26,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:39:26,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-02-02 20:39:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:26,198 INFO L225 Difference]: With dead ends: 541 [2018-02-02 20:39:26,198 INFO L226 Difference]: Without dead ends: 541 [2018-02-02 20:39:26,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-02 20:39:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 525. [2018-02-02 20:39:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-02-02 20:39:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 628 transitions. [2018-02-02 20:39:26,205 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 628 transitions. Word has length 81 [2018-02-02 20:39:26,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:26,205 INFO L432 AbstractCegarLoop]: Abstraction has 525 states and 628 transitions. [2018-02-02 20:39:26,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:39:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 628 transitions. [2018-02-02 20:39:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:39:26,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:26,206 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:26,206 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 60644510, now seen corresponding path program 1 times [2018-02-02 20:39:26,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:26,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:26,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:26,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:39:26,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:26,407 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:39:26,407 INFO L182 omatonBuilderFactory]: Interpolants [41318#true, 41319#false, 41320#(= 0 |ldv_malloc_#t~malloc2.offset|), 41321#(= 0 |ldv_malloc_#res.offset|), 41322#(= 0 |entry_point_#t~ret12.offset|), 41323#(= 0 entry_point_~array~0.offset), 41324#(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))), 41325#(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|))), 41326#(and (or (and (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (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))), 41327#(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)))), 41328#(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)))), 41329#(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)))), 41330#(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)), 41331#(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|))), 41332#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select |#valid| free_17_~array.base))), 41333#(and (= 1 (select |#valid| free_17_~array.base)) (= 0 |free_17_#t~mem10.base|)), 41334#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:39:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:26,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:39:26,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:39:26,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:39:26,408 INFO L87 Difference]: Start difference. First operand 525 states and 628 transitions. Second operand 17 states. [2018-02-02 20:39:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:26,650 INFO L93 Difference]: Finished difference Result 531 states and 628 transitions. [2018-02-02 20:39:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:39:26,650 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-02-02 20:39:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:26,651 INFO L225 Difference]: With dead ends: 531 [2018-02-02 20:39:26,651 INFO L226 Difference]: Without dead ends: 531 [2018-02-02 20:39:26,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:39:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-02 20:39:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 526. [2018-02-02 20:39:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-02-02 20:39:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 625 transitions. [2018-02-02 20:39:26,656 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 625 transitions. Word has length 81 [2018-02-02 20:39:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:26,656 INFO L432 AbstractCegarLoop]: Abstraction has 526 states and 625 transitions. [2018-02-02 20:39:26,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:39:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 625 transitions. [2018-02-02 20:39:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:39:26,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:26,657 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:26,657 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:26,657 INFO L82 PathProgramCache]: Analyzing trace with hash 60644511, now seen corresponding path program 1 times [2018-02-02 20:39:26,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:26,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:39:26,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:26,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:39:26,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:26,903 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:39:26,903 INFO L182 omatonBuilderFactory]: Interpolants [42408#true, 42409#false, 42410#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 42411#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 42412#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 42413#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 42414#(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)), 42415#(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)), 42416#(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)), 42417#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 42418#(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|)), 42419#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 42420#(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|))))), 42421#(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|)), 42422#(= |old(#length)| |#length|), 42423#(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|))), 42424#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 42425#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 42426#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 42427#(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)), 42428#(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)), 42429#(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:39:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:39:26,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:39:26,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:39:26,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:39:26,904 INFO L87 Difference]: Start difference. First operand 526 states and 625 transitions. Second operand 22 states. [2018-02-02 20:39:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:27,426 INFO L93 Difference]: Finished difference Result 624 states and 729 transitions. [2018-02-02 20:39:27,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:39:27,426 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2018-02-02 20:39:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:27,427 INFO L225 Difference]: With dead ends: 624 [2018-02-02 20:39:27,428 INFO L226 Difference]: Without dead ends: 624 [2018-02-02 20:39:27,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:39:27,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-02-02 20:39:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 609. [2018-02-02 20:39:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-02-02 20:39:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 720 transitions. [2018-02-02 20:39:27,435 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 720 transitions. Word has length 81 [2018-02-02 20:39:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:27,435 INFO L432 AbstractCegarLoop]: Abstraction has 609 states and 720 transitions. [2018-02-02 20:39:27,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:39:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 720 transitions. [2018-02-02 20:39:27,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:39:27,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:27,436 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:27,436 INFO L371 AbstractCegarLoop]: === Iteration 72 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:27,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1473043869, now seen corresponding path program 2 times [2018-02-02 20:39:27,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:27,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:39:27,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:27,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:39:27,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:39:27,526 INFO L182 omatonBuilderFactory]: Interpolants [43693#true, 43694#false, 43695#(= 0 |ldv_malloc_#t~malloc2.offset|), 43696#(= 0 |ldv_malloc_#res.offset|), 43697#(= 0 |entry_point_#t~ret12.offset|), 43698#(= entry_point_~array~0.offset 0), 43699#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 43700#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 43701#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 43702#(and (= entry_point_~array~0.offset 0) (<= 12 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 43703#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 43704#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 43705#(and (<= alloc_17_~i~0 2) (= alloc_17_~len |alloc_17_#in~len|)), 43706#(<= |alloc_17_#in~len| 2)] [2018-02-02 20:39:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:39:27,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:39:27,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:39:27,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:39:27,526 INFO L87 Difference]: Start difference. First operand 609 states and 720 transitions. Second operand 14 states. [2018-02-02 20:39:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:27,655 INFO L93 Difference]: Finished difference Result 578 states and 674 transitions. [2018-02-02 20:39:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:39:27,676 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-02-02 20:39:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:27,678 INFO L225 Difference]: With dead ends: 578 [2018-02-02 20:39:27,678 INFO L226 Difference]: Without dead ends: 575 [2018-02-02 20:39:27,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:39:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-02 20:39:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 560. [2018-02-02 20:39:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-02-02 20:39:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 659 transitions. [2018-02-02 20:39:27,684 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 659 transitions. Word has length 81 [2018-02-02 20:39:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:27,684 INFO L432 AbstractCegarLoop]: Abstraction has 560 states and 659 transitions. [2018-02-02 20:39:27,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:39:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 659 transitions. [2018-02-02 20:39:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:39:27,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:27,684 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:27,684 INFO L371 AbstractCegarLoop]: === Iteration 73 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1879979869, now seen corresponding path program 1 times [2018-02-02 20:39:27,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:27,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:39:28,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:28,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:39:28,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:39:28,378 INFO L182 omatonBuilderFactory]: Interpolants [44864#(and (or (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)))) (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~i~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))), 44865#(and (or (and (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#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))), 44866#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= (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)) (or (<= 1 (+ (* 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)) (not (= 4 (@diff (select |old(#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)))), 44867#(and (or (and (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= (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)) (or (<= 1 (+ (* 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)) (not (= 4 (@diff (select |old(#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))), 44868#(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|)) (<= 1 alloc_17_~j~0) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (not (= 4 (@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|)))) (<= 1 alloc_17_~j~0) (= (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|)))))) (= (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|)))), 44869#(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 (<= 0 alloc_17_~j~0) (not (= 4 (@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|) (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|)) (<= 0 alloc_17_~j~0) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))))), 44870#(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|)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (not (= 4 (@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|) (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|)))))))), 44871#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 44872#(and (= free_17_~array.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0)) (<= (+ free_17_~i~1 1) 0))), 44873#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 44874#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0)), 44875#(= 0 |free_17_#t~mem10.base|), 44851#true, 44852#false, 44853#(= 0 |ldv_malloc_#t~malloc2.offset|), 44854#(= 0 |ldv_malloc_#res.offset|), 44855#(= 0 |entry_point_#t~ret12.offset|), 44856#(= 0 entry_point_~array~0.offset), 44857#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 44858#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 44859#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 44860#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 4) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 44861#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 44862#(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))), 44863#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |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:39:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:39:28,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:39:28,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:39:28,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:39:28,379 INFO L87 Difference]: Start difference. First operand 560 states and 659 transitions. Second operand 25 states. [2018-02-02 20:39:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:29,182 INFO L93 Difference]: Finished difference Result 569 states and 662 transitions. [2018-02-02 20:39:29,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:39:29,182 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 82 [2018-02-02 20:39:29,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:29,183 INFO L225 Difference]: With dead ends: 569 [2018-02-02 20:39:29,183 INFO L226 Difference]: Without dead ends: 569 [2018-02-02 20:39:29,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:39:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-02-02 20:39:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 539. [2018-02-02 20:39:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-02-02 20:39:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 635 transitions. [2018-02-02 20:39:29,188 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 635 transitions. Word has length 82 [2018-02-02 20:39:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:29,188 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 635 transitions. [2018-02-02 20:39:29,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:39:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 635 transitions. [2018-02-02 20:39:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:39:29,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:29,188 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:29,188 INFO L371 AbstractCegarLoop]: === Iteration 74 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1857638704, now seen corresponding path program 4 times [2018-02-02 20:39:29,189 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:29,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:30,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:30,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:39:30,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:30,372 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:39:30,373 INFO L182 omatonBuilderFactory]: Interpolants [46016#true, 46017#false, 46018#(= |#valid| |old(#valid)|), 46019#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 46020#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 46021#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret12.base| (select |#valid| |entry_point_#t~ret12.base|))) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0)), 46022#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46023#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 46024#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 46025#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 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) 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46026#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46027#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= entry_point_~i~2 2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (or (= 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 1))), 46028#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= (* 4 entry_point_~i~2) 8) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (* 4 entry_point_~i~2) 7)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46029#(and (or (<= (* 4 entry_point_~i~2) 11) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (<= (* 4 entry_point_~i~2) 12) (or (<= (* 4 entry_point_~i~2) 11) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) (- 4)))) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46030#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= entry_point_~len~0 2)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset))) (<= (* 4 entry_point_~len~0) 11)) (<= (* 4 entry_point_~len~0) 12) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46031#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 46032#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~len |free_17_#in~len|)), 46033#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~len |free_17_#in~len|)), 46034#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= free_17_~array.offset 0)) (and (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= free_17_~array.base |free_17_#in~array.base|) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))))) (= free_17_~len |free_17_#in~len|)), 46035#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (< 3 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= 5 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~len |free_17_#in~len|)), 46036#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (< 3 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= 5 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~len |free_17_#in~len|)), 46037#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))))) (not (= free_17_~array.offset 0)) (<= 5 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~len |free_17_#in~len|)), 46038#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (<= 9 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|)) (and (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))))) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~len |free_17_#in~len|)), 46039#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|)) (<= 13 (+ free_17_~array.offset (* 4 free_17_~len))) (and (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))))) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ free_17_~i~1 1) free_17_~len))) (= free_17_~len |free_17_#in~len|)), 46040#(and (or (and (or (<= 13 (* 4 free_17_~len)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1))))) (or (<= 13 (* 4 free_17_~len)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= |#valid| |old(#valid)|)) (<= 12 (* 4 free_17_~len))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))) (= free_17_~len |free_17_#in~len|)), 46041#(and (or (= |#valid| |old(#valid)|) (and (or (<= 13 (* 4 free_17_~len)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4)))))) (<= 12 (* 4 free_17_~len))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1))))) (<= 12 (* 4 free_17_~len)))) (= free_17_~len |free_17_#in~len|)), 46042#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (<= 12 (* 4 |free_17_#in~len|))) (= |#valid| |old(#valid)|) (and (<= 12 (* 4 |free_17_#in~len|)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* 4 (- |free_17_#in~len|)) 4)))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (<= 4 |free_17_#in~len|))] [2018-02-02 20:39:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:30,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:39:30,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:39:30,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:39:30,373 INFO L87 Difference]: Start difference. First operand 539 states and 635 transitions. Second operand 27 states. [2018-02-02 20:39:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:31,330 INFO L93 Difference]: Finished difference Result 586 states and 684 transitions. [2018-02-02 20:39:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:39:31,331 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-02-02 20:39:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:31,332 INFO L225 Difference]: With dead ends: 586 [2018-02-02 20:39:31,332 INFO L226 Difference]: Without dead ends: 557 [2018-02-02 20:39:31,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=210, Invalid=1350, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:39:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-02 20:39:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 514. [2018-02-02 20:39:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-02-02 20:39:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 609 transitions. [2018-02-02 20:39:31,336 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 609 transitions. Word has length 82 [2018-02-02 20:39:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:31,336 INFO L432 AbstractCegarLoop]: Abstraction has 514 states and 609 transitions. [2018-02-02 20:39:31,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:39:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 609 transitions. [2018-02-02 20:39:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:39:31,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:31,336 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:31,336 INFO L371 AbstractCegarLoop]: === Iteration 75 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash 502230069, now seen corresponding path program 4 times [2018-02-02 20:39:31,337 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:31,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:39:31,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:31,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:31,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:39:31,503 INFO L182 omatonBuilderFactory]: Interpolants [47169#true, 47170#false, 47171#(= 0 |ldv_malloc_#t~malloc2.offset|), 47172#(= 0 |ldv_malloc_#res.offset|), 47173#(= 0 |entry_point_#t~ret12.offset|), 47174#(= 0 entry_point_~array~0.offset), 47175#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 47176#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 47177#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 47178#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 47179#(and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 47180#(and (or (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 47181#(and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 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))), 47182#(and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 8 (+ (* 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))), 47183#(and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 12 (+ (* 4 alloc_17_~len) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 47184#(and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= |alloc_17_#in~array.offset| 0)) (<= 3 alloc_17_~len))), 47185#(or (<= 3 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)))] [2018-02-02 20:39:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:39:31,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:39:31,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:39:31,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:39:31,504 INFO L87 Difference]: Start difference. First operand 514 states and 609 transitions. Second operand 17 states. [2018-02-02 20:39:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:31,638 INFO L93 Difference]: Finished difference Result 463 states and 544 transitions. [2018-02-02 20:39:31,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:39:31,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-02-02 20:39:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:31,639 INFO L225 Difference]: With dead ends: 463 [2018-02-02 20:39:31,639 INFO L226 Difference]: Without dead ends: 422 [2018-02-02 20:39:31,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:39:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-02 20:39:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 416. [2018-02-02 20:39:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-02-02 20:39:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 494 transitions. [2018-02-02 20:39:31,642 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 494 transitions. Word has length 85 [2018-02-02 20:39:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:31,642 INFO L432 AbstractCegarLoop]: Abstraction has 416 states and 494 transitions. [2018-02-02 20:39:31,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:39:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 494 transitions. [2018-02-02 20:39:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:39:31,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:31,642 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:31,642 INFO L371 AbstractCegarLoop]: === Iteration 76 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:31,643 INFO L82 PathProgramCache]: Analyzing trace with hash -323339655, now seen corresponding path program 5 times [2018-02-02 20:39:31,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:31,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:31,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:31,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:39:31,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:31,744 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:39:31,744 INFO L182 omatonBuilderFactory]: Interpolants [48071#true, 48072#false, 48073#(= 0 |ldv_malloc_#t~malloc2.offset|), 48074#(= 0 |ldv_malloc_#res.offset|), 48075#(= 0 |entry_point_#t~ret12.offset|), 48076#(= entry_point_~array~0.offset 0), 48077#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 48078#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 48079#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 48080#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 48081#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 48082#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 48083#(and (= free_17_~len |free_17_#in~len|) (<= free_17_~i~1 1)), 48084#(and (<= free_17_~i~1 2) (= free_17_~len |free_17_#in~len|)), 48085#(and (<= free_17_~i~1 3) (= free_17_~len |free_17_#in~len|)), 48086#(<= |free_17_#in~len| 3)] [2018-02-02 20:39:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:31,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:39:31,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:39:31,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:39:31,744 INFO L87 Difference]: Start difference. First operand 416 states and 494 transitions. Second operand 16 states. [2018-02-02 20:39:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:31,868 INFO L93 Difference]: Finished difference Result 522 states and 618 transitions. [2018-02-02 20:39:31,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:39:31,868 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-02-02 20:39:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:31,869 INFO L225 Difference]: With dead ends: 522 [2018-02-02 20:39:31,869 INFO L226 Difference]: Without dead ends: 504 [2018-02-02 20:39:31,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:39:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-02-02 20:39:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 456. [2018-02-02 20:39:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-02-02 20:39:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 552 transitions. [2018-02-02 20:39:31,873 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 552 transitions. Word has length 86 [2018-02-02 20:39:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:31,873 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 552 transitions. [2018-02-02 20:39:31,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:39:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 552 transitions. [2018-02-02 20:39:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:39:31,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:31,873 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:31,873 INFO L371 AbstractCegarLoop]: === Iteration 77 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1735840101, now seen corresponding path program 2 times [2018-02-02 20:39:31,874 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:31,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:32,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:32,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:39:32,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:32,433 INFO L182 omatonBuilderFactory]: Interpolants [49088#(= |#valid| |old(#valid)|), 49089#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 49090#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 49091#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret4.base|)) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 49092#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (and (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 49093#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (or (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (+ (* (- 4) alloc_17_~len) 4))))))) (<= 9 (* 4 alloc_17_~len))) (<= 8 (* 4 alloc_17_~len))) (not (= |alloc_17_#in~array.offset| 0)))), 49094#(or (and (or (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (+ (* 4 (- |alloc_17_#in~len|)) 4))))) (<= 9 (* 4 |alloc_17_#in~len|))) (<= 8 (* 4 |alloc_17_#in~len|))) (not (= |alloc_17_#in~array.offset| 0))), 49095#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))))), 49096#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 49097#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 49098#(and (or (not (= free_17_~array.offset 0)) (<= free_17_~i~1 1)) (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|)), 49099#(or (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4))))) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 49100#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4))))) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 49101#(= 1 (select |#valid| entry_point_~array~0.base)), 49074#true, 49075#false, 49076#(= 0 |ldv_malloc_#t~malloc2.offset|), 49077#(= 0 |ldv_malloc_#res.offset|), 49078#(= 0 |entry_point_#t~ret12.offset|), 49079#(= entry_point_~array~0.offset 0), 49080#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 49081#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 49082#(and (or (= 8 (* 4 entry_point_~i~2)) (<= (* 4 entry_point_~i~2) 7)) (= entry_point_~array~0.offset 0)), 49083#(and (= entry_point_~array~0.offset 0) (or (= 8 (* 4 entry_point_~len~0)) (<= (* 4 entry_point_~len~0) 7))), 49084#(and (= alloc_17_~len |alloc_17_#in~len|) (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))), 49085#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (or (and (= (select |#valid| alloc_17_~array.base) 1) (= 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))), 49086#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (or (and (= (select |#valid| alloc_17_~array.base) 1) (= 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))), 49087#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (and (= (select |#valid| alloc_17_~array.base) 1) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))] [2018-02-02 20:39:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:32,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:39:32,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:39:32,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:39:32,434 INFO L87 Difference]: Start difference. First operand 456 states and 552 transitions. Second operand 28 states. [2018-02-02 20:39:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:33,432 INFO L93 Difference]: Finished difference Result 489 states and 576 transitions. [2018-02-02 20:39:33,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:39:33,432 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-02-02 20:39:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:33,433 INFO L225 Difference]: With dead ends: 489 [2018-02-02 20:39:33,433 INFO L226 Difference]: Without dead ends: 489 [2018-02-02 20:39:33,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=2512, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:39:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-02-02 20:39:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 461. [2018-02-02 20:39:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-02-02 20:39:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 558 transitions. [2018-02-02 20:39:33,437 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 558 transitions. Word has length 85 [2018-02-02 20:39:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:33,437 INFO L432 AbstractCegarLoop]: Abstraction has 461 states and 558 transitions. [2018-02-02 20:39:33,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:39:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 558 transitions. [2018-02-02 20:39:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:39:33,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:33,438 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:33,438 INFO L371 AbstractCegarLoop]: === Iteration 78 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:33,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1615103595, now seen corresponding path program 1 times [2018-02-02 20:39:33,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:33,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:39:33,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:33,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:33,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:33,798 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:39:33,798 INFO L182 omatonBuilderFactory]: Interpolants [50112#(and (= alloc_17_~array.offset 0) (or (= alloc_17_~i~0 0) (<= (+ alloc_17_~i~0 1) 0))), 50113#(and (= alloc_17_~array.offset 0) (or (and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~i~0 0)) (<= (+ alloc_17_~i~0 1) 0))), 50114#(and (= alloc_17_~array.offset 0) (or (and (= alloc_17_~i~0 0) (= 0 alloc_17_~p~0.offset)) (<= (+ alloc_17_~i~0 1) 0))), 50115#(and (= alloc_17_~array.offset 0) (or (and (= alloc_17_~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (<= (+ alloc_17_~i~0 1) 0))), 50116#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (or (<= alloc_17_~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)))), 50117#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)))), 50118#(and (= alloc_17_~array.offset 0) (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)) (<= alloc_17_~j~0 1)) (<= alloc_17_~j~0 0))), 50119#(and (= alloc_17_~array.offset 0) (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= alloc_17_~j~0 0)), 50120#(and (<= 0 alloc_17_~j~0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (<= alloc_17_~j~0 0)), 50121#(= 0 |alloc_17_#t~mem7.offset|), 50104#true, 50105#false, 50106#(= 0 |ldv_malloc_#t~malloc2.offset|), 50107#(= 0 |ldv_malloc_#res.offset|), 50108#(= 0 |entry_point_#t~ret12.offset|), 50109#(= entry_point_~array~0.offset 0), 50110#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 50111#(= 0 |alloc_17_#in~array.offset|)] [2018-02-02 20:39:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:39:33,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:39:33,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:39:33,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:33,799 INFO L87 Difference]: Start difference. First operand 461 states and 558 transitions. Second operand 18 states. [2018-02-02 20:39:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:34,133 INFO L93 Difference]: Finished difference Result 468 states and 562 transitions. [2018-02-02 20:39:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:39:34,133 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-02-02 20:39:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:34,134 INFO L225 Difference]: With dead ends: 468 [2018-02-02 20:39:34,134 INFO L226 Difference]: Without dead ends: 468 [2018-02-02 20:39:34,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:39:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-02 20:39:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 461. [2018-02-02 20:39:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-02-02 20:39:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 557 transitions. [2018-02-02 20:39:34,140 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 557 transitions. Word has length 89 [2018-02-02 20:39:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:34,140 INFO L432 AbstractCegarLoop]: Abstraction has 461 states and 557 transitions. [2018-02-02 20:39:34,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:39:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 557 transitions. [2018-02-02 20:39:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:39:34,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:34,141 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:34,141 INFO L371 AbstractCegarLoop]: === Iteration 79 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1615103596, now seen corresponding path program 3 times [2018-02-02 20:39:34,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:34,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 20:39:34,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:34,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:39:34,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:34,986 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:39:34,986 INFO L182 omatonBuilderFactory]: Interpolants [51085#true, 51086#false, 51087#(= 0 |ldv_malloc_#t~malloc2.offset|), 51088#(= 0 |ldv_malloc_#res.offset|), 51089#(= 0 |entry_point_#t~ret12.offset|), 51090#(= entry_point_~array~0.offset 0), 51091#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 51092#(and (or (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 2)) (= (+ entry_point_~len~0 3) (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2))) (= entry_point_~array~0.offset 0)), 51093#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 4)) (= entry_point_~array~0.offset 0)), 51094#(= 0 |alloc_17_#in~array.offset|), 51095#(and (= alloc_17_~array.offset 0) (or (= alloc_17_~i~0 0) (<= (+ alloc_17_~i~0 1) 0))), 51096#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 51097#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 51098#(and (= alloc_17_~array.offset 0) (or (and (= alloc_17_~i~0 0) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))) (<= (+ alloc_17_~i~0 1) 0))), 51099#(and (or (and (= alloc_17_~i~0 0) (= 1 (select |#valid| alloc_17_~p~0.base))) (<= (+ alloc_17_~i~0 1) 0)) (= alloc_17_~array.offset 0)), 51100#(and (or (and (= alloc_17_~i~0 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))) (<= (+ alloc_17_~i~0 1) 0)) (= alloc_17_~array.offset 0)), 51101#(and (= alloc_17_~array.offset 0) (or (<= alloc_17_~i~0 0) (and (<= alloc_17_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 51102#(= |#valid| |old(#valid)|), 51103#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 51104#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 51105#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 1) (not (= |alloc_17_#t~ret4.base| 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= alloc_17_~i~0 0))), 51106#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 1) (not (= alloc_17_~p~0.base 0)) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0))) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0)))) (<= alloc_17_~i~0 0))), 51107#(and (= alloc_17_~array.offset 0) (or (<= alloc_17_~i~0 0) (and (<= alloc_17_~i~0 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 51108#(and (= alloc_17_~array.offset 0) (or (<= alloc_17_~i~0 1) (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) 0)) (<= alloc_17_~i~0 2) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 51109#(and (= alloc_17_~array.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))) (<= alloc_17_~j~0 0))), 51110#(and (or (and (<= alloc_17_~j~0 1) (= 1 (select (store |#valid| |alloc_17_#t~mem7.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (= |alloc_17_#t~mem7.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) 0)) (= 1 (select |#valid| |alloc_17_#t~mem7.base|))) (<= alloc_17_~j~0 0)) (= alloc_17_~array.offset 0)), 51111#(and (or (and (<= alloc_17_~j~0 1) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))) (<= alloc_17_~j~0 0)) (= alloc_17_~array.offset 0)), 51112#(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)), 51113#(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)))))), 51114#(= (select |#valid| |alloc_17_#t~mem7.base|) 1)] [2018-02-02 20:39:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 20:39:34,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:39:34,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:39:34,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:39:34,987 INFO L87 Difference]: Start difference. First operand 461 states and 557 transitions. Second operand 30 states. [2018-02-02 20:39:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:35,730 INFO L93 Difference]: Finished difference Result 468 states and 560 transitions. [2018-02-02 20:39:35,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:39:35,731 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2018-02-02 20:39:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:35,732 INFO L225 Difference]: With dead ends: 468 [2018-02-02 20:39:35,732 INFO L226 Difference]: Without dead ends: 468 [2018-02-02 20:39:35,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=393, Invalid=2687, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:39:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-02 20:39:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 461. [2018-02-02 20:39:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-02-02 20:39:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 556 transitions. [2018-02-02 20:39:35,735 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 556 transitions. Word has length 89 [2018-02-02 20:39:35,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:35,735 INFO L432 AbstractCegarLoop]: Abstraction has 461 states and 556 transitions. [2018-02-02 20:39:35,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:39:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 556 transitions. [2018-02-02 20:39:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:39:35,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:35,735 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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, 1] [2018-02-02 20:39:35,735 INFO L371 AbstractCegarLoop]: === Iteration 80 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:35,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1759368180, now seen corresponding path program 7 times [2018-02-02 20:39:35,736 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:35,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:35,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:35,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:39:35,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:35,902 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:39:35,902 INFO L182 omatonBuilderFactory]: Interpolants [52096#true, 52097#false, 52098#(= 0 |ldv_malloc_#t~malloc2.offset|), 52099#(= 0 |ldv_malloc_#res.offset|), 52100#(= 0 |entry_point_#t~ret12.offset|), 52101#(= 0 entry_point_~array~0.offset), 52102#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 52103#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 52104#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 52105#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 52106#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 4)), 52107#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 4)), 52108#(and (<= |free_17_#in~len| 4) (= 0 |free_17_#in~array.offset|)), 52109#(and (<= free_17_~len 4) (= free_17_~array.offset 0)), 52110#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 16)) (= free_17_~array.offset 0)), 52111#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 52112#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= free_17_~array.offset 0)), 52113#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4)) (= free_17_~array.offset 0)), 52114#(<= free_17_~len (+ free_17_~i~1 1)), 52115#(<= free_17_~len free_17_~i~1)] [2018-02-02 20:39:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:35,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:39:35,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:39:35,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:39:35,903 INFO L87 Difference]: Start difference. First operand 461 states and 556 transitions. Second operand 20 states. [2018-02-02 20:39:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:36,062 INFO L93 Difference]: Finished difference Result 649 states and 775 transitions. [2018-02-02 20:39:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:39:36,062 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2018-02-02 20:39:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:36,064 INFO L225 Difference]: With dead ends: 649 [2018-02-02 20:39:36,064 INFO L226 Difference]: Without dead ends: 649 [2018-02-02 20:39:36,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:39:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-02-02 20:39:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 621. [2018-02-02 20:39:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-02-02 20:39:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 761 transitions. [2018-02-02 20:39:36,068 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 761 transitions. Word has length 87 [2018-02-02 20:39:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:36,068 INFO L432 AbstractCegarLoop]: Abstraction has 621 states and 761 transitions. [2018-02-02 20:39:36,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:39:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 761 transitions. [2018-02-02 20:39:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 20:39:36,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:36,069 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:36,069 INFO L371 AbstractCegarLoop]: === Iteration 81 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1631361932, now seen corresponding path program 1 times [2018-02-02 20:39:36,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:36,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-02 20:39:36,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:36,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:39:36,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:36,472 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:39:36,472 INFO L182 omatonBuilderFactory]: Interpolants [53408#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 53409#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 53410#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 53411#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 53412#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 53413#(= |#valid| |old(#valid)|), 53414#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 53415#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 53416#(and (not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 53417#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 53418#(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)))))), 53419#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (+ (div (+ (- alloc_17_~array.offset) 0) 4) 1) alloc_17_~i~0)), 53420#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (<= (+ (div (+ (- alloc_17_~array.offset) 0) 4) 2) alloc_17_~i~0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 53421#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))), 53422#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 1) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 53423#(and (= alloc_17_~array.offset 0) (or (and (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (<= alloc_17_~j~0 0)) (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))))), 53424#(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))), 53425#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 53426#(= 1 (select |#valid| alloc_17_~array.base)), 53405#true, 53406#false, 53407#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|))] [2018-02-02 20:39:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-02 20:39:36,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:39:36,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:39:36,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:39:36,472 INFO L87 Difference]: Start difference. First operand 621 states and 761 transitions. Second operand 22 states. [2018-02-02 20:39:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:37,156 INFO L93 Difference]: Finished difference Result 637 states and 778 transitions. [2018-02-02 20:39:37,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:39:37,156 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 91 [2018-02-02 20:39:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:37,157 INFO L225 Difference]: With dead ends: 637 [2018-02-02 20:39:37,157 INFO L226 Difference]: Without dead ends: 637 [2018-02-02 20:39:37,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:39:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-02-02 20:39:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 628. [2018-02-02 20:39:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-02-02 20:39:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 769 transitions. [2018-02-02 20:39:37,162 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 769 transitions. Word has length 91 [2018-02-02 20:39:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:37,162 INFO L432 AbstractCegarLoop]: Abstraction has 628 states and 769 transitions. [2018-02-02 20:39:37,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:39:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 769 transitions. [2018-02-02 20:39:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:39:37,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:37,163 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1] [2018-02-02 20:39:37,163 INFO L371 AbstractCegarLoop]: === Iteration 82 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1464249349, now seen corresponding path program 4 times [2018-02-02 20:39:37,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:37,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:37,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:37,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:39:37,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:37,501 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:39:37,501 INFO L182 omatonBuilderFactory]: Interpolants [54724#true, 54725#false, 54726#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 54727#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 54728#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 54729#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 54730#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 54731#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 54732#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 54733#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 54734#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))), 54735#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset))))), 54736#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 54737#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 54738#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 4)) (not (= free_17_~array.offset 0)))), 54739#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 8) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= free_17_~array.offset 0)))), 54740#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 12)))), 54741#(or (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 12))) (* 4 free_17_~i~1))) |free_17_#in~array.base|)), 54742#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 12))) (* 4 free_17_~i~1))) |free_17_#in~array.base|)), 54743#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 20:39:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:39:37,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:39:37,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:39:37,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:39:37,502 INFO L87 Difference]: Start difference. First operand 628 states and 769 transitions. Second operand 20 states. [2018-02-02 20:39:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:38,409 INFO L93 Difference]: Finished difference Result 715 states and 874 transitions. [2018-02-02 20:39:38,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:39:38,409 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-02-02 20:39:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:38,411 INFO L225 Difference]: With dead ends: 715 [2018-02-02 20:39:38,411 INFO L226 Difference]: Without dead ends: 715 [2018-02-02 20:39:38,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1869, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:39:38,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-02-02 20:39:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 634. [2018-02-02 20:39:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-02-02 20:39:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 776 transitions. [2018-02-02 20:39:38,418 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 776 transitions. Word has length 89 [2018-02-02 20:39:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:38,419 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 776 transitions. [2018-02-02 20:39:38,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:39:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 776 transitions. [2018-02-02 20:39:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:39:38,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:38,419 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:38,419 INFO L371 AbstractCegarLoop]: === Iteration 83 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:38,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1006133619, now seen corresponding path program 2 times [2018-02-02 20:39:38,420 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:38,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:39:40,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:40,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:39:40,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:39:40,223 INFO L182 omatonBuilderFactory]: Interpolants [56146#true, 56147#false, 56148#(= |#valid| |old(#valid)|), 56149#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 56150#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56151#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56152#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56153#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= entry_point_~i~2 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56154#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= 1 entry_point_~i~2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56155#(and (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56156#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 56157#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56158#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= |alloc_17_#t~ret4.base| 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= (select |old(#valid)| |alloc_17_#t~ret4.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= alloc_17_~array.offset 0)))), 56159#(and (or (and (not (= alloc_17_~p~0.base 0)) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56160#(and (or (and (= (select |#valid| alloc_17_~array.base) 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56161#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56162#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 56163#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 56164#(and (or (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret4.base|)) (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (not (= |alloc_17_#t~ret4.base| 0)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) |alloc_17_#t~ret4.base| (select |#valid| |alloc_17_#t~ret4.base|))) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (select |old(#valid)| |alloc_17_#t~ret4.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56165#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (not (= alloc_17_~p~0.base 0)) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0) 0)) (= |#valid| (store (store |old(#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) (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))) alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (= (select |old(#valid)| alloc_17_~p~0.base) 0) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0))) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 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))), 56166#(or (not (= |alloc_17_#in~array.offset| 0)) (and (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4)))))) 0) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4)))) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))) 0)))), 56167#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0)) (= |#valid| (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) 0))), 56168#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 56169#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0) (= (store |#valid| |free_17_#t~mem10.base| 0) (store |old(#valid)| |free_17_#t~mem10.base| (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#t~mem10.base|))) (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) |free_17_#t~mem10.base|)))), 56170#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) |#valid|)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 56171#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (<= free_17_~i~1 1) (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (and (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) |#valid|) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)))))))), 56172#(or (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4)))))) (or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4)))))) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= (store |#valid| |free_17_#t~mem10.base| 0) (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (store |#valid| |free_17_#t~mem10.base| 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) |free_17_#t~mem10.base| (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#t~mem10.base|)))))) (not (= |free_17_#in~array.offset| 0))), 56173#(or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4)))))) (and (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4) (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4))))))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)))) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4)))))) (not (= |free_17_#in~array.offset| 0))), 56174#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (select |old(#valid)| entry_point_~array~0.base) (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (= (store |old(#valid)| entry_point_~array~0.base (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (store |#valid| entry_point_~array~0.base 0)))] [2018-02-02 20:39:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:39:40,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:39:40,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:39:40,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:39:40,224 INFO L87 Difference]: Start difference. First operand 634 states and 776 transitions. Second operand 29 states. [2018-02-02 20:39:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:41,941 INFO L93 Difference]: Finished difference Result 656 states and 787 transitions. [2018-02-02 20:39:41,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:39:41,941 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-02-02 20:39:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:41,943 INFO L225 Difference]: With dead ends: 656 [2018-02-02 20:39:41,943 INFO L226 Difference]: Without dead ends: 641 [2018-02-02 20:39:41,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:39:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-02-02 20:39:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 623. [2018-02-02 20:39:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-02-02 20:39:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 763 transitions. [2018-02-02 20:39:41,949 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 763 transitions. Word has length 88 [2018-02-02 20:39:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:41,949 INFO L432 AbstractCegarLoop]: Abstraction has 623 states and 763 transitions. [2018-02-02 20:39:41,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:39:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 763 transitions. [2018-02-02 20:39:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 20:39:41,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:41,950 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:41,950 INFO L371 AbstractCegarLoop]: === Iteration 84 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1077113850, now seen corresponding path program 5 times [2018-02-02 20:39:41,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:41,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 35 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:39:42,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:42,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:42,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:39:42,075 INFO L182 omatonBuilderFactory]: Interpolants [57476#true, 57477#false, 57478#(= 0 |ldv_malloc_#t~malloc2.offset|), 57479#(= 0 |ldv_malloc_#res.offset|), 57480#(= 0 |entry_point_#t~ret12.offset|), 57481#(= entry_point_~array~0.offset 0), 57482#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 57483#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 57484#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 57485#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 57486#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 57487#(and (= entry_point_~array~0.offset 0) (<= 20 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 57488#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 57489#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 57490#(and (<= alloc_17_~i~0 2) (= alloc_17_~len |alloc_17_#in~len|)), 57491#(and (<= alloc_17_~i~0 3) (= alloc_17_~len |alloc_17_#in~len|)), 57492#(<= |alloc_17_#in~len| 3)] [2018-02-02 20:39:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 35 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:39:42,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:39:42,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:39:42,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:39:42,076 INFO L87 Difference]: Start difference. First operand 623 states and 763 transitions. Second operand 17 states. [2018-02-02 20:39:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:42,271 INFO L93 Difference]: Finished difference Result 673 states and 819 transitions. [2018-02-02 20:39:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:39:42,272 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 97 [2018-02-02 20:39:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:42,273 INFO L225 Difference]: With dead ends: 673 [2018-02-02 20:39:42,273 INFO L226 Difference]: Without dead ends: 673 [2018-02-02 20:39:42,273 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:39:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-02-02 20:39:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 632. [2018-02-02 20:39:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-02-02 20:39:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 774 transitions. [2018-02-02 20:39:42,280 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 774 transitions. Word has length 97 [2018-02-02 20:39:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:42,280 INFO L432 AbstractCegarLoop]: Abstraction has 632 states and 774 transitions. [2018-02-02 20:39:42,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:39:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 774 transitions. [2018-02-02 20:39:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:39:42,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:42,280 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:42,280 INFO L371 AbstractCegarLoop]: === Iteration 85 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:42,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1241190988, now seen corresponding path program 6 times [2018-02-02 20:39:42,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:42,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:39:42,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:42,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:39:42,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:39:42,786 INFO L182 omatonBuilderFactory]: Interpolants [58816#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0)))), 58817#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (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_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0)))), 58818#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (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 (= alloc_17_~len |alloc_17_#in~len|) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))) (not (= alloc_17_~array.offset 0)))), 58819#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 58820#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= 9 (+ (* 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)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 58821#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= 13 (+ (* 4 alloc_17_~len) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 58822#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 13 (+ (* 4 alloc_17_~len) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 58823#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= 0 |alloc_17_#in~array.offset|)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 4 alloc_17_~len))), 58824#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= 0 |alloc_17_#in~array.offset|)) (<= 4 |alloc_17_#in~len|)), 58825#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 58826#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 58827#(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)), 58828#(= 0 |free_17_#t~mem10.offset|), 58804#true, 58805#false, 58806#(= 0 |ldv_malloc_#t~malloc2.offset|), 58807#(= 0 |ldv_malloc_#res.offset|), 58808#(= 0 |entry_point_#t~ret12.offset|), 58809#(= 0 entry_point_~array~0.offset), 58810#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 58811#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 58812#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 58813#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 58814#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 3)), 58815#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0))))] [2018-02-02 20:39:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:39:42,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:39:42,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:39:42,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:39:42,787 INFO L87 Difference]: Start difference. First operand 632 states and 774 transitions. Second operand 25 states. [2018-02-02 20:39:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:43,602 INFO L93 Difference]: Finished difference Result 645 states and 780 transitions. [2018-02-02 20:39:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:39:43,602 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 89 [2018-02-02 20:39:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:43,604 INFO L225 Difference]: With dead ends: 645 [2018-02-02 20:39:43,604 INFO L226 Difference]: Without dead ends: 645 [2018-02-02 20:39:43,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:39:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-02-02 20:39:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 632. [2018-02-02 20:39:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-02-02 20:39:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 772 transitions. [2018-02-02 20:39:43,608 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 772 transitions. Word has length 89 [2018-02-02 20:39:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:43,609 INFO L432 AbstractCegarLoop]: Abstraction has 632 states and 772 transitions. [2018-02-02 20:39:43,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:39:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 772 transitions. [2018-02-02 20:39:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 20:39:43,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:43,609 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:43,609 INFO L371 AbstractCegarLoop]: === Iteration 86 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1660431133, now seen corresponding path program 7 times [2018-02-02 20:39:43,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:43,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:39:43,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:43,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:39:43,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:39:43,708 INFO L182 omatonBuilderFactory]: Interpolants [60140#true, 60141#false, 60142#(= 0 |ldv_malloc_#t~malloc2.offset|), 60143#(= 0 |ldv_malloc_#res.offset|), 60144#(= 0 |entry_point_#t~ret12.offset|), 60145#(= entry_point_~array~0.offset 0), 60146#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 60147#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 60148#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 60149#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 60150#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 60151#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 60152#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 60153#(and (<= alloc_17_~i~0 2) (= alloc_17_~len |alloc_17_#in~len|)), 60154#(and (<= alloc_17_~i~0 3) (= alloc_17_~len |alloc_17_#in~len|)), 60155#(<= |alloc_17_#in~len| 3)] [2018-02-02 20:39:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:39:43,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:39:43,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:39:43,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:39:43,708 INFO L87 Difference]: Start difference. First operand 632 states and 772 transitions. Second operand 16 states. [2018-02-02 20:39:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:43,843 INFO L93 Difference]: Finished difference Result 668 states and 811 transitions. [2018-02-02 20:39:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:39:43,843 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2018-02-02 20:39:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:43,844 INFO L225 Difference]: With dead ends: 668 [2018-02-02 20:39:43,844 INFO L226 Difference]: Without dead ends: 668 [2018-02-02 20:39:43,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:39:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-02-02 20:39:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 632. [2018-02-02 20:39:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-02-02 20:39:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 771 transitions. [2018-02-02 20:39:43,849 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 771 transitions. Word has length 93 [2018-02-02 20:39:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:43,849 INFO L432 AbstractCegarLoop]: Abstraction has 632 states and 771 transitions. [2018-02-02 20:39:43,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:39:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 771 transitions. [2018-02-02 20:39:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:39:43,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:43,850 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:43,850 INFO L371 AbstractCegarLoop]: === Iteration 87 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1241190989, now seen corresponding path program 3 times [2018-02-02 20:39:43,850 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:43,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 62 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:39:44,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:44,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:39:44,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:39:44,575 INFO L182 omatonBuilderFactory]: Interpolants [61462#true, 61463#false, 61464#(= 0 |ldv_malloc_#t~malloc2.offset|), 61465#(= 0 |ldv_malloc_#res.offset|), 61466#(= 0 |entry_point_#t~ret12.offset|), 61467#(= 0 entry_point_~array~0.offset), 61468#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 61469#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 61470#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 61471#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 61472#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 3)), 61473#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0)))), 61474#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 61475#(= (select |#valid| |ldv_malloc_#res.base|) 1), 61476#(and (or (and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 61477#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0)))), 61478#(and (or (and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~len |alloc_17_#in~len|) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 61479#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)) 1)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 61480#(= |#valid| |old(#valid)|), 61481#(and (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 61482#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 61483#(and (or (and (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 61484#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 13 (+ (* 4 alloc_17_~len) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 61485#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 61486#(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|))))), 61487#(and (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 13 (+ (* 4 alloc_17_~len) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 61488#(or (not (= 0 |alloc_17_#in~array.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 4 alloc_17_~len))), 61489#(or (not (= 0 |alloc_17_#in~array.offset|)) (<= 4 |alloc_17_#in~len|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 61490#(and (= 0 entry_point_~array~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 61491#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|)), 61492#(and (or (= 1 (select |#valid| (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)), 61493#(= 1 (select |#valid| |free_17_#t~mem10.base|))] [2018-02-02 20:39:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 62 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:39:44,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:39:44,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:39:44,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:39:44,575 INFO L87 Difference]: Start difference. First operand 632 states and 771 transitions. Second operand 32 states. Received shutdown request... [2018-02-02 20:39:45,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:39:45,381 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:39:45,385 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:39:45,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:39:45 BoogieIcfgContainer [2018-02-02 20:39:45,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:39:45,386 INFO L168 Benchmark]: Toolchain (without parser) took 63047.09 ms. Allocated memory was 400.6 MB in the beginning and 1.3 GB in the end (delta: 943.7 MB). Free memory was 356.9 MB in the beginning and 1.1 GB in the end (delta: -792.8 MB). Peak memory consumption was 150.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:39:45,386 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 400.6 MB. Free memory is still 363.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:39:45,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.63 ms. Allocated memory is still 400.6 MB. Free memory was 356.9 MB in the beginning and 343.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:39:45,387 INFO L168 Benchmark]: Boogie Preprocessor took 32.85 ms. Allocated memory is still 400.6 MB. Free memory was 343.7 MB in the beginning and 342.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:39:45,387 INFO L168 Benchmark]: RCFGBuilder took 281.65 ms. Allocated memory is still 400.6 MB. Free memory was 341.0 MB in the beginning and 315.7 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:39:45,387 INFO L168 Benchmark]: TraceAbstraction took 62555.80 ms. Allocated memory was 400.6 MB in the beginning and 1.3 GB in the end (delta: 943.7 MB). Free memory was 315.7 MB in the beginning and 1.1 GB in the end (delta: -834.1 MB). Peak memory consumption was 109.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:39:45,388 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.09 ms. Allocated memory is still 400.6 MB. Free memory is still 363.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.63 ms. Allocated memory is still 400.6 MB. Free memory was 356.9 MB in the beginning and 343.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 32.85 ms. Allocated memory is still 400.6 MB. Free memory was 343.7 MB in the beginning and 342.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 281.65 ms. Allocated memory is still 400.6 MB. Free memory was 341.0 MB in the beginning and 315.7 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62555.80 ms. Allocated memory was 400.6 MB in the beginning and 1.3 GB in the end (delta: 943.7 MB). Free memory was 315.7 MB in the beginning and 1.1 GB in the end (delta: -834.1 MB). Peak memory consumption was 109.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (632states) and interpolant automaton (currently 20 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (160 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 82 locations, 17 error locations. TIMEOUT Result, 62.5s OverallTime, 87 OverallIterations, 6 TraceHistogramMax, 34.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6543 SDtfs, 8968 SDslu, 50527 SDs, 0 SdLazy, 47601 SolverSat, 2678 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2585 GetRequests, 366 SyntacticMatches, 112 SemanticMatches, 2107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12543 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1157/2939 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 86 MinimizatonAttempts, 1848 StatesRemovedByMinimization, 82 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 5783 NumberOfCodeBlocks, 5783 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 5696 ConstructedInterpolants, 0 QuantifiedInterpolants, 4021427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 87 InterpolantComputations, 11 PerfectInterpolantSequences, 1157/2939 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_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-39-45-393.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-39-45-393.csv Completed graceful shutdown