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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:21:42,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:21:42,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:21:42,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:21:42,208 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:21:42,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:21:42,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:21:42,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:21:42,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:21:42,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:21:42,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:21:42,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:21:42,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:21:42,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:21:42,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:21:42,218 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:21:42,220 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:21:42,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:21:42,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:21:42,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:21:42,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:21:42,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:21:42,225 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:21:42,226 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:21:42,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:21:42,228 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:21:42,228 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:21:42,228 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:21:42,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:21:42,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:21:42,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:21:42,229 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:21:42,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:21:42,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:21:42,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:21:42,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:21:42,240 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:21:42,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:21:42,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:21:42,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:21:42,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:21:42,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:21:42,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:21:42,241 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:21:42,241 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:21:42,241 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:21:42,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:21:42,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:21:42,242 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:21:42,242 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:21:42,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:21:42,242 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:21:42,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:21:42,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:21:42,243 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:21:42,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:21:42,279 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:21:42,282 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:21:42,284 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:21:42,284 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:21:42,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-02 10:21:42,432 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:21:42,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:21:42,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:21:42,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:21:42,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:21:42,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:21:42" (1/1) ... [2018-02-02 10:21:42,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42, skipping insertion in model container [2018-02-02 10:21:42,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:21:42" (1/1) ... [2018-02-02 10:21:42,456 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:21:42,491 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:21:42,572 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:21:42,587 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:21:42,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42 WrapperNode [2018-02-02 10:21:42,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:21:42,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:21:42,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:21:42,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:21:42,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42" (1/1) ... [2018-02-02 10:21:42,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42" (1/1) ... [2018-02-02 10:21:42,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42" (1/1) ... [2018-02-02 10:21:42,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42" (1/1) ... [2018-02-02 10:21:42,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42" (1/1) ... [2018-02-02 10:21:42,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42" (1/1) ... [2018-02-02 10:21:42,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42" (1/1) ... [2018-02-02 10:21:42,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:21:42,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:21:42,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:21:42,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:21:42,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21: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 10:21:42,651 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:21:42,651 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:21:42,651 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:21:42,651 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 10:21:42,651 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 10:21:42,651 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:21:42,651 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:21:42,651 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:21:42,651 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:21:42,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:21:42,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:21:42,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:21:42,844 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:21:42,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:21:42 BoogieIcfgContainer [2018-02-02 10:21:42,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:21:42,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:21:42,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:21:42,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:21:42,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:21:42" (1/3) ... [2018-02-02 10:21:42,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:21:42, skipping insertion in model container [2018-02-02 10:21:42,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:42" (2/3) ... [2018-02-02 10:21:42,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:21:42, skipping insertion in model container [2018-02-02 10:21:42,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:21:42" (3/3) ... [2018-02-02 10:21:42,850 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-02 10:21:42,857 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:21:42,863 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 10:21:42,889 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:21:42,889 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:21:42,889 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:21:42,889 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:21:42,890 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:21:42,890 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:21:42,890 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:21:42,890 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:21:42,890 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:21:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-02 10:21:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:21:42,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:42,910 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:42,910 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 10:21:42,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-02-02 10:21:42,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:42,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:43,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:21:43,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,114 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 81#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 82#(and (= 0 |entry_point_#t~ret10.base|) (= 0 |entry_point_#t~ret10.offset|)), 83#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset)), 79#true] [2018-02-02 10:21:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:21:43,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:21:43,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:43,190 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-02-02 10:21:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:43,232 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-02 10:21:43,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:21:43,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:21:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:43,240 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:21:43,241 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 10:21:43,242 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 10:21:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 10:21:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-02 10:21:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:21:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-02 10:21:43,273 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-02-02 10:21:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:43,273 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-02 10:21:43,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:21:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-02 10:21:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:21:43,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:43,274 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:43,275 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 10:21:43,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-02-02 10:21:43,276 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:43,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:43,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:21:43,315 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,316 INFO L182 omatonBuilderFactory]: Interpolants [243#true, 244#false, 245#(= |#valid| |old(#valid)|)] [2018-02-02 10:21:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:21:43,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:21:43,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:21:43,317 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-02-02 10:21:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:43,394 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-02 10:21:43,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:21:43,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:21:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:43,396 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:21:43,396 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 10:21:43,396 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 10:21:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 10:21:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-02-02 10:21:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:21:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-02 10:21:43,401 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-02-02 10:21:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:43,402 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-02 10:21:43,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:21:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-02 10:21:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:21:43,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:43,402 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:43,402 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 10:21:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-02-02 10:21:43,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:43,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:43,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:21:43,459 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,460 INFO L182 omatonBuilderFactory]: Interpolants [433#true, 434#false, 435#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 436#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 437#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 438#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:21:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:43,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:43,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:43,460 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-02-02 10:21:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:43,555 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-02-02 10:21:43,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:21:43,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:21:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:43,556 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:21:43,557 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:21:43,557 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 10:21:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:21:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-02 10:21:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:21:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-02 10:21:43,563 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-02-02 10:21:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:43,564 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-02 10:21:43,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-02 10:21:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:21:43,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:43,565 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:43,565 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 10:21:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-02-02 10:21:43,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:43,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:43,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:21:43,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,774 INFO L182 omatonBuilderFactory]: Interpolants [592#false, 593#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 594#(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))), 595#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 596#(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|))), 597#(and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 598#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 599#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 591#true] [2018-02-02 10:21:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:43,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:21:43,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:21:43,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:21:43,775 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-02-02 10:21:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:43,989 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 10:21:43,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:21:43,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 10:21:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:43,990 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:21:43,991 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:21:43,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:21:43,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:21:43,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-02 10:21:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:21:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-02 10:21:43,995 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-02-02 10:21:43,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:43,996 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-02 10:21:43,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:21:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-02 10:21:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:21:43,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:43,996 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:43,997 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 10:21:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-02-02 10:21:43,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:44,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:44,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:44,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:21:44,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:44,038 INFO L182 omatonBuilderFactory]: Interpolants [768#false, 769#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 770#(not (= 0 |ldv_malloc_#res.base|)), 771#(not (= 0 |entry_point_#t~ret10.base|)), 772#(not (= 0 entry_point_~array~0.base)), 767#true] [2018-02-02 10:21:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:44,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:44,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:44,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:44,039 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-02-02 10:21:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:44,064 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-02 10:21:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:21:44,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:21:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:44,065 INFO L225 Difference]: With dead ends: 77 [2018-02-02 10:21:44,065 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 10:21:44,066 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 10:21:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 10:21:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 10:21:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:21:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 10:21:44,070 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-02-02 10:21:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:44,071 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 10:21:44,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 10:21:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:21:44,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:44,071 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:44,072 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 10:21:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-02-02 10:21:44,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:44,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:44,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:44,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:21:44,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:44,273 INFO L182 omatonBuilderFactory]: Interpolants [929#true, 930#false, 931#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 932#(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))), 933#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 934#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 935#(or (and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 936#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 937#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))) (= entry_point_~i~2 0)), 938#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 939#(and (<= (+ (* 4 entry_point_~i~2) 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))] [2018-02-02 10:21:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:44,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:21:44,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:21:44,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:44,274 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 11 states. [2018-02-02 10:21:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:44,505 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-02 10:21:44,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:21:44,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 10:21:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:44,506 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:21:44,506 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:21:44,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:21:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:21:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 10:21:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:21:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 10:21:44,512 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 23 [2018-02-02 10:21:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:44,512 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 10:21:44,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:21:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 10:21:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:21:44,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:44,513 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:44,513 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 10:21:44,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-02-02 10:21:44,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:44,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:44,727 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 10:21:44,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:44,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:21:44,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:44,728 INFO L182 omatonBuilderFactory]: Interpolants [1120#(<= entry_point_~len~0 10), 1121#(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))), 1122#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 1123#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 1124#(or (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 1125#(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))), 1126#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1127#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1128#(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)), 1129#(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))), 1130#(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))), 1118#true, 1119#false] [2018-02-02 10:21:44,728 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 10:21:44,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:21:44,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:21:44,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:21:44,729 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 13 states. [2018-02-02 10:21:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:44,934 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 10:21:44,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:21:44,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 10:21:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:44,935 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:21:44,935 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:21:44,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:21:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:21:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-02-02 10:21:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:21:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-02 10:21:44,938 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 27 [2018-02-02 10:21:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:44,939 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-02 10:21:44,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:21:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-02 10:21:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:21:44,939 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:44,939 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:44,939 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 10:21:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1676632482, now seen corresponding path program 1 times [2018-02-02 10:21:44,940 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:44,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:44,977 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 10:21:44,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:44,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:21:44,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:44,978 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 10:21:44,978 INFO L182 omatonBuilderFactory]: Interpolants [1300#true, 1301#false, 1302#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1303#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1304#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 10:21:44,978 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 10:21:44,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:21:44,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:21:44,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:44,978 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 5 states. [2018-02-02 10:21:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:44,986 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 10:21:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:21:44,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:21:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:44,987 INFO L225 Difference]: With dead ends: 79 [2018-02-02 10:21:44,987 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 10:21:44,987 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 10:21:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 10:21:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-02 10:21:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:21:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 10:21:44,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 34 [2018-02-02 10:21:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:44,990 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 10:21:44,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:21:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 10:21:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:21:44,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:44,991 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:44,991 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 10:21:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1914987476, now seen corresponding path program 1 times [2018-02-02 10:21:44,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:45,054 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 10:21:45,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:45,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:21:45,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,055 INFO L182 omatonBuilderFactory]: Interpolants [1461#true, 1462#false, 1463#(= 1 (select |#valid| entry_point_~array~0.base)), 1464#(= |#valid| |old(#valid)|), 1465#(= 1 (select |#valid| |free_17_#in~array.base|)), 1466#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:21:45,055 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 10:21:45,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:45,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:45,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:45,056 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 6 states. [2018-02-02 10:21:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:45,160 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-02 10:21:45,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:21:45,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 10:21:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:45,161 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:21:45,161 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:21:45,161 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 10:21:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:21:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2018-02-02 10:21:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 10:21:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-02-02 10:21:45,164 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 35 [2018-02-02 10:21:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:45,164 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-02-02 10:21:45,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-02-02 10:21:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:21:45,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:45,165 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:45,165 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 10:21:45,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1914987475, now seen corresponding path program 1 times [2018-02-02 10:21:45,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:45,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:21:45,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,217 INFO L182 omatonBuilderFactory]: Interpolants [1696#false, 1697#(<= 10 entry_point_~len~0), 1698#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1699#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1695#true] [2018-02-02 10:21:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:21:45,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:21:45,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:45,218 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 5 states. [2018-02-02 10:21:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:45,243 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-02-02 10:21:45,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:21:45,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:21:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:45,245 INFO L225 Difference]: With dead ends: 108 [2018-02-02 10:21:45,245 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 10:21:45,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 10:21:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-02 10:21:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:21:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-02-02 10:21:45,250 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 35 [2018-02-02 10:21:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:45,250 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-02-02 10:21:45,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:21:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-02-02 10:21:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:21:45,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:45,251 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:45,251 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 10:21:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 2 times [2018-02-02 10:21:45,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:45,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:21:45,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,293 INFO L182 omatonBuilderFactory]: Interpolants [1920#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1921#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 1916#true, 1917#false, 1918#(<= 10 entry_point_~len~0), 1919#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0))] [2018-02-02 10:21:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:45,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:45,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:45,294 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 6 states. [2018-02-02 10:21:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:45,328 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-02 10:21:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:21:45,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-02 10:21:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:45,330 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:21:45,330 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:21:45,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:21:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:21:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-02 10:21:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 10:21:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2018-02-02 10:21:45,335 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39 [2018-02-02 10:21:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:45,335 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2018-02-02 10:21:45,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2018-02-02 10:21:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:21:45,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:45,336 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:45,336 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 10:21:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 3 times [2018-02-02 10:21:45,337 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:45,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:21:45,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,388 INFO L182 omatonBuilderFactory]: Interpolants [2148#true, 2149#false, 2150#(<= 10 entry_point_~len~0), 2151#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2152#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2153#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2154#(<= (+ entry_point_~i~2 7) entry_point_~len~0)] [2018-02-02 10:21:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:21:45,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:21:45,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:45,389 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 7 states. [2018-02-02 10:21:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:45,431 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2018-02-02 10:21:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:21:45,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-02-02 10:21:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:45,432 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:21:45,432 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:21:45,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:21:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:21:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-02 10:21:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:21:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-02-02 10:21:45,435 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 43 [2018-02-02 10:21:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:45,435 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-02-02 10:21:45,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:21:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-02-02 10:21:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:21:45,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:45,437 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:45,437 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 10:21:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1950591474, now seen corresponding path program 4 times [2018-02-02 10:21:45,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:45,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:21:45,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,491 INFO L182 omatonBuilderFactory]: Interpolants [2391#true, 2392#false, 2393#(<= 10 entry_point_~len~0), 2394#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2395#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2396#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2397#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2398#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 10:21:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:21:45,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:21:45,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:21:45,491 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 8 states. [2018-02-02 10:21:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:45,551 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-02-02 10:21:45,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:21:45,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 10:21:45,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:45,552 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:21:45,552 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:21:45,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:21:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:21:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 10:21:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:21:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2018-02-02 10:21:45,556 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 47 [2018-02-02 10:21:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:45,556 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2018-02-02 10:21:45,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:21:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-02-02 10:21:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:21:45,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:45,558 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:45,558 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 10:21:45,558 INFO L82 PathProgramCache]: Analyzing trace with hash -281679991, now seen corresponding path program 5 times [2018-02-02 10:21:45,559 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:45,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:21:45,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,629 INFO L182 omatonBuilderFactory]: Interpolants [2645#true, 2646#false, 2647#(<= 10 entry_point_~len~0), 2648#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2649#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2650#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2651#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2652#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2653#(<= (+ entry_point_~i~2 5) entry_point_~len~0)] [2018-02-02 10:21:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:21:45,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:21:45,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:21:45,630 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 9 states. [2018-02-02 10:21:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:45,711 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-02-02 10:21:45,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:21:45,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-02-02 10:21:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:45,715 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:21:45,715 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:21:45,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:21:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:21:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-02 10:21:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:21:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2018-02-02 10:21:45,720 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 51 [2018-02-02 10:21:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:45,720 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2018-02-02 10:21:45,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:21:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2018-02-02 10:21:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:21:45,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:45,721 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:45,721 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 10:21:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash 85033376, now seen corresponding path program 6 times [2018-02-02 10:21:45,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:45,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:21:45,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,800 INFO L182 omatonBuilderFactory]: Interpolants [2912#(<= 10 entry_point_~len~0), 2913#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2914#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2915#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2916#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2917#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2918#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2919#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2910#true, 2911#false] [2018-02-02 10:21:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:45,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:21:45,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:21:45,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:21:45,801 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand 10 states. [2018-02-02 10:21:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:45,904 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-02-02 10:21:45,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:21:45,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:21:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:45,906 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:21:45,906 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:21:45,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:21:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:21:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-02-02 10:21:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:21:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2018-02-02 10:21:45,914 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 55 [2018-02-02 10:21:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:45,914 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2018-02-02 10:21:45,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:21:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2018-02-02 10:21:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:21:45,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:45,916 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:45,916 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 10:21:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash 819214391, now seen corresponding path program 7 times [2018-02-02 10:21:45,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:46,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:21:46,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,030 INFO L182 omatonBuilderFactory]: Interpolants [3186#true, 3187#false, 3188#(<= 10 entry_point_~len~0), 3189#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3190#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3191#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3192#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3193#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3194#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3195#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3196#(<= (+ entry_point_~i~2 3) entry_point_~len~0)] [2018-02-02 10:21:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:21:46,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:21:46,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:46,031 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand 11 states. [2018-02-02 10:21:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:46,128 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-02-02 10:21:46,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:21:46,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-02 10:21:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:46,129 INFO L225 Difference]: With dead ends: 132 [2018-02-02 10:21:46,129 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 10:21:46,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:21:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 10:21:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-02-02 10:21:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:21:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2018-02-02 10:21:46,132 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 59 [2018-02-02 10:21:46,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:46,133 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2018-02-02 10:21:46,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:21:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2018-02-02 10:21:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:21:46,133 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:46,133 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:46,133 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 10:21:46,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1197749426, now seen corresponding path program 8 times [2018-02-02 10:21:46,134 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:46,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:46,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:21:46,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,205 INFO L182 omatonBuilderFactory]: Interpolants [3473#true, 3474#false, 3475#(<= 10 entry_point_~len~0), 3476#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3477#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3478#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3479#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3480#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3481#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3482#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3483#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3484#(<= (+ entry_point_~i~2 2) entry_point_~len~0)] [2018-02-02 10:21:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:21:46,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:21:46,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:21:46,205 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand 12 states. [2018-02-02 10:21:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:46,294 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2018-02-02 10:21:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:21:46,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 10:21:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:46,295 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:21:46,295 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 10:21:46,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:21:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 10:21:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-02-02 10:21:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:21:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2018-02-02 10:21:46,298 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 63 [2018-02-02 10:21:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:46,298 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2018-02-02 10:21:46,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:21:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2018-02-02 10:21:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:21:46,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:46,299 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:46,299 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 10:21:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash 497416933, now seen corresponding path program 9 times [2018-02-02 10:21:46,300 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:46,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:46,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:21:46,382 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,382 INFO L182 omatonBuilderFactory]: Interpolants [3776#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3777#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3778#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3779#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3780#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3781#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3782#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3783#(<= (+ entry_point_~i~2 1) entry_point_~len~0), 3771#true, 3772#false, 3773#(<= 10 entry_point_~len~0), 3774#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3775#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 10:21:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:21:46,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:21:46,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:21:46,383 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand 13 states. [2018-02-02 10:21:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:46,484 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2018-02-02 10:21:46,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:21:46,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2018-02-02 10:21:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:46,487 INFO L225 Difference]: With dead ends: 138 [2018-02-02 10:21:46,487 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 10:21:46,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:21:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 10:21:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 10:21:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 10:21:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2018-02-02 10:21:46,491 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 67 [2018-02-02 10:21:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:46,491 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2018-02-02 10:21:46,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:21:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2018-02-02 10:21:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:21:46,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:46,492 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:46,492 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 10:21:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1940879620, now seen corresponding path program 10 times [2018-02-02 10:21:46,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:46,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:21:46,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:46,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:21:46,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:46,532 INFO L182 omatonBuilderFactory]: Interpolants [4080#(<= 10 entry_point_~len~0), 4081#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 4082#(<= |alloc_17_#in~len| 0), 4078#true, 4079#false] [2018-02-02 10:21:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:21:46,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:21:46,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:21:46,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:46,533 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand 5 states. [2018-02-02 10:21:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:46,558 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2018-02-02 10:21:46,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:21:46,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-02-02 10:21:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:46,559 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:21:46,559 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:21:46,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:21:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 137. [2018-02-02 10:21:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:21:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2018-02-02 10:21:46,564 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 71 [2018-02-02 10:21:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:46,564 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2018-02-02 10:21:46,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:21:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2018-02-02 10:21:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:21:46,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:46,565 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:46,565 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 10:21:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash 114739281, now seen corresponding path program 1 times [2018-02-02 10:21:46,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:46,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:21:46,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:46,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:21:46,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:46,813 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 10:21:46,813 INFO L182 omatonBuilderFactory]: Interpolants [4385#true, 4386#false, 4387#(<= 10 entry_point_~len~0), 4388#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4389#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4390#(and (<= 10 entry_point_~len~0) (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 4391#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4392#(and (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 44) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= (select |#valid| entry_point_~array~0.base) 1)), 4393#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 40) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4394#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 36) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4395#(and (<= (+ entry_point_~array~0.offset 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4396#(and (<= 36 (select |#length| |alloc_17_#in~array.base|)) (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 4397#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 36 (select |#length| alloc_17_~array.base))), 4398#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 4399#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 4400#(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|))))), 4401#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 36 (select |#length| alloc_17_~array.base)))] [2018-02-02 10:21:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:21:46,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:21:46,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:21:46,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:21:46,814 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand 17 states. [2018-02-02 10:21:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:47,416 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2018-02-02 10:21:47,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:21:47,416 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-02 10:21:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:47,417 INFO L225 Difference]: With dead ends: 207 [2018-02-02 10:21:47,417 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 10:21:47,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:21:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 10:21:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 151. [2018-02-02 10:21:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:21:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2018-02-02 10:21:47,420 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 72 [2018-02-02 10:21:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:47,420 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2018-02-02 10:21:47,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:21:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2018-02-02 10:21:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:21:47,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:47,421 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:47,421 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 10:21:47,421 INFO L82 PathProgramCache]: Analyzing trace with hash 114739280, now seen corresponding path program 1 times [2018-02-02 10:21:47,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:47,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:21:47,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:47,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:21:47,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:47,524 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 10:21:47,525 INFO L182 omatonBuilderFactory]: Interpolants [4786#true, 4787#false, 4788#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4789#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4790#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 4791#(= 1 (select |#valid| entry_point_~array~0.base)), 4792#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 4793#(= 1 (select |#valid| alloc_17_~array.base)), 4794#(= |#valid| |old(#valid)|), 4795#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 4796#(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 10:21:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:21:47,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:21:47,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:21:47,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:47,525 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand 11 states. [2018-02-02 10:21:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:47,746 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2018-02-02 10:21:47,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:21:47,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-02-02 10:21:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:47,747 INFO L225 Difference]: With dead ends: 193 [2018-02-02 10:21:47,747 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 10:21:47,748 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 10:21:47,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 10:21:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146. [2018-02-02 10:21:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:21:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2018-02-02 10:21:47,750 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 72 [2018-02-02 10:21:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:47,750 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2018-02-02 10:21:47,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:21:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2018-02-02 10:21:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:21:47,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:47,751 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:47,751 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 10:21:47,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1497729290, now seen corresponding path program 1 times [2018-02-02 10:21:47,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:47,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:21:47,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:47,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:21:47,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:47,790 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 10:21:47,790 INFO L182 omatonBuilderFactory]: Interpolants [5152#(= alloc_17_~i~0 0), 5153#(<= (+ alloc_17_~j~0 1) 0), 5150#true, 5151#false] [2018-02-02 10:21:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:21:47,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:21:47,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:21:47,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:21:47,791 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 4 states. [2018-02-02 10:21:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:47,816 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-02 10:21:47,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:21:47,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 10:21:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:47,817 INFO L225 Difference]: With dead ends: 155 [2018-02-02 10:21:47,817 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 10:21:47,817 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 10:21:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 10:21:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-02-02 10:21:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:21:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-02-02 10:21:47,821 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 73 [2018-02-02 10:21:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:47,821 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-02-02 10:21:47,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:21:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-02-02 10:21:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:21:47,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:47,822 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:47,822 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 10:21:47,823 INFO L82 PathProgramCache]: Analyzing trace with hash 950466152, now seen corresponding path program 1 times [2018-02-02 10:21:47,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:47,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:21:47,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:47,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:21:47,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:47,941 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 10:21:47,941 INFO L182 omatonBuilderFactory]: Interpolants [5472#(and (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 5460#true, 5461#false, 5462#(= 0 |ldv_malloc_#t~malloc1.offset|), 5463#(= 0 |ldv_malloc_#res.offset|), 5464#(= 0 |entry_point_#t~ret10.offset|), 5465#(= entry_point_~array~0.offset 0), 5466#(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)), 5467#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5468#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5469#(= |old(#length)| |#length|), 5470#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 5471#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 10:21:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:21:47,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:21:47,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:21:47,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:21:47,942 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 13 states. [2018-02-02 10:21:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:48,137 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2018-02-02 10:21:48,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:21:48,137 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-02-02 10:21:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:48,138 INFO L225 Difference]: With dead ends: 169 [2018-02-02 10:21:48,138 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 10:21:48,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:21:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 10:21:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2018-02-02 10:21:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:21:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-02-02 10:21:48,142 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 81 [2018-02-02 10:21:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:48,143 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-02-02 10:21:48,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:21:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-02-02 10:21:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:21:48,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:48,144 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:48,144 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 10:21:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -600320339, now seen corresponding path program 1 times [2018-02-02 10:21:48,145 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:48,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:49,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:49,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:21:49,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:49,067 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 10:21:49,067 INFO L182 omatonBuilderFactory]: Interpolants [5824#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2))), 5825#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 5826#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 5827#(and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 5828#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 5829#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 5830#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 5831#(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))))), 5832#(= 0 |free_17_#t~mem9.offset|), 5809#true, 5810#false, 5811#(<= entry_point_~len~0 10), 5812#(= 0 |ldv_malloc_#t~malloc1.offset|), 5813#(= 0 |ldv_malloc_#res.offset|), 5814#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 5815#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 5816#(and (or (and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset))), 5817#(and (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10))) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))))), 5818#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 5819#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31))) (and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 5820#(or (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (= entry_point_~array~0.offset 0)) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2))), 5821#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 5822#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)) (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (= entry_point_~array~0.offset 0))), 5823#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0))))] [2018-02-02 10:21:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:49,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:21:49,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:21:49,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:21:49,068 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 24 states. [2018-02-02 10:21:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:49,944 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2018-02-02 10:21:49,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:21:49,944 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 10:21:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:49,945 INFO L225 Difference]: With dead ends: 192 [2018-02-02 10:21:49,945 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:21:49,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=1750, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:21:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:21:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 176. [2018-02-02 10:21:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:21:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2018-02-02 10:21:49,951 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 82 [2018-02-02 10:21:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:49,951 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2018-02-02 10:21:49,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:21:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2018-02-02 10:21:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:21:49,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:49,952 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:49,952 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 10:21:49,952 INFO L82 PathProgramCache]: Analyzing trace with hash -600320338, now seen corresponding path program 1 times [2018-02-02 10:21:49,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:49,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:50,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:50,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:21:50,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:50,905 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 10:21:50,905 INFO L182 omatonBuilderFactory]: Interpolants [6246#true, 6247#false, 6248#(<= entry_point_~len~0 10), 6249#(= 0 |ldv_malloc_#t~malloc1.offset|), 6250#(= 0 |ldv_malloc_#res.offset|), 6251#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 6252#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 6253#(and (or (and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset))), 6254#(and (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= 0 entry_point_~array~0.offset))) (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)))), 6255#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 6256#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31))) (and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 6257#(or (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (= entry_point_~array~0.offset 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2))), 6258#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 6259#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)) (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (= entry_point_~array~0.offset 0))), 6260#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15)))), 6261#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11)))), 6262#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 6263#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3)))), 6264#(and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 6265#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 6266#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 6267#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 6268#(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)), 6269#(= |free_17_#t~mem9.base| 0)] [2018-02-02 10:21:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:50,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:21:50,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:21:50,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:21:50,905 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand 24 states. [2018-02-02 10:21:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:51,617 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2018-02-02 10:21:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:21:51,617 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 10:21:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:51,618 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:21:51,618 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:21:51,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:21:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:21:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-02-02 10:21:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:21:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-02 10:21:51,622 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 82 [2018-02-02 10:21:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:51,622 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-02 10:21:51,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:21:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-02 10:21:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:21:51,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:51,623 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:51,623 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 10:21:51,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1232614021, now seen corresponding path program 1 times [2018-02-02 10:21:51,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:51,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:21:51,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:51,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:21:51,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:51,658 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 10:21:51,658 INFO L182 omatonBuilderFactory]: Interpolants [6678#true, 6679#false, 6680#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 6681#(not (= 0 |ldv_malloc_#res.base|)), 6682#(not (= 0 |alloc_17_#t~ret3.base|)), 6683#(not (= 0 alloc_17_~p~0.base))] [2018-02-02 10:21:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:21:51,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:51,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:51,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:51,659 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 6 states. [2018-02-02 10:21:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:51,677 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-02 10:21:51,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:21:51,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-02 10:21:51,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:51,678 INFO L225 Difference]: With dead ends: 155 [2018-02-02 10:21:51,678 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 10:21:51,679 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 10:21:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 10:21:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-02-02 10:21:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:21:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2018-02-02 10:21:51,681 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 83 [2018-02-02 10:21:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:51,681 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2018-02-02 10:21:51,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-02-02 10:21:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 10:21:51,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:51,682 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:51,683 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 10:21:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1239415694, now seen corresponding path program 1 times [2018-02-02 10:21:51,683 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:51,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:21:51,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:51,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:21:51,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:51,740 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 10:21:51,740 INFO L182 omatonBuilderFactory]: Interpolants [6996#true, 6997#false, 6998#(= alloc_17_~array.base |alloc_17_#in~array.base|), 6999#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 7000#(= 1 (select |#valid| entry_point_~array~0.base)), 7001#(= 1 (select |#valid| |free_17_#in~array.base|)), 7002#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:21:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:21:51,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:21:51,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:21:51,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:51,741 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 7 states. [2018-02-02 10:21:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:51,814 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2018-02-02 10:21:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:21:51,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-02-02 10:21:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:51,816 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:21:51,816 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:21:51,816 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 10:21:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:21:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2018-02-02 10:21:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:21:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2018-02-02 10:21:51,820 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 84 [2018-02-02 10:21:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:51,821 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2018-02-02 10:21:51,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:21:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2018-02-02 10:21:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 10:21:51,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:51,822 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:51,822 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 10:21:51,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1239415693, now seen corresponding path program 1 times [2018-02-02 10:21:51,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:51,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:21:51,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:51,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:21:51,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:51,881 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 10:21:51,882 INFO L182 omatonBuilderFactory]: Interpolants [7337#true, 7338#false, 7339#(<= 10 entry_point_~len~0), 7340#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 7341#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 7342#(<= |alloc_17_#in~len| 1)] [2018-02-02 10:21:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:21:51,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:51,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:51,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:51,883 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 6 states. [2018-02-02 10:21:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:51,923 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2018-02-02 10:21:51,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:21:51,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-02-02 10:21:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:51,942 INFO L225 Difference]: With dead ends: 194 [2018-02-02 10:21:51,943 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:21:51,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:21:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 162. [2018-02-02 10:21:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 10:21:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 180 transitions. [2018-02-02 10:21:51,947 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 180 transitions. Word has length 84 [2018-02-02 10:21:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:51,948 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 180 transitions. [2018-02-02 10:21:51,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 180 transitions. [2018-02-02 10:21:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:21:51,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:51,949 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:51,949 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 10:21:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 385284538, now seen corresponding path program 1 times [2018-02-02 10:21:51,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:51,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 10:21:52,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:52,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:21:52,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:52,291 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 10:21:52,291 INFO L182 omatonBuilderFactory]: Interpolants [7712#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7713#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 7714#(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|))))), 7715#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7716#(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)), 7717#(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)), 7718#(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)), 7719#(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)), 7701#true, 7702#false, 7703#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 7704#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7705#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 7706#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7707#(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)), 7708#(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)), 7709#(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)), 7710#(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|)), 7711#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0))] [2018-02-02 10:21:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 10:21:52,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:21:52,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:21:52,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:21:52,292 INFO L87 Difference]: Start difference. First operand 162 states and 180 transitions. Second operand 19 states. [2018-02-02 10:21:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:52,881 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2018-02-02 10:21:52,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:21:52,881 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-02-02 10:21:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:52,882 INFO L225 Difference]: With dead ends: 200 [2018-02-02 10:21:52,882 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 10:21:52,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:21:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 10:21:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 161. [2018-02-02 10:21:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:21:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 179 transitions. [2018-02-02 10:21:52,886 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 179 transitions. Word has length 85 [2018-02-02 10:21:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:52,886 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 179 transitions. [2018-02-02 10:21:52,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:21:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 179 transitions. [2018-02-02 10:21:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:21:52,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:52,888 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:52,888 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 10:21:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1700760915, now seen corresponding path program 1 times [2018-02-02 10:21:52,889 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:52,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:21:53,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:53,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:21:53,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:53,017 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 10:21:53,017 INFO L182 omatonBuilderFactory]: Interpolants [8113#true, 8114#false, 8115#(= 0 |ldv_malloc_#t~malloc1.offset|), 8116#(= 0 |ldv_malloc_#res.offset|), 8117#(= 0 |entry_point_#t~ret10.offset|), 8118#(= 0 entry_point_~array~0.offset), 8119#(= 0 |alloc_17_#in~array.offset|), 8120#(= alloc_17_~array.offset 0), 8121#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))), 8122#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8123#(= |old(#length)| |#length|), 8124#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8125#(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 10:21:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:21:53,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:21:53,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:21:53,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:21:53,017 INFO L87 Difference]: Start difference. First operand 161 states and 179 transitions. Second operand 13 states. [2018-02-02 10:21:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:53,220 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2018-02-02 10:21:53,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:21:53,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-02-02 10:21:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:53,221 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:21:53,222 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:21:53,222 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 10:21:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:21:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-02-02 10:21:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:21:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2018-02-02 10:21:53,225 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 86 [2018-02-02 10:21:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:53,226 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2018-02-02 10:21:53,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:21:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2018-02-02 10:21:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:21:53,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:53,227 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:53,227 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 10:21:53,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1741617760, now seen corresponding path program 1 times [2018-02-02 10:21:53,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:53,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:21:53,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:53,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:21:53,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:53,283 INFO L182 omatonBuilderFactory]: Interpolants [8465#true, 8466#false, 8467#(<= 10 entry_point_~len~0), 8468#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 8469#(<= |free_17_#in~len| 0)] [2018-02-02 10:21:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:21:53,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:21:53,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:21:53,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:53,284 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 5 states. [2018-02-02 10:21:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:53,306 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2018-02-02 10:21:53,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:21:53,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-02-02 10:21:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:53,307 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:21:53,307 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:21:53,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:21:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-02-02 10:21:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:21:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2018-02-02 10:21:53,312 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 86 [2018-02-02 10:21:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:53,312 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2018-02-02 10:21:53,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:21:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-02-02 10:21:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:21:53,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:53,313 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:53,313 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 10:21:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1183980822, now seen corresponding path program 1 times [2018-02-02 10:21:53,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:53,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 10:21:53,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:53,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:21:53,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:53,579 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 10:21:53,579 INFO L182 omatonBuilderFactory]: Interpolants [8800#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 8801#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 8802#(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))))), 8803#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 8804#(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)), 8805#(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))))), 8806#(= 0 |alloc_17_#t~mem6.offset|), 8792#true, 8793#false, 8794#(= 0 |ldv_malloc_#t~malloc1.offset|), 8795#(= 0 |ldv_malloc_#res.offset|), 8796#(= 0 |entry_point_#t~ret10.offset|), 8797#(= 0 entry_point_~array~0.offset), 8798#(= 0 |alloc_17_#in~array.offset|), 8799#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0))] [2018-02-02 10:21:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 10:21:53,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:21:53,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:21:53,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:21:53,580 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 15 states. [2018-02-02 10:21:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:53,799 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2018-02-02 10:21:53,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:21:53,799 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 10:21:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:53,800 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:21:53,800 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:21:53,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:21:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:21:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2018-02-02 10:21:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:21:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2018-02-02 10:21:53,803 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 87 [2018-02-02 10:21:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:53,803 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2018-02-02 10:21:53,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:21:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2018-02-02 10:21:53,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:21:53,803 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:53,804 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:53,804 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 10:21:53,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1183980821, now seen corresponding path program 1 times [2018-02-02 10:21:53,804 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:53,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:21:54,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:54,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:21:54,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:54,045 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 10:21:54,045 INFO L182 omatonBuilderFactory]: Interpolants [9184#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 9185#(= |#valid| |old(#valid)|), 9186#(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)), 9187#(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)))))), 9188#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 9171#true, 9172#false, 9173#(= 0 |ldv_malloc_#t~malloc1.offset|), 9174#(= 0 |ldv_malloc_#res.offset|), 9175#(= 0 |entry_point_#t~ret10.offset|), 9176#(= 0 entry_point_~array~0.offset), 9177#(= 0 |alloc_17_#in~array.offset|), 9178#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 9179#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 9180#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 9181#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 9182#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 9183#(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))))))] [2018-02-02 10:21:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:21:54,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:21:54,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:21:54,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:21:54,046 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 18 states. [2018-02-02 10:21:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:54,362 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2018-02-02 10:21:54,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:21:54,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 10:21:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:54,364 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:21:54,364 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:21:54,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:21:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:21:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2018-02-02 10:21:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:21:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2018-02-02 10:21:54,369 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 188 transitions. Word has length 87 [2018-02-02 10:21:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:54,370 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 188 transitions. [2018-02-02 10:21:54,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:21:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 188 transitions. [2018-02-02 10:21:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:21:54,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:54,371 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:54,371 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 10:21:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2053772611, now seen corresponding path program 1 times [2018-02-02 10:21:54,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:54,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 116 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:55,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:55,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:21:55,225 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:55,226 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 10:21:55,226 INFO L182 omatonBuilderFactory]: Interpolants [9558#true, 9559#false, 9560#(<= entry_point_~len~0 10), 9561#(= 0 |ldv_malloc_#t~malloc1.offset|), 9562#(= 0 |ldv_malloc_#res.offset|), 9563#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 9564#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9565#(and (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (<= entry_point_~len~0 10)) (= 0 entry_point_~array~0.offset)), 9566#(and (= 0 entry_point_~array~0.offset) (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~len~0 10))) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))))), 9567#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 9568#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31)))), 9569#(and (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2)))), 9570#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23)))), 9571#(and (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)))), 9572#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15)))), 9573#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11)))), 9574#(and (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))) (= 0 entry_point_~array~0.offset)), 9575#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3)))), 9576#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 9577#(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)), 9578#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9579#(= |#valid| |old(#valid)|), 9580#(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|))), 9581#(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))), 9582#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 9583#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:21:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 116 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:55,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:21:55,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:21:55,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:21:55,226 INFO L87 Difference]: Start difference. First operand 167 states and 188 transitions. Second operand 26 states. [2018-02-02 10:21:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:56,153 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-02-02 10:21:56,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:21:56,153 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-02-02 10:21:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:56,154 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:21:56,154 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:21:56,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1887, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:21:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:21:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 175. [2018-02-02 10:21:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:21:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2018-02-02 10:21:56,159 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 87 [2018-02-02 10:21:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:56,159 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2018-02-02 10:21:56,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:21:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2018-02-02 10:21:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:21:56,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:56,160 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:56,160 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 10:21:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2053772610, now seen corresponding path program 1 times [2018-02-02 10:21:56,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:56,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:21:56,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:56,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:21:56,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:56,344 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 10:21:56,344 INFO L182 omatonBuilderFactory]: Interpolants [9994#true, 9995#false, 9996#(= 0 |ldv_malloc_#t~malloc1.offset|), 9997#(= 0 |ldv_malloc_#res.offset|), 9998#(= 0 |entry_point_#t~ret10.offset|), 9999#(= entry_point_~array~0.offset 0), 10000#(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)), 10001#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10002#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10003#(= |old(#length)| |#length|), 10004#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 10005#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 10006#(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)), 10007#(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)), 10008#(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 10:21:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:21:56,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:21:56,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:21:56,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:21:56,345 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 15 states. [2018-02-02 10:21:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:56,617 INFO L93 Difference]: Finished difference Result 182 states and 200 transitions. [2018-02-02 10:21:56,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:21:56,617 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 10:21:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:56,618 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:21:56,618 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:21:56,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:21:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:21:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2018-02-02 10:21:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:21:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2018-02-02 10:21:56,644 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 87 [2018-02-02 10:21:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:56,644 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2018-02-02 10:21:56,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:21:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2018-02-02 10:21:56,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:21:56,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:56,645 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:56,645 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 10:21:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash 757558551, now seen corresponding path program 1 times [2018-02-02 10:21:56,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:56,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:21:57,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:57,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:21:57,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:57,495 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 10:21:57,495 INFO L182 omatonBuilderFactory]: Interpolants [10380#true, 10381#false, 10382#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10383#(= 0 |ldv_malloc_#t~malloc1.offset|), 10384#(= 0 |ldv_malloc_#res.offset|), 10385#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10386#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10387#(and (<= 10 entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10388#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2)), 10389#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 10390#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (= entry_point_~array~0.offset 0)), 10391#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 10392#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))))), 10393#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))))), 10394#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 10395#(and (= entry_point_~array~0.offset 0) (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8))))))), 10396#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 10397#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10398#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 10399#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))), 10400#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 10401#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 10402#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 10403#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10404#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 10:21:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:21:57,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:21:57,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:21:57,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:21:57,496 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand 25 states. [2018-02-02 10:21:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:59,738 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2018-02-02 10:21:59,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:21:59,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 10:21:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:59,739 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:21:59,739 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:21:59,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=610, Invalid=3550, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:21:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:21:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 176. [2018-02-02 10:21:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:21:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2018-02-02 10:21:59,742 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 88 [2018-02-02 10:21:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:59,742 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2018-02-02 10:21:59,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:21:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2018-02-02 10:21:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:21:59,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:59,743 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:59,743 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 10:21:59,743 INFO L82 PathProgramCache]: Analyzing trace with hash 757558552, now seen corresponding path program 1 times [2018-02-02 10:21:59,744 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:59,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:00,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:00,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:22:00,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:00,499 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 10:22:00,500 INFO L182 omatonBuilderFactory]: Interpolants [10848#true, 10849#false, 10850#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10851#(= 0 |ldv_malloc_#t~malloc1.offset|), 10852#(= 0 |ldv_malloc_#res.offset|), 10853#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10854#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10855#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10856#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 10857#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 10858#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 10859#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 10860#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 10861#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2)), 10862#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)) 4) 7) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 10863#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)) entry_point_~array~0.offset)))), 10864#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 4 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 10865#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10866#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset))))), 10867#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 10868#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 10869#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 10870#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 10871#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10872#(= |free_17_#t~mem9.base| 0)] [2018-02-02 10:22:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:00,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:22:00,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:22:00,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:22:00,501 INFO L87 Difference]: Start difference. First operand 176 states and 198 transitions. Second operand 25 states. [2018-02-02 10:22:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:03,376 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2018-02-02 10:22:03,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:22:03,379 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 10:22:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:03,380 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:22:03,380 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 10:22:03,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=582, Invalid=3200, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:22:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 10:22:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2018-02-02 10:22:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:22:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2018-02-02 10:22:03,383 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 88 [2018-02-02 10:22:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:03,384 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2018-02-02 10:22:03,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:22:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2018-02-02 10:22:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:22:03,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:03,384 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:03,384 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 10:22:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash 360764299, now seen corresponding path program 1 times [2018-02-02 10:22:03,385 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:03,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:22:03,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:03,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:22:03,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:03,855 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 10:22:03,855 INFO L182 omatonBuilderFactory]: Interpolants [11309#true, 11310#false, 11311#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 11312#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 11313#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 11314#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 11315#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 11316#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 11317#(= |#valid| |old(#valid)|), 11318#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 11319#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 11320#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 11321#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 11322#(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)))))), 11323#(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)))), 11324#(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)), 11325#(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))), 11326#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 11327#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 10:22:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:22:03,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:22:03,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:22:03,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:22:03,856 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand 19 states. [2018-02-02 10:22:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:04,223 INFO L93 Difference]: Finished difference Result 187 states and 208 transitions. [2018-02-02 10:22:04,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:22:04,223 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-02 10:22:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:04,224 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:22:04,224 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 10:22:04,224 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 10:22:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 10:22:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2018-02-02 10:22:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:22:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2018-02-02 10:22:04,227 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 89 [2018-02-02 10:22:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:04,228 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2018-02-02 10:22:04,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:22:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2018-02-02 10:22:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:22:04,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:04,229 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:04,229 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 10:22:04,229 INFO L82 PathProgramCache]: Analyzing trace with hash -254194742, now seen corresponding path program 1 times [2018-02-02 10:22:04,230 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:04,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:22:04,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:04,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:22:04,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:04,285 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 10:22:04,285 INFO L182 omatonBuilderFactory]: Interpolants [11712#false, 11713#(<= 10 entry_point_~len~0), 11714#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 11715#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 11716#(<= |free_17_#in~len| 1), 11711#true] [2018-02-02 10:22:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:22:04,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:22:04,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:22:04,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:22:04,286 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand 6 states. [2018-02-02 10:22:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:04,314 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-02-02 10:22:04,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:22:04,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-02-02 10:22:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:04,315 INFO L225 Difference]: With dead ends: 199 [2018-02-02 10:22:04,315 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 10:22:04,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 10:22:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2018-02-02 10:22:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 10:22:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-02-02 10:22:04,319 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 92 [2018-02-02 10:22:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:04,319 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-02-02 10:22:04,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:22:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2018-02-02 10:22:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:22:04,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:04,320 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:04,320 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 10:22:04,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1924314338, now seen corresponding path program 1 times [2018-02-02 10:22:04,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:04,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:22:04,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:04,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:22:04,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:04,379 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 10:22:04,379 INFO L182 omatonBuilderFactory]: Interpolants [12099#true, 12100#false, 12101#(= alloc_17_~array.base |alloc_17_#in~array.base|), 12102#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 12103#(= |#valid| |old(#valid)|), 12104#(= 1 (select |#valid| entry_point_~array~0.base)), 12105#(= 1 (select |#valid| |free_17_#in~array.base|)), 12106#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:22:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:22:04,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:22:04,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:22:04,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:22:04,380 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand 8 states. [2018-02-02 10:22:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:04,503 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2018-02-02 10:22:04,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:22:04,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-02-02 10:22:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:04,504 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:22:04,504 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:22:04,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:22:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-02-02 10:22:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:22:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2018-02-02 10:22:04,507 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 190 transitions. Word has length 94 [2018-02-02 10:22:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:04,508 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 190 transitions. [2018-02-02 10:22:04,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:22:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 190 transitions. [2018-02-02 10:22:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:22:04,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:04,509 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:04,509 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 10:22:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1924314337, now seen corresponding path program 1 times [2018-02-02 10:22:04,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:04,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 10:22:04,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:04,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:22:04,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:04,608 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 10:22:04,608 INFO L182 omatonBuilderFactory]: Interpolants [12480#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 12481#(not (= |alloc_17_#in~array.offset| 0)), 12471#true, 12472#false, 12473#(= 0 |ldv_malloc_#t~malloc1.offset|), 12474#(= 0 |ldv_malloc_#res.offset|), 12475#(= 0 |entry_point_#t~ret10.offset|), 12476#(= 0 entry_point_~array~0.offset), 12477#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 12478#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 12479#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0))] [2018-02-02 10:22:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 10:22:04,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:22:04,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:22:04,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:22:04,609 INFO L87 Difference]: Start difference. First operand 170 states and 190 transitions. Second operand 11 states. [2018-02-02 10:22:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:04,737 INFO L93 Difference]: Finished difference Result 175 states and 195 transitions. [2018-02-02 10:22:04,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:22:04,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-02-02 10:22:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:04,739 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:22:04,739 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:22:04,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:22:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:22:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-02 10:22:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:22:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 191 transitions. [2018-02-02 10:22:04,743 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 191 transitions. Word has length 94 [2018-02-02 10:22:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:04,743 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 191 transitions. [2018-02-02 10:22:04,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:22:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 191 transitions. [2018-02-02 10:22:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 10:22:04,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:04,744 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:04,744 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 10:22:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash 500549267, now seen corresponding path program 2 times [2018-02-02 10:22:04,745 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:04,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:05,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:05,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:22:05,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:05,656 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 10:22:05,657 INFO L182 omatonBuilderFactory]: Interpolants [12864#(= 1 (select |#valid| free_17_~array.base)), 12839#true, 12840#false, 12841#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12842#(= 0 |ldv_malloc_#t~malloc1.offset|), 12843#(= 0 |ldv_malloc_#res.offset|), 12844#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 12845#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12846#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12847#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 12848#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 12849#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 12850#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 12851#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2)), 12852#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2)), 12853#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 12854#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)))))) (= entry_point_~array~0.offset 0)), 12855#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12856#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12857#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 12858#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 12859#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12860#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 12861#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 12862#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 12863#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base)))] [2018-02-02 10:22:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:22:05,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:22:05,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:22:05,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:22:05,658 INFO L87 Difference]: Start difference. First operand 172 states and 191 transitions. Second operand 26 states. [2018-02-02 10:22:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:08,152 INFO L93 Difference]: Finished difference Result 186 states and 203 transitions. [2018-02-02 10:22:08,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:22:08,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2018-02-02 10:22:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:08,153 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:22:08,153 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:22:08,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=625, Invalid=3797, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 10:22:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:22:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2018-02-02 10:22:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 10:22:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2018-02-02 10:22:08,156 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 93 [2018-02-02 10:22:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:08,156 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2018-02-02 10:22:08,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:22:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2018-02-02 10:22:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:22:08,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:08,157 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:08,157 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 10:22:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1474927420, now seen corresponding path program 1 times [2018-02-02 10:22:08,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:08,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:22:08,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:08,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:22:08,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:08,201 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 10:22:08,202 INFO L182 omatonBuilderFactory]: Interpolants [13312#false, 13313#(= alloc_17_~i~0 0), 13314#(<= alloc_17_~i~0 1), 13315#(<= alloc_17_~j~0 0), 13316#(<= (+ alloc_17_~j~0 1) 0), 13311#true] [2018-02-02 10:22:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:22:08,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:22:08,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:22:08,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:22:08,202 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand 6 states. [2018-02-02 10:22:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:08,250 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2018-02-02 10:22:08,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:22:08,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-02-02 10:22:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:08,252 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:22:08,252 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:22:08,252 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 10:22:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:22:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2018-02-02 10:22:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 10:22:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-02-02 10:22:08,257 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 94 [2018-02-02 10:22:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:08,257 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-02-02 10:22:08,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:22:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-02-02 10:22:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:22:08,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:08,259 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:08,259 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 10:22:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1662841855, now seen corresponding path program 2 times [2018-02-02 10:22:08,260 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:08,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:09,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:09,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:22:09,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:09,076 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 10:22:09,076 INFO L182 omatonBuilderFactory]: Interpolants [13696#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 13697#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 13698#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 13699#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 13700#(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)), 13701#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 13702#(= 0 |free_17_#t~mem9.offset|), 13678#true, 13679#false, 13680#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 13681#(= 0 |ldv_malloc_#t~malloc1.offset|), 13682#(= 0 |ldv_malloc_#res.offset|), 13683#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 13684#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13685#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 13686#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)))))), 13687#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 13688#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))) 4) 3) entry_point_~i~2)), 13689#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))))), 13690#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))))), 13691#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))), 13692#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 13693#(and (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 8))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 13694#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 13695#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)))] [2018-02-02 10:22:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:09,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:22:09,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:22:09,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:22:09,077 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 25 states. [2018-02-02 10:22:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:10,982 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-02-02 10:22:10,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:22:10,982 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 10:22:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:10,983 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:22:10,983 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:22:10,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=539, Invalid=3493, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:22:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:22:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2018-02-02 10:22:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:22:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 192 transitions. [2018-02-02 10:22:10,987 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 192 transitions. Word has length 94 [2018-02-02 10:22:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:10,987 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 192 transitions. [2018-02-02 10:22:10,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:22:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 192 transitions. [2018-02-02 10:22:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:22:10,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:10,988 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:10,988 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 10:22:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1662841854, now seen corresponding path program 2 times [2018-02-02 10:22:10,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:11,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:11,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:11,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:22:11,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:11,813 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 10:22:11,813 INFO L182 omatonBuilderFactory]: Interpolants [14144#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 14145#(= 0 |ldv_malloc_#t~malloc1.offset|), 14146#(= 0 |ldv_malloc_#res.offset|), 14147#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 14148#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 14149#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 14150#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 14151#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)))), 14152#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 14153#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 14154#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 14155#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 14156#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 14157#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset))))), 14158#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 14159#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))))), 14160#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 14161#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 14162#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 14163#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 14164#(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)), 14165#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 14166#(= |free_17_#t~mem9.base| 0), 14142#true, 14143#false] [2018-02-02 10:22:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:11,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:22:11,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:22:11,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:22:11,814 INFO L87 Difference]: Start difference. First operand 174 states and 192 transitions. Second operand 25 states. [2018-02-02 10:22:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:13,817 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-02-02 10:22:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:22:13,818 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 10:22:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:13,818 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:22:13,818 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 10:22:13,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=501, Invalid=3039, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:22:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 10:22:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 174. [2018-02-02 10:22:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:22:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-02-02 10:22:13,821 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 94 [2018-02-02 10:22:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:13,821 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-02-02 10:22:13,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:22:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-02-02 10:22:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 10:22:13,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:13,821 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:13,822 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 10:22:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash -8536178, now seen corresponding path program 1 times [2018-02-02 10:22:13,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:13,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:22:13,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:13,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:22:13,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:13,857 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 10:22:13,857 INFO L182 omatonBuilderFactory]: Interpolants [14597#true, 14598#false, 14599#(<= 10 entry_point_~len~0), 14600#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 14601#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 14602#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 14603#(<= |free_17_#in~len| 2)] [2018-02-02 10:22:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:22:13,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:22:13,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:22:13,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:13,858 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 7 states. [2018-02-02 10:22:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:13,882 INFO L93 Difference]: Finished difference Result 201 states and 214 transitions. [2018-02-02 10:22:13,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:22:13,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-02-02 10:22:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:13,883 INFO L225 Difference]: With dead ends: 201 [2018-02-02 10:22:13,883 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:22:13,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:22:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:22:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2018-02-02 10:22:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:22:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2018-02-02 10:22:13,885 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 95 [2018-02-02 10:22:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:13,886 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2018-02-02 10:22:13,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:22:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2018-02-02 10:22:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 10:22:13,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:13,886 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:13,886 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 10:22:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2117886044, now seen corresponding path program 2 times [2018-02-02 10:22:13,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:13,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 10:22:13,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:13,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:22:13,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:13,951 INFO L182 omatonBuilderFactory]: Interpolants [14992#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 14993#(<= |alloc_17_#in~len| 2), 14987#true, 14988#false, 14989#(<= 10 entry_point_~len~0), 14990#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 14991#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1))] [2018-02-02 10:22:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 10:22:13,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:22:13,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:22:13,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:13,952 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand 7 states. [2018-02-02 10:22:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:13,998 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2018-02-02 10:22:13,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:22:13,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-02-02 10:22:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:14,000 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:22:14,000 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 10:22:14,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:22:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 10:22:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2018-02-02 10:22:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 10:22:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2018-02-02 10:22:14,005 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 97 [2018-02-02 10:22:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:14,006 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2018-02-02 10:22:14,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:22:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2018-02-02 10:22:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:22:14,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:14,007 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:14,007 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 10:22:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash -711355807, now seen corresponding path program 2 times [2018-02-02 10:22:14,007 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:14,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 10:22:14,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:14,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:22:14,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:14,327 INFO L182 omatonBuilderFactory]: Interpolants [15397#true, 15398#false, 15399#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15400#(= 0 |ldv_malloc_#t~malloc1.offset|), 15401#(= 0 |ldv_malloc_#res.offset|), 15402#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15403#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15404#(= entry_point_~array~0.offset 0), 15405#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))), 15406#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))), 15407#(= 0 |alloc_17_#in~array.offset|), 15408#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15409#(= alloc_17_~array.offset 0), 15410#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 15411#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 15412#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (* 4 alloc_17_~i~0)))), 15413#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 15414#(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))))), 15415#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-02 10:22:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 10:22:14,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:22:14,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:22:14,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:22:14,328 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand 19 states. [2018-02-02 10:22:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:14,617 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2018-02-02 10:22:14,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:22:14,618 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2018-02-02 10:22:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:14,619 INFO L225 Difference]: With dead ends: 192 [2018-02-02 10:22:14,619 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:22:14,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:22:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:22:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2018-02-02 10:22:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:22:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 209 transitions. [2018-02-02 10:22:14,622 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 209 transitions. Word has length 100 [2018-02-02 10:22:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:14,623 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 209 transitions. [2018-02-02 10:22:14,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:22:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 209 transitions. [2018-02-02 10:22:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:22:14,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:14,623 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:14,623 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 10:22:14,623 INFO L82 PathProgramCache]: Analyzing trace with hash -711355806, now seen corresponding path program 2 times [2018-02-02 10:22:14,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:14,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:22:14,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:14,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:22:14,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:14,939 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 10:22:14,939 INFO L182 omatonBuilderFactory]: Interpolants [15840#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 15841#(= |#valid| |old(#valid)|), 15842#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 15843#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 15822#true, 15823#false, 15824#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15825#(= 0 |ldv_malloc_#t~malloc1.offset|), 15826#(= 0 |ldv_malloc_#res.offset|), 15827#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15828#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15829#(= entry_point_~array~0.offset 0), 15830#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))), 15831#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))), 15832#(= 0 |alloc_17_#in~array.offset|), 15833#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15834#(= alloc_17_~array.offset 0), 15835#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 15836#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 15837#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 15838#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 15839#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))))] [2018-02-02 10:22:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:22:14,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:22:14,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:22:14,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:22:14,940 INFO L87 Difference]: Start difference. First operand 188 states and 209 transitions. Second operand 22 states. [2018-02-02 10:22:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:15,279 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2018-02-02 10:22:15,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:22:15,280 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-02 10:22:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:15,280 INFO L225 Difference]: With dead ends: 193 [2018-02-02 10:22:15,280 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 10:22:15,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:22:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 10:22:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2018-02-02 10:22:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:22:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2018-02-02 10:22:15,283 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 100 [2018-02-02 10:22:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:15,283 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2018-02-02 10:22:15,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:22:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2018-02-02 10:22:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:22:15,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:15,284 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:15,284 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 10:22:15,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2012932585, now seen corresponding path program 3 times [2018-02-02 10:22:15,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:15,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 2 proven. 217 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:16,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:16,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:22:16,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:16,024 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 10:22:16,024 INFO L182 omatonBuilderFactory]: Interpolants [16264#true, 16265#false, 16266#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 16267#(= 0 |ldv_malloc_#t~malloc1.offset|), 16268#(= 0 |ldv_malloc_#res.offset|), 16269#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 16270#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 16271#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 16272#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 16273#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 16274#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16275#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 16276#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16277#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 16278#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 16279#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 16280#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 16281#(and (or (<= (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 16282#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 16283#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 16284#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 16285#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 16286#(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)), 16287#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 16288#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 16289#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:22:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 2 proven. 217 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:16,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:22:16,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:22:16,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:22:16,025 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand 26 states. [2018-02-02 10:22:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:18,094 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2018-02-02 10:22:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:22:18,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-02 10:22:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:18,095 INFO L225 Difference]: With dead ends: 202 [2018-02-02 10:22:18,095 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 10:22:18,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=554, Invalid=3736, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 10:22:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 10:22:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 193. [2018-02-02 10:22:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 10:22:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2018-02-02 10:22:18,099 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 99 [2018-02-02 10:22:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:18,099 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2018-02-02 10:22:18,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:22:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2018-02-02 10:22:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 10:22:18,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:18,100 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:18,101 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 10:22:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1962001838, now seen corresponding path program 1 times [2018-02-02 10:22:18,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:18,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:22:18,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:18,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:22:18,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:18,272 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 10:22:18,272 INFO L182 omatonBuilderFactory]: Interpolants [16768#(= 0 |ldv_malloc_#t~malloc1.offset|), 16769#(= 0 |ldv_malloc_#res.offset|), 16770#(= 0 |entry_point_#t~ret10.offset|), 16771#(= 0 entry_point_~array~0.offset), 16772#(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|)), 16773#(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|)), 16774#(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|)), 16775#(or (<= 4 (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 16776#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 16777#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 16778#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 16766#true, 16767#false] [2018-02-02 10:22:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:22:18,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:22:18,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:22:18,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:22:18,273 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand 13 states. [2018-02-02 10:22:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:18,446 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2018-02-02 10:22:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:22:18,446 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-02-02 10:22:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:18,447 INFO L225 Difference]: With dead ends: 202 [2018-02-02 10:22:18,447 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 10:22:18,447 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 10:22:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 10:22:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 193. [2018-02-02 10:22:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 10:22:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-02-02 10:22:18,449 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 101 [2018-02-02 10:22:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:18,450 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-02-02 10:22:18,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:22:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-02-02 10:22:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:22:18,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:18,451 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:18,451 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 10:22:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2023599253, now seen corresponding path program 3 times [2018-02-02 10:22:18,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:18,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:22:19,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:19,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:22:19,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:19,157 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 10:22:19,157 INFO L182 omatonBuilderFactory]: Interpolants [17180#true, 17181#false, 17182#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17183#(= 0 |ldv_malloc_#t~malloc1.offset|), 17184#(= 0 |ldv_malloc_#res.offset|), 17185#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17186#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17187#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 40 (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17188#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) 4))) 4) 1) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) 4))))), 17189#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) 4)))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) 4))) 4) 2) entry_point_~i~2)), 17190#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) 4)))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) 4))) 4) 3) entry_point_~i~2)), 17191#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) 4)))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) 4))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 17192#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) 4))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) 4)))) (= entry_point_~array~0.offset 0)), 17193#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) 4)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17194#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ (* 4 entry_point_~i~2) 8) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17195#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ (* 4 entry_point_~i~2) 8) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17196#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 17197#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (= entry_point_~array~0.offset 0)), 17198#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 17199#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ 8 4)))), 17200#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ 8 4))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 17201#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)) 4)))), 17202#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))), 17203#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 17204#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 10:22:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:22:19,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:22:19,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:22:19,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:22:19,157 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 25 states. [2018-02-02 10:22:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:20,948 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-02-02 10:22:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:22:20,949 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-02 10:22:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:20,950 INFO L225 Difference]: With dead ends: 206 [2018-02-02 10:22:20,950 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 10:22:20,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=477, Invalid=3429, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:22:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 10:22:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2018-02-02 10:22:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 10:22:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2018-02-02 10:22:20,953 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 100 [2018-02-02 10:22:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:20,954 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2018-02-02 10:22:20,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:22:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2018-02-02 10:22:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:22:20,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:20,955 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:20,955 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 10:22:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2023599252, now seen corresponding path program 3 times [2018-02-02 10:22:20,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:20,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:22:21,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:21,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:22:21,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:21,781 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 10:22:21,781 INFO L182 omatonBuilderFactory]: Interpolants [17682#true, 17683#false, 17684#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17685#(= 0 |ldv_malloc_#t~malloc1.offset|), 17686#(= 0 |ldv_malloc_#res.offset|), 17687#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17688#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17689#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17690#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 17691#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)))) 4) 2) entry_point_~i~2)), 17692#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (= entry_point_~array~0.offset 0)), 17693#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))) 4) 4) entry_point_~i~2)), 17694#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))))), 17695#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= 0 entry_point_~array~0.offset)), 17696#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))), 17697#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 17698#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 17699#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))), 17700#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 17701#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 17702#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 17703#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 17704#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 17705#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 17706#(= |free_17_#t~mem9.base| 0)] [2018-02-02 10:22:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 10:22:21,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:22:21,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:22:21,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:22:21,782 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand 25 states. [2018-02-02 10:22:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:23,577 INFO L93 Difference]: Finished difference Result 205 states and 222 transitions. [2018-02-02 10:22:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:22:23,577 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-02 10:22:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:23,578 INFO L225 Difference]: With dead ends: 205 [2018-02-02 10:22:23,578 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 10:22:23,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=434, Invalid=2872, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:22:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 10:22:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2018-02-02 10:22:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 10:22:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 214 transitions. [2018-02-02 10:22:23,581 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 214 transitions. Word has length 100 [2018-02-02 10:22:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:23,582 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 214 transitions. [2018-02-02 10:22:23,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:22:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 214 transitions. [2018-02-02 10:22:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:22:23,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:23,583 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:23,583 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 10:22:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash -713129662, now seen corresponding path program 2 times [2018-02-02 10:22:23,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:23,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 10:22:24,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:24,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:22:24,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:24,083 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 10:22:24,083 INFO L182 omatonBuilderFactory]: Interpolants [18176#(= 0 |ldv_malloc_#t~malloc1.offset|), 18177#(= 0 |ldv_malloc_#res.offset|), 18178#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 18179#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 18180#(= entry_point_~array~0.offset 0), 18181#(and (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) 4)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 18182#(and (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~len~0) (* 4 entry_point_~i~2))) (= entry_point_~array~0.offset 0)), 18183#(= 0 |alloc_17_#in~array.offset|), 18184#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 18185#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 18186#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 18187#(= |#valid| |old(#valid)|), 18188#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 18189#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 18190#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 18191#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 18192#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 18193#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 18194#(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))), 18195#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 18196#(= 1 (select |#valid| alloc_17_~array.base)), 18173#true, 18174#false, 18175#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10))] [2018-02-02 10:22:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 10:22:24,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:22:24,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:22:24,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:22:24,084 INFO L87 Difference]: Start difference. First operand 194 states and 214 transitions. Second operand 24 states. [2018-02-02 10:22:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:24,505 INFO L93 Difference]: Finished difference Result 210 states and 229 transitions. [2018-02-02 10:22:24,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:22:24,506 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 102 [2018-02-02 10:22:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:24,506 INFO L225 Difference]: With dead ends: 210 [2018-02-02 10:22:24,506 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 10:22:24,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:22:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 10:22:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2018-02-02 10:22:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 10:22:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2018-02-02 10:22:24,508 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 102 [2018-02-02 10:22:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:24,509 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2018-02-02 10:22:24,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:22:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2018-02-02 10:22:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:22:24,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:24,509 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:24,510 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 10:22:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash 692514855, now seen corresponding path program 1 times [2018-02-02 10:22:24,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:24,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:24,606 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-02-02 10:22:24,607 ERROR L119 erpolLogProxyWrapper]: Interpolant 82 not inductive: (Check returned sat) [2018-02-02 10:22:24,608 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:22:24,613 INFO L168 Benchmark]: Toolchain (without parser) took 42180.35 ms. Allocated memory was 407.4 MB in the beginning and 1.3 GB in the end (delta: 887.1 MB). Free memory was 364.0 MB in the beginning and 845.1 MB in the end (delta: -481.2 MB). Peak memory consumption was 405.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:24,614 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 407.4 MB. Free memory is still 370.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:22:24,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.62 ms. Allocated memory is still 407.4 MB. Free memory was 364.0 MB in the beginning and 350.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:24,614 INFO L168 Benchmark]: Boogie Preprocessor took 21.63 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 349.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:24,615 INFO L168 Benchmark]: RCFGBuilder took 229.57 ms. Allocated memory is still 407.4 MB. Free memory was 349.4 MB in the beginning and 324.1 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:24,615 INFO L168 Benchmark]: TraceAbstraction took 41766.59 ms. Allocated memory was 407.4 MB in the beginning and 1.3 GB in the end (delta: 887.1 MB). Free memory was 324.1 MB in the beginning and 845.1 MB in the end (delta: -521.1 MB). Peak memory consumption was 366.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:24,616 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.13 ms. Allocated memory is still 407.4 MB. Free memory is still 370.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.62 ms. Allocated memory is still 407.4 MB. Free memory was 364.0 MB in the beginning and 350.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.63 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 349.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 229.57 ms. Allocated memory is still 407.4 MB. Free memory was 349.4 MB in the beginning and 324.1 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 41766.59 ms. Allocated memory was 407.4 MB in the beginning and 1.3 GB in the end (delta: 887.1 MB). Free memory was 324.1 MB in the beginning and 845.1 MB in the end (delta: -521.1 MB). Peak memory consumption was 366.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-22-24-622.csv Received shutdown request...