java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:19:17,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:19:17,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:19:17,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:19:17,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:19:17,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:19:17,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:19:17,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:19:17,605 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:19:17,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:19:17,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:19:17,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:19:17,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:19:17,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:19:17,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:19:17,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:19:17,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:19:17,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:19:17,615 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:19:17,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:19:17,617 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:19:17,617 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:19:17,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:19:17,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:19:17,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:19:17,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:19:17,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:19:17,620 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:19:17,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:19:17,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:19:17,621 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:19:17,621 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:19:17,631 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:19:17,631 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:19:17,632 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:19:17,632 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:19:17,632 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:19:17,632 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:19:17,633 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:19:17,633 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:19:17,633 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:19:17,633 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:19:17,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:19:17,633 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:19:17,633 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:19:17,633 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:19:17,634 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:19:17,634 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:19:17,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:19:17,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:19:17,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:19:17,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:19:17,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:19:17,635 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:19:17,635 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:19:17,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:19:17,677 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:19:17,681 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:19:17,682 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:19:17,682 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:19:17,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-02-02 20:19:17,828 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:19:17,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:19:17,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:19:17,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:19:17,836 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:19:17,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:19:17" (1/1) ... [2018-02-02 20:19:17,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe43571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17, skipping insertion in model container [2018-02-02 20:19:17,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:19:17" (1/1) ... [2018-02-02 20:19:17,854 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:19:17,882 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:19:17,969 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:19:17,981 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:19:17,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17 WrapperNode [2018-02-02 20:19:17,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:19:17,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:19:17,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:19:17,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:19:17,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17" (1/1) ... [2018-02-02 20:19:18,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17" (1/1) ... [2018-02-02 20:19:18,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17" (1/1) ... [2018-02-02 20:19:18,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17" (1/1) ... [2018-02-02 20:19:18,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17" (1/1) ... [2018-02-02 20:19:18,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17" (1/1) ... [2018-02-02 20:19:18,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17" (1/1) ... [2018-02-02 20:19:18,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:19:18,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:19:18,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:19:18,017 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:19:18,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:19:18,056 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:19:18,056 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:19:18,056 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 20:19:18,056 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:19:18,056 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:19:18,056 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:19:18,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:19:18,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:19:18,057 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:19:18,057 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:19:18,057 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:19:18,057 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:19:18,057 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 20:19:18,057 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:19:18,057 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:19:18,057 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:19:18,208 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:19:18,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:19:18 BoogieIcfgContainer [2018-02-02 20:19:18,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:19:18,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:19:18,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:19:18,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:19:18,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:19:17" (1/3) ... [2018-02-02 20:19:18,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f26c78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:19:18, skipping insertion in model container [2018-02-02 20:19:18,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:17" (2/3) ... [2018-02-02 20:19:18,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f26c78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:19:18, skipping insertion in model container [2018-02-02 20:19:18,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:19:18" (3/3) ... [2018-02-02 20:19:18,213 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-02-02 20:19:18,218 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:19:18,224 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 20:19:18,248 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:19:18,248 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:19:18,248 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:19:18,248 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:19:18,248 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:19:18,248 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:19:18,248 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:19:18,248 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:19:18,249 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:19:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-02 20:19:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 20:19:18,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:18,272 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:18,272 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1159416495, now seen corresponding path program 1 times [2018-02-02 20:19:18,323 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:18,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:18,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:19:18,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,389 INFO L182 omatonBuilderFactory]: Interpolants [62#true, 63#false] [2018-02-02 20:19:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 20:19:18,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 20:19:18,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:19:18,404 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-02-02 20:19:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:18,418 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-02-02 20:19:18,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 20:19:18,419 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-02 20:19:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:18,425 INFO L225 Difference]: With dead ends: 59 [2018-02-02 20:19:18,425 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 20:19:18,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:19:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 20:19:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 20:19:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 20:19:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 20:19:18,517 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2018-02-02 20:19:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:18,517 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 20:19:18,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 20:19:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 20:19:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:19:18,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:18,518 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:18,518 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:18,518 INFO L82 PathProgramCache]: Analyzing trace with hash 91943959, now seen corresponding path program 1 times [2018-02-02 20:19:18,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:18,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:18,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:19:18,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,582 INFO L182 omatonBuilderFactory]: Interpolants [179#true, 180#false, 181#(= 1 (select |#valid| |main_#t~malloc7.base|)), 182#(= 1 (select |#valid| |main_#t~post8.base|))] [2018-02-02 20:19:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:19:18,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:19:18,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:19:18,584 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 4 states. [2018-02-02 20:19:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:18,683 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-02 20:19:18,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:19:18,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 20:19:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:18,684 INFO L225 Difference]: With dead ends: 55 [2018-02-02 20:19:18,684 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 20:19:18,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 20:19:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 20:19:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 20:19:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-02 20:19:18,690 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 14 [2018-02-02 20:19:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:18,690 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-02 20:19:18,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:19:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-02 20:19:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:19:18,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:18,691 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:18,691 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:18,691 INFO L82 PathProgramCache]: Analyzing trace with hash 91943960, now seen corresponding path program 1 times [2018-02-02 20:19:18,692 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:18,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:18,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:19:18,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,770 INFO L182 omatonBuilderFactory]: Interpolants [295#true, 296#false, 297#(<= 1 ~n), 298#(and (= 0 |main_#t~malloc7.offset|) (<= 4 (select |#length| |main_#t~malloc7.base|))), 299#(and (= |main_#t~post8.offset| 0) (<= 4 (select |#length| |main_#t~post8.base|)))] [2018-02-02 20:19:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:19:18,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:19:18,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:18,770 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-02-02 20:19:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:18,858 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-02-02 20:19:18,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:19:18,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:19:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:18,859 INFO L225 Difference]: With dead ends: 54 [2018-02-02 20:19:18,860 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 20:19:18,860 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 20:19:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 20:19:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 20:19:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-02-02 20:19:18,863 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 14 [2018-02-02 20:19:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:18,863 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-02-02 20:19:18,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:19:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-02-02 20:19:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:19:18,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:18,864 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:18,864 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:18,864 INFO L82 PathProgramCache]: Analyzing trace with hash -255124515, now seen corresponding path program 1 times [2018-02-02 20:19:18,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:18,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:18,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:19:18,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,934 INFO L182 omatonBuilderFactory]: Interpolants [416#(or (= ~a.base |main_#t~malloc7.base|) (= 1 (select |#valid| ~a.base))), 417#(or (= 1 (select |#valid| ~a.base)) (= ~a.base |main_#t~post8.base|)), 412#true, 413#false, 414#(= 1 (select |#valid| |main_#t~malloc6.base|)), 415#(= 1 (select |#valid| ~a.base))] [2018-02-02 20:19:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:18,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:19:18,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:19:18,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:19:18,935 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-02-02 20:19:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:18,997 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-02 20:19:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:19:18,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 20:19:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:18,999 INFO L225 Difference]: With dead ends: 51 [2018-02-02 20:19:18,999 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 20:19:18,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 20:19:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 20:19:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 20:19:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-02 20:19:19,003 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-02-02 20:19:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:19,003 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-02 20:19:19,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:19:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-02 20:19:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:19:19,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:19,004 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:19,004 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash -255124514, now seen corresponding path program 1 times [2018-02-02 20:19:19,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:19,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:19,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:19:19,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,100 INFO L182 omatonBuilderFactory]: Interpolants [528#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 4 (select |#length| ~a.base))), 522#true, 523#false, 524#(<= 1 ~n), 525#(and (= 0 |main_#t~malloc6.offset|) (<= 1 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc6.base|))), 526#(and (<= 1 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 527#(and (= foo_~i~0 0) (<= 1 ~n) (= ~a.offset 0) (= (select |#length| ~a.base) (* 4 ~n)))] [2018-02-02 20:19:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:19,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:19,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:19,100 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 7 states. [2018-02-02 20:19:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:19,173 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-02 20:19:19,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:19:19,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-02 20:19:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:19,176 INFO L225 Difference]: With dead ends: 61 [2018-02-02 20:19:19,176 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 20:19:19,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:19:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 20:19:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-02-02 20:19:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 20:19:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-02 20:19:19,180 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-02-02 20:19:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:19,180 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-02 20:19:19,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-02 20:19:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:19:19,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:19,181 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:19,181 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash 468265909, now seen corresponding path program 1 times [2018-02-02 20:19:19,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:19,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:19,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:19:19,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,242 INFO L182 omatonBuilderFactory]: Interpolants [644#true, 645#false, 646#(<= ~n 1), 647#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 1)), 648#(and (= ~a.offset 0) (<= ~n 1)), 649#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset 4))), 650#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 20:19:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:19,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:19,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:19,243 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2018-02-02 20:19:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:19,343 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-02 20:19:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:19:19,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 20:19:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:19,344 INFO L225 Difference]: With dead ends: 92 [2018-02-02 20:19:19,345 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 20:19:19,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:19:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 20:19:19,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-02-02 20:19:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 20:19:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-02-02 20:19:19,348 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-02-02 20:19:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:19,348 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-02-02 20:19:19,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-02-02 20:19:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:19:19,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:19,349 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:19,349 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:19,349 INFO L82 PathProgramCache]: Analyzing trace with hash -504403376, now seen corresponding path program 1 times [2018-02-02 20:19:19,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:19,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:19,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:19:19,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,476 INFO L182 omatonBuilderFactory]: Interpolants [823#true, 824#false, 825#(<= 1 ~n), 826#(<= 2 ~n), 827#(and (= 0 |main_#t~malloc6.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc6.base|)) (<= 2 ~n)), 828#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 2 ~n)), 829#(and (= foo_~i~0 0) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 2 ~n)), 830#(and (= ~a.offset 0) (<= (+ foo_~i~0 1) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 831#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 4) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 20:19:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:19:19,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:19:19,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:19,477 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2018-02-02 20:19:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:19,645 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-02-02 20:19:19,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:19:19,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-02 20:19:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:19,646 INFO L225 Difference]: With dead ends: 111 [2018-02-02 20:19:19,646 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 20:19:19,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:19:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 20:19:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2018-02-02 20:19:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 20:19:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-02-02 20:19:19,651 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 27 [2018-02-02 20:19:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:19,651 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-02-02 20:19:19,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:19:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-02-02 20:19:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:19:19,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:19,652 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] [2018-02-02 20:19:19,652 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash 616992647, now seen corresponding path program 1 times [2018-02-02 20:19:19,653 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:19,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:19,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:19,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:19:19,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,685 INFO L182 omatonBuilderFactory]: Interpolants [1025#true, 1026#false, 1027#(= |main_#t~post8.base| ~b.base), 1028#(= 1 (select |#valid| ~b.base))] [2018-02-02 20:19:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:19,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:19:19,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:19:19,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:19:19,686 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 4 states. [2018-02-02 20:19:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:19,715 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-02 20:19:19,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:19:19,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 20:19:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:19,716 INFO L225 Difference]: With dead ends: 77 [2018-02-02 20:19:19,716 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 20:19:19,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 20:19:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 20:19:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 20:19:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-02 20:19:19,721 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2018-02-02 20:19:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:19,721 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-02 20:19:19,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:19:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-02 20:19:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:19:19,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:19,722 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] [2018-02-02 20:19:19,722 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:19,723 INFO L82 PathProgramCache]: Analyzing trace with hash 616992648, now seen corresponding path program 1 times [2018-02-02 20:19:19,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:19,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:19,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:19,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:19:19,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,806 INFO L182 omatonBuilderFactory]: Interpolants [1185#true, 1186#false, 1187#(<= 1 ~n), 1188#(and (= 0 |main_#t~malloc7.offset|) (<= 1 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 1189#(and (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset (+ (* 4 ~n) |main_#t~post8.offset|))), 1190#(and (<= 4 ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset (* 4 ~n))), 1191#(and (<= 4 ~b.offset) (<= ~b.offset (select |#length| ~b.base)))] [2018-02-02 20:19:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:19,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:19,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:19,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:19,806 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-02-02 20:19:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:19,901 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-02-02 20:19:19,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:19:19,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 20:19:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:19,902 INFO L225 Difference]: With dead ends: 76 [2018-02-02 20:19:19,902 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 20:19:19,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 20:19:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 20:19:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 20:19:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-02-02 20:19:19,907 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 29 [2018-02-02 20:19:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:19,907 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-02-02 20:19:19,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-02-02 20:19:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:19:19,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:19,908 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:19,909 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1946902913, now seen corresponding path program 1 times [2018-02-02 20:19:19,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:19,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:19,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:19,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:19:19,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:19,970 INFO L182 omatonBuilderFactory]: Interpolants [1348#true, 1349#false, 1350#(and (<= 1 ~n) (<= ~n 1)), 1351#(and (<= 8 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ (select |#length| ~b.base) 4)))] [2018-02-02 20:19:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:19,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:19:19,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:19:19,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:19:19,971 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 4 states. [2018-02-02 20:19:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:20,030 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-02-02 20:19:20,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:19:20,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 20:19:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:20,031 INFO L225 Difference]: With dead ends: 90 [2018-02-02 20:19:20,031 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 20:19:20,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 20:19:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-02-02 20:19:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 20:19:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-02 20:19:20,038 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 30 [2018-02-02 20:19:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:20,038 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-02 20:19:20,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:19:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-02 20:19:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:19:20,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:20,039 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:20,039 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash 746385703, now seen corresponding path program 2 times [2018-02-02 20:19:20,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:20,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:20,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:20,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:19:20,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:20,109 INFO L182 omatonBuilderFactory]: Interpolants [1522#true, 1523#false, 1524#(<= ~n 1), 1525#(<= ~n 2), 1526#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 2)), 1527#(and (= ~a.offset 0) (<= ~n 2)), 1528#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset 8))), 1529#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset 4))), 1530#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 20:19:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:20,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:19:20,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:19:20,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:20,110 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-02-02 20:19:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:20,297 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2018-02-02 20:19:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:19:20,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 20:19:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:20,298 INFO L225 Difference]: With dead ends: 136 [2018-02-02 20:19:20,299 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 20:19:20,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:19:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 20:19:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-02-02 20:19:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 20:19:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-02 20:19:20,303 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2018-02-02 20:19:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:20,303 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-02 20:19:20,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:19:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-02 20:19:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:19:20,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:20,304 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:20,304 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:20,305 INFO L82 PathProgramCache]: Analyzing trace with hash 946337879, now seen corresponding path program 1 times [2018-02-02 20:19:20,305 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:20,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:20,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:20,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:19:20,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:20,353 INFO L182 omatonBuilderFactory]: Interpolants [1792#true, 1793#false, 1794#(= 0 |main_#t~malloc7.offset|), 1795#(and (= |main_#t~post8.offset| 0) (<= ~b.offset 4)), 1796#(<= ~b.offset 4), 1797#(and (<= 4 ~b.offset) (<= ~b.offset 4))] [2018-02-02 20:19:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:20,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:19:20,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:19:20,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:19:20,354 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 6 states. [2018-02-02 20:19:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:20,389 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-02-02 20:19:20,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:19:20,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-02 20:19:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:20,390 INFO L225 Difference]: With dead ends: 107 [2018-02-02 20:19:20,390 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 20:19:20,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 20:19:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-02 20:19:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 20:19:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-02 20:19:20,395 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 33 [2018-02-02 20:19:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:20,395 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-02 20:19:20,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:19:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-02 20:19:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:19:20,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:20,397 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:20,397 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:20,397 INFO L82 PathProgramCache]: Analyzing trace with hash 946337880, now seen corresponding path program 1 times [2018-02-02 20:19:20,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:20,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:20,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:20,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:19:20,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:20,513 INFO L182 omatonBuilderFactory]: Interpolants [2018#true, 2019#false, 2020#(and (not (= 0 |main_#t~malloc6.base|)) (= 1 (select |#valid| |main_#t~malloc6.base|))), 2021#(and (= 1 (select |#valid| ~a.base)) (not (= 0 ~a.base))), 2022#(and (not (= ~a.base |main_#t~malloc7.base|)) (not (= 0 ~a.base))), 2023#(and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (not (= 0 ~a.base))), 2024#(and (= 1 (select (store |#valid| ~a.base 0) ~b.base)) (not (= 0 ~a.base))), 2025#(= 1 (select |#valid| ~b.base))] [2018-02-02 20:19:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:20,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:19:20,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:19:20,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:19:20,513 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 8 states. [2018-02-02 20:19:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:20,603 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-02 20:19:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:19:20,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-02 20:19:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:20,603 INFO L225 Difference]: With dead ends: 105 [2018-02-02 20:19:20,603 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 20:19:20,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:19:20,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 20:19:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-02 20:19:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 20:19:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-02-02 20:19:20,607 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 33 [2018-02-02 20:19:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:20,607 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-02-02 20:19:20,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:19:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-02-02 20:19:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:19:20,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:20,608 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:20,608 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash 946329935, now seen corresponding path program 1 times [2018-02-02 20:19:20,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:20,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:20,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:20,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:19:20,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:20,844 INFO L182 omatonBuilderFactory]: Interpolants [2251#true, 2252#false, 2253#(= 1 ~n), 2254#(and (= (select |#valid| |main_#t~malloc6.base|) 1) (= 1 ~n)), 2255#(and (= (select |#valid| ~a.base) 1) (= 1 ~n)), 2256#(and (not (= ~a.base |main_#t~malloc7.base|)) (= |main_#t~malloc7.offset| 0) (= 1 ~n)), 2257#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (not (= |main_#t~post8.base| ~a.base)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 8)) (= 1 ~n)), 2258#(and (not (= ~a.base ~b.base)) (or (not (= 8 (+ ~b.offset (* 4 ~n)))) (= 1 (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (<= ~b.offset 4) (= 1 ~n)), 2259#(= |#memory_int| |old(#memory_int)|), 2260#(or (not (= 1 ~n)) (= |#memory_int| |old(#memory_int)|)), 2261#(or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (not (= 1 ~n))), 2262#(and (or (not (= 8 (+ ~b.offset (* 4 ~n)))) (= 1 (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (<= ~b.offset 4) (= 1 ~n)), 2263#(and (= 1 (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 8 (+ ~b.offset (* 4 ~n))) (= 1 |main_#t~mem10|) (= 1 ~n)), 2264#(and (= |main_#t~mem11| 1) (= 1 |main_#t~mem10|))] [2018-02-02 20:19:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:20,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:19:20,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:19:20,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:19:20,845 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 14 states. [2018-02-02 20:19:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:21,165 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-02-02 20:19:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:19:21,165 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-02-02 20:19:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:21,171 INFO L225 Difference]: With dead ends: 113 [2018-02-02 20:19:21,171 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 20:19:21,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:19:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 20:19:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-02-02 20:19:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 20:19:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-02 20:19:21,175 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 33 [2018-02-02 20:19:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:21,175 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-02 20:19:21,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:19:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-02 20:19:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:19:21,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:21,176 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:21,177 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:21,177 INFO L82 PathProgramCache]: Analyzing trace with hash 529142380, now seen corresponding path program 1 times [2018-02-02 20:19:21,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:21,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:19:21,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:21,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:19:21,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:21,298 INFO L182 omatonBuilderFactory]: Interpolants [2512#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 2 ~n)), 2513#(and (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ ~b.offset 4) (+ (* 4 ~n) |main_#t~post8.offset|))), 2514#(and (<= (+ ~b.offset 4) (* 4 ~n)) (<= 4 ~b.offset) (= (* 4 ~n) (select |#length| ~b.base))), 2515#(and (<= (+ ~b.offset 4) (* 4 ~n)) (= foo_~i~0 0) (<= 4 ~b.offset) (= (* 4 ~n) (select |#length| ~b.base))), 2516#(and (= foo_~i~0 0) (<= 4 ~b.offset) (<= (+ ~b.offset 4) (select |#length| ~b.base))), 2508#true, 2509#false, 2510#(<= 1 ~n), 2511#(<= 2 ~n)] [2018-02-02 20:19:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:19:21,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:19:21,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:19:21,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:21,299 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-02-02 20:19:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:21,434 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-02-02 20:19:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:19:21,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-02 20:19:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:21,435 INFO L225 Difference]: With dead ends: 113 [2018-02-02 20:19:21,435 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 20:19:21,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:19:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 20:19:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-02-02 20:19:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 20:19:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-02-02 20:19:21,439 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 34 [2018-02-02 20:19:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:21,439 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-02-02 20:19:21,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:19:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-02-02 20:19:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:19:21,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:21,441 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:21,441 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:21,441 INFO L82 PathProgramCache]: Analyzing trace with hash 569056812, now seen corresponding path program 3 times [2018-02-02 20:19:21,442 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:21,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:19:21,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:21,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:19:21,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:21,574 INFO L182 omatonBuilderFactory]: Interpolants [2741#true, 2742#false, 2743#(and (= 0 |main_#t~malloc6.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc6.base|))), 2744#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2745#(and (= ~a.offset 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (= (select |#length| ~a.base) (* 4 ~n))), 2746#(and (= ~a.offset 0) (= (select |#length| ~a.base) (* 4 ~n)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2747#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 4) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 20:19:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:19:21,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:21,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:21,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:21,574 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 7 states. [2018-02-02 20:19:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:21,634 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-02-02 20:19:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:19:21,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-02 20:19:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:21,635 INFO L225 Difference]: With dead ends: 107 [2018-02-02 20:19:21,635 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 20:19:21,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 20:19:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-02-02 20:19:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 20:19:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-02-02 20:19:21,639 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 34 [2018-02-02 20:19:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:21,639 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-02-02 20:19:21,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-02-02 20:19:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:19:21,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:21,640 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:21,640 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1102363112, now seen corresponding path program 1 times [2018-02-02 20:19:21,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:21,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:21,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:21,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:19:21,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:21,796 INFO L182 omatonBuilderFactory]: Interpolants [2964#true, 2965#false, 2966#(= |#valid| |old(#valid)|), 2967#(and (not (= 0 |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|)), 2968#(and (not (= 0 ~a.base)) (= |old(#valid)| (store |#valid| ~a.base 0))), 2969#(and (or (= ~a.base |main_#t~malloc7.base|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) ~a.base (select (store |#valid| ~a.base 0) ~a.base)))) (not (= |main_#t~malloc7.base| 0)) (not (= 0 ~a.base))), 2970#(and (or (and (= (store (store |#valid| ~b.base 0) ~a.base (select (store |#valid| ~a.base 0) ~a.base)) |old(#valid)|) (not (= ~a.base ~b.base))) (= |main_#t~post8.base| ~a.base)) (or (not (= |main_#t~post8.base| ~a.base)) (= ~a.base ~b.base)) (not (= ~b.base 0)) (not (= 0 ~a.base))), 2971#(and (or (= (store (store |#valid| ~b.base 0) ~a.base (select (store |#valid| ~a.base 0) ~a.base)) |old(#valid)|) (= ~a.base ~b.base)) (not (= ~b.base 0)) (not (= 0 ~a.base))), 2972#(and (or (= 0 (select |#valid| ~b.base)) (= |old(#valid)| (store |#valid| ~b.base (select (store |#valid| ~b.base 0) ~b.base)))) (not (= ~b.base 0)))] [2018-02-02 20:19:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:21,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:19:21,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:19:21,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:21,797 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 9 states. [2018-02-02 20:19:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:21,950 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-02-02 20:19:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:19:21,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 20:19:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:21,951 INFO L225 Difference]: With dead ends: 104 [2018-02-02 20:19:21,951 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 20:19:21,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:19:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 20:19:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-02 20:19:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 20:19:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-02 20:19:21,953 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 35 [2018-02-02 20:19:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:21,953 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-02 20:19:21,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:19:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-02 20:19:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:19:21,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:21,954 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:21,954 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash 984721596, now seen corresponding path program 1 times [2018-02-02 20:19:21,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:21,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:19:22,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:22,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:19:22,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:22,013 INFO L182 omatonBuilderFactory]: Interpolants [3168#(<= 2 ~n), 3169#(<= (+ (* 4 foo_~i~0) ~b.offset 4) (select |#length| ~b.base)), 3170#(<= (+ (* 4 foo_~i~0) ~b.offset) (select |#length| ~b.base)), 3171#(<= (+ ~b.offset (* 4 ~n)) (+ (select |#length| ~b.base) 4)), 3172#(and (<= (+ ~b.offset (* 4 ~n)) (+ (select |#length| ~b.base) 4)) (<= 2 ~n)), 3173#(and (<= 12 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ (select |#length| ~b.base) 4))), 3165#true, 3166#false, 3167#(<= 1 ~n)] [2018-02-02 20:19:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:19:22,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:19:22,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:19:22,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:22,013 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-02-02 20:19:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:22,076 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-02-02 20:19:22,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:19:22,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-02 20:19:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:22,110 INFO L225 Difference]: With dead ends: 77 [2018-02-02 20:19:22,110 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 20:19:22,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:19:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 20:19:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 20:19:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 20:19:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-02-02 20:19:22,115 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 41 [2018-02-02 20:19:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:22,115 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-02-02 20:19:22,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:19:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-02-02 20:19:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:19:22,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:22,116 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:22,116 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:22,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1657687266, now seen corresponding path program 1 times [2018-02-02 20:19:22,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:22,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:19:22,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:22,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:19:22,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:22,163 INFO L182 omatonBuilderFactory]: Interpolants [3344#(<= (+ foo_~i~0 1) ~n), 3337#true, 3338#false, 3339#(<= 1 ~n), 3340#(<= 2 ~n), 3341#(<= 3 ~n), 3342#(and (= foo_~i~0 0) (<= 3 ~n)), 3343#(<= (+ foo_~i~0 2) ~n)] [2018-02-02 20:19:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:19:22,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:19:22,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:19:22,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:19:22,164 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 8 states. [2018-02-02 20:19:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:22,237 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-02-02 20:19:22,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:19:22,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-02-02 20:19:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:22,238 INFO L225 Difference]: With dead ends: 90 [2018-02-02 20:19:22,238 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 20:19:22,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:19:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 20:19:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-02-02 20:19:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 20:19:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-02-02 20:19:22,241 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 41 [2018-02-02 20:19:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:22,241 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-02-02 20:19:22,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:19:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-02-02 20:19:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:19:22,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:22,242 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:22,242 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1214448692, now seen corresponding path program 1 times [2018-02-02 20:19:22,242 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:22,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:22,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:22,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:19:22,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:22,722 INFO L182 omatonBuilderFactory]: Interpolants [3527#true, 3528#false, 3529#(and (<= 1 ~n) (<= ~n 1)), 3530#(and (<= ~n 2) (<= 2 ~n)), 3531#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 2) (<= 2 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 3532#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= ~n 2) (<= 2 ~n)), 3533#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= ~n 2) (<= 2 ~n)), 3534#(and (= |main_#t~post8.offset| 0) (= ~a.offset 0) (or (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 12)) (<= 2 ~n)) (not (= ~b.offset 4))) (<= ~b.offset 4)), 3535#(and (= ~a.offset 0) (or (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~b.offset (* 4 ~n)) 12) (<= 2 ~n)) (not (= ~b.offset 4))) (<= ~b.offset 4)), 3536#(= |#memory_int| |old(#memory_int)|), 3537#(and (= foo_~i~0 0) (= |#memory_int| |old(#memory_int)|)), 3538#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3539#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 1) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3540#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (<= 1 ~a.offset) (= ~a.offset 0))), 3541#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 ~a.offset) (or (= foo_~i~0 0) (<= 1 ~a.offset))), 3542#(or (= ~a.base ~b.base) (and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 11)) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ foo_~i~0 1) 0) (<= 13 (+ ~b.offset (* 4 ~n)))) (or (= (+ (* 4 foo_~i~0) 4) 0) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (not (= ~b.offset 4))), 3543#(or (and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 11)) (<= foo_~i~0 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= 13 (+ ~b.offset (* 4 ~n)))) (or (<= (* 4 foo_~i~0) 0) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (= ~a.base ~b.base) (not (= ~b.offset 4))), 3544#(or (= ~a.base ~b.base) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= ~b.offset (+ ~a.offset 3)) (<= 13 (+ ~b.offset (* 4 ~n))) (<= ~n 1)) (or (<= (* 4 ~n) 4) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (not (= ~b.offset 4))), 3545#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= ~b.offset 4))) (<= ~b.offset 4)), 3546#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= ~b.offset 4)), 3547#(and (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|) (< |main_#t~mem10| (+ |main_#t~mem11| 1)) (= ~b.offset 4))] [2018-02-02 20:19:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:22,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:19:22,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:19:22,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:19:22,722 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 21 states. [2018-02-02 20:19:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:23,782 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-02 20:19:23,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:19:23,783 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-02-02 20:19:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:23,783 INFO L225 Difference]: With dead ends: 95 [2018-02-02 20:19:23,783 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 20:19:23,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:19:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 20:19:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-02-02 20:19:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 20:19:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-02 20:19:23,785 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2018-02-02 20:19:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:23,785 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-02 20:19:23,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:19:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-02 20:19:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:19:23,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:23,786 INFO L351 BasicCegarLoop]: trace histogram [4, 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] [2018-02-02 20:19:23,786 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:23,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1501091225, now seen corresponding path program 2 times [2018-02-02 20:19:23,787 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:23,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:19:23,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:23,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:19:23,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:23,896 INFO L182 omatonBuilderFactory]: Interpolants [3746#true, 3747#false, 3748#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 3749#(and (= |main_#t~post8.offset| 0) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (= (* 4 ~n) (select |#length| ~b.base))), 3750#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset 4)), 3751#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= 0 (+ (* 4 foo_~i~0) ~b.offset)) (<= ~b.offset 4)), 3752#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= 4 (+ (* 4 foo_~i~0) ~b.offset)) (<= ~b.offset 4)), 3753#(and (<= (+ (* 4 foo_~i~0) ~b.offset 4) (select |#length| ~b.base)) (<= 4 (+ (* 4 foo_~i~0) ~b.offset)))] [2018-02-02 20:19:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:19:23,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:19:23,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:19:23,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:19:23,897 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-02-02 20:19:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:23,972 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-02-02 20:19:23,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:19:23,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-02-02 20:19:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:23,973 INFO L225 Difference]: With dead ends: 56 [2018-02-02 20:19:23,973 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 20:19:23,973 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:19:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 20:19:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 20:19:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 20:19:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-02 20:19:23,974 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 45 [2018-02-02 20:19:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:23,975 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-02 20:19:23,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:19:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-02 20:19:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:19:23,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:23,975 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:23,975 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693807, now seen corresponding path program 2 times [2018-02-02 20:19:23,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:23,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:24,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:24,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:19:24,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:24,622 INFO L182 omatonBuilderFactory]: Interpolants [3872#true, 3873#false, 3874#(and (<= 1 ~n) (<= ~n 1)), 3875#(and (<= ~n 2) (<= 2 ~n)), 3876#(and (<= 3 ~n) (<= ~n 3)), 3877#(and (= 0 |main_#t~malloc6.offset|) (<= 3 ~n) (<= ~n 3) (= (select |#valid| |main_#t~malloc6.base|) 1)), 3878#(and (<= 3 ~n) (= (select |#valid| ~a.base) 1) (= 0 ~a.offset) (<= ~n 3)), 3879#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= 3 ~n) (= 0 ~a.offset) (<= ~n 3)), 3880#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 16) (+ ~b.offset (* 4 ~n))) (not (= |main_#t~post8.base| ~a.base)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 16)) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= 0 ~a.offset)), 3881#(and (<= 4 ~b.offset) (not (= ~a.base ~b.base)) (<= 12 (* 4 ~n)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~b.offset (* 4 ~n)) 16) (= 0 ~a.offset)), 3882#(= |#memory_int| |old(#memory_int)|), 3883#(and (= foo_~i~0 0) (= |#memory_int| |old(#memory_int)|)), 3884#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3885#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 1) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3886#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 2)), 3887#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset)) (<= 12 (+ ~a.offset (* 4 ~n))) (<= foo_~i~0 2)), 3888#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ ~a.offset (* 4 ~n))) (<= 0 ~a.offset)), 3889#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (and (= foo_~i~0 0) (<= 0 ~a.offset)) (<= (+ foo_~i~0 1) 0)) (or (<= 12 (+ ~a.offset (* 4 ~n))) (< 0 (+ foo_~i~0 1)))), 3890#(and (or (and (= foo_~i~0 0) (<= 0 ~a.offset)) (<= (+ foo_~i~0 1) 0)) (or (<= 12 (+ ~a.offset (* 4 ~n))) (< 0 (+ foo_~i~0 1))) (or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 3891#(and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 15)) (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (<= (+ (* 4 foo_~i~0) 12) (+ ~a.offset (* 4 ~n))) (<= 17 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset))), 3892#(and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 15)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) 12) (+ ~a.offset (* 4 ~n))) (<= 17 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset))), 3893#(and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 15)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) 8) (+ ~a.offset (* 4 ~n))) (<= 17 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset)) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4))), 3894#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 8)) (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 15)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 17 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset))), 3895#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 0 ~a.offset)), 3896#(and (= ~n |main_#t~mem10|) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 0 ~a.offset)), 3897#(and (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset))] [2018-02-02 20:19:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:24,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:19:24,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:19:24,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:19:24,623 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2018-02-02 20:19:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:26,066 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-02-02 20:19:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:19:26,066 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-02-02 20:19:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:26,067 INFO L225 Difference]: With dead ends: 121 [2018-02-02 20:19:26,067 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 20:19:26,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=379, Invalid=2701, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:19:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 20:19:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2018-02-02 20:19:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 20:19:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-02-02 20:19:26,070 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 55 [2018-02-02 20:19:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:26,071 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-02-02 20:19:26,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:19:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-02-02 20:19:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:19:26,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:26,072 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:26,072 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:26,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1655485324, now seen corresponding path program 3 times [2018-02-02 20:19:26,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:26,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:19:26,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:26,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:19:26,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,140 INFO L182 omatonBuilderFactory]: Interpolants [4177#true, 4178#false, 4179#(<= 1 ~n), 4180#(<= 2 ~n), 4181#(<= 3 ~n), 4182#(<= 4 ~n), 4183#(= foo_~i~0 0), 4184#(<= foo_~i~0 1), 4185#(<= foo_~i~0 2), 4186#(<= foo_~i~0 3), 4187#(<= ~n 3)] [2018-02-02 20:19:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:19:26,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:19:26,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:19:26,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:19:26,141 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 11 states. [2018-02-02 20:19:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:26,339 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-02-02 20:19:26,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:19:26,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-02-02 20:19:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:26,340 INFO L225 Difference]: With dead ends: 159 [2018-02-02 20:19:26,340 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 20:19:26,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:19:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 20:19:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-02-02 20:19:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 20:19:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-02 20:19:26,344 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 58 [2018-02-02 20:19:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:26,344 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-02 20:19:26,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:19:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-02 20:19:26,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:19:26,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:26,345 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:26,345 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash 554046854, now seen corresponding path program 4 times [2018-02-02 20:19:26,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:26,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:19:26,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:26,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:19:26,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:26,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 20:19:26,532 INFO L182 omatonBuilderFactory]: Interpolants [4481#true, 4482#false, 4483#(<= ~n 1), 4484#(<= ~n 2), 4485#(<= ~n 3), 4486#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 3)), 4487#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 8))), 4488#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 8))), 4489#(= foo_~i~0 0), 4490#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 4491#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 4492#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 4493#(or (<= (+ ~b.offset 12) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-02 20:19:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:19:26,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:19:26,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:19:26,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:19:26,533 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 13 states. [2018-02-02 20:19:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:26,735 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-02-02 20:19:26,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:19:26,735 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-02-02 20:19:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:26,735 INFO L225 Difference]: With dead ends: 101 [2018-02-02 20:19:26,735 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 20:19:26,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 20:19:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-02-02 20:19:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 20:19:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-02-02 20:19:26,737 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 59 [2018-02-02 20:19:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:26,737 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-02-02 20:19:26,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:19:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-02-02 20:19:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:19:26,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:26,738 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:26,738 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:26,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1456637332, now seen corresponding path program 5 times [2018-02-02 20:19:26,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:26,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:27,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:19:27,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,719 INFO L182 omatonBuilderFactory]: Interpolants [4679#true, 4680#false, 4681#(and (<= 1 ~n) (<= ~n 1)), 4682#(and (<= ~n 2) (<= 2 ~n)), 4683#(and (<= 3 ~n) (<= ~n 3)), 4684#(and (<= 4 ~n) (<= ~n 4)), 4685#(and (= 0 |main_#t~malloc6.offset|) (<= 4 ~n) (<= ~n 4) (= (select |#valid| |main_#t~malloc6.base|) 1)), 4686#(and (= (select |#valid| ~a.base) 1) (= 0 ~a.offset) (<= 4 ~n) (<= ~n 4)), 4687#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= 0 ~a.offset) (<= 4 ~n) (<= ~n 4)), 4688#(and (or (and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (not (= |main_#t~post8.base| ~a.base)) (= 0 ~a.offset) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 20)) (<= ~n 4)) (<= (+ ~b.offset (* 4 ~n)) 19)) (<= 4 ~n)), 4689#(and (or (<= (+ ~b.offset (* 4 ~n)) 19) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= 0 ~a.offset) (<= ~b.offset 4) (<= ~n 4))) (<= 4 ~n)), 4690#(= |#memory_int| |old(#memory_int)|), 4691#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4692#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4693#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset))), 4694#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset))), 4695#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 1) ~n)), 4696#(and (<= 16 (+ ~a.offset (* 4 ~n))) (or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 17 (+ ~a.offset (* 4 ~n))))), 4697#(or (<= (+ ~b.offset (* 4 ~n)) 19) (<= 21 (+ ~b.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4698#(or (<= (+ ~b.offset (* 4 ~n)) 19) (<= 21 (+ ~b.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 3)) (<= (+ ~n 5) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4699#(or (<= (+ ~b.offset (* 4 ~n)) 19) (and (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= 21 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n)) (+ (* 4 foo_~i~0) ~b.offset 3)) (<= ~b.offset (+ ~a.offset 3))), 4700#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 19) (and (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= 21 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3))), 4701#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 19) (<= 21 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4702#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 19) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (<= 21 (+ ~b.offset (* 4 ~n))) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4703#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 19) (<= 21 (+ ~b.offset (* 4 ~n))) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4704#(and (or (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= 0 ~a.offset) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))) (<= ~b.offset 4)) (<= (+ ~b.offset (* 4 ~n)) 19)) (<= 4 ~n)), 4705#(and (= ~n |main_#t~mem10|) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= ~b.offset 4) (= 0 ~a.offset) (<= 20 (+ ~b.offset (* 4 ~n)))), 4706#(and (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset) (= ~b.offset 4))] [2018-02-02 20:19:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:19:27,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:19:27,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:19:27,720 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 28 states. [2018-02-02 20:19:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:30,332 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-02-02 20:19:30,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 20:19:30,332 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2018-02-02 20:19:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:30,333 INFO L225 Difference]: With dead ends: 134 [2018-02-02 20:19:30,333 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 20:19:30,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=628, Invalid=4342, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 20:19:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 20:19:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2018-02-02 20:19:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 20:19:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-02-02 20:19:30,335 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 66 [2018-02-02 20:19:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:30,335 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-02-02 20:19:30,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:19:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-02-02 20:19:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:19:30,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:30,336 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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] [2018-02-02 20:19:30,336 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash -590785937, now seen corresponding path program 6 times [2018-02-02 20:19:30,336 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:30,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:19:30,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:30,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:19:30,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:30,392 INFO L182 omatonBuilderFactory]: Interpolants [5056#(<= ~n 4), 5044#true, 5045#false, 5046#(<= 1 ~n), 5047#(<= 2 ~n), 5048#(<= 3 ~n), 5049#(<= 4 ~n), 5050#(<= 5 ~n), 5051#(= foo_~i~0 0), 5052#(<= foo_~i~0 1), 5053#(<= foo_~i~0 2), 5054#(<= foo_~i~0 3), 5055#(<= foo_~i~0 4)] [2018-02-02 20:19:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:19:30,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:19:30,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:19:30,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:19:30,393 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 13 states. [2018-02-02 20:19:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:30,591 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-02-02 20:19:30,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:19:30,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-02-02 20:19:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:30,592 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:19:30,592 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:19:30,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=270, Invalid=600, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:19:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:19:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 125. [2018-02-02 20:19:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 20:19:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-02-02 20:19:30,595 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 69 [2018-02-02 20:19:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:30,595 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-02-02 20:19:30,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:19:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-02-02 20:19:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:19:30,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:30,596 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:30,596 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1507073493, now seen corresponding path program 7 times [2018-02-02 20:19:30,596 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:30,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 20:19:30,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:30,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:19:30,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:30,648 INFO L182 omatonBuilderFactory]: Interpolants [5408#(<= 5 ~n), 5398#true, 5399#false, 5400#(<= ~n 1), 5401#(<= ~n 2), 5402#(<= ~n 3), 5403#(<= ~n 4), 5404#(= foo_~i~0 0), 5405#(<= 1 foo_~i~0), 5406#(<= 2 foo_~i~0), 5407#(<= 3 foo_~i~0)] [2018-02-02 20:19:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 20:19:30,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:19:30,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:19:30,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:19:30,649 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 11 states. [2018-02-02 20:19:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:30,806 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-02-02 20:19:30,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:19:30,806 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-02-02 20:19:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:30,807 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:19:30,807 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 20:19:30,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:19:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 20:19:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-02 20:19:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 20:19:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-02 20:19:30,809 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 70 [2018-02-02 20:19:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:30,809 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-02 20:19:30,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:19:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-02 20:19:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 20:19:30,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:30,810 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 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] [2018-02-02 20:19:30,810 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1302767729, now seen corresponding path program 8 times [2018-02-02 20:19:30,811 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:30,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:31,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:31,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:19:31,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:31,921 INFO L182 omatonBuilderFactory]: Interpolants [5632#(= |#memory_int| |old(#memory_int)|), 5633#(and (= foo_~i~0 0) (= |#memory_int| |old(#memory_int)|)), 5634#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 5635#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 1) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 5636#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 2)), 5637#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 3)), 5638#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 4) (<= 16 (+ (* 4 foo_~i~0) ~a.offset))), 5639#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 ~a.offset)), 5640#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (= foo_~i~0 0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 0 ~a.offset))), 5641#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= foo_~i~0 0) (and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 23)) (<= 25 (+ ~b.offset (* 4 ~n))) (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 20))) (<= 0 ~a.offset))))), 5642#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)) (or (and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 23)) (<= 25 (+ ~b.offset (* 4 ~n))) (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 16))) (<= 0 ~a.offset)) (<= foo_~i~0 1)))), 5643#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (<= 25 (+ ~b.offset (* 4 ~n))) (<= foo_~i~0 2) (<= ~b.offset (+ ~a.offset 3))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)))), 5644#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 25 (+ ~b.offset (* 4 ~n))) (<= foo_~i~0 2) (<= ~b.offset (+ ~a.offset 3))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)))), 5645#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 25 (+ ~b.offset (* 4 ~n))) (<= foo_~i~0 3) (<= ~b.offset (+ ~a.offset 3))))), 5646#(or (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 16)) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 25 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= ~n 4))) (not (= 4 ~b.offset))), 5647#(and (= 0 ~a.offset) (<= 5 ~n) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 5648#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (< 23 (+ ~b.offset (* 4 ~n))) (= 0 ~a.offset)), 5649#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset)), 5620#true, 5621#false, 5622#(and (<= 1 ~n) (<= ~n 1)), 5623#(and (<= ~n 2) (<= 2 ~n)), 5624#(and (<= 3 ~n) (<= ~n 3)), 5625#(and (<= 4 ~n) (<= ~n 4)), 5626#(and (<= ~n 5) (<= 5 ~n)), 5627#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 5) (<= 5 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 5628#(and (<= ~n 5) (= (select |#valid| ~a.base) 1) (= 0 ~a.offset) (<= 5 ~n)), 5629#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= ~n 5) (= 0 ~a.offset) (<= 5 ~n)), 5630#(and (= |main_#t~post8.offset| 0) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 24)))) (= 0 ~a.offset) (<= 5 ~n) (<= ~b.offset 4)), 5631#(and (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~b.offset (* 4 ~n)) 24))) (= 0 ~a.offset) (<= 5 ~n) (<= ~b.offset 4))] [2018-02-02 20:19:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:31,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:19:31,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:19:31,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:19:31,922 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 30 states. [2018-02-02 20:19:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:33,713 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2018-02-02 20:19:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 20:19:33,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-02-02 20:19:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:33,714 INFO L225 Difference]: With dead ends: 164 [2018-02-02 20:19:33,714 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 20:19:33,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=546, Invalid=3486, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 20:19:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 20:19:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 136. [2018-02-02 20:19:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 20:19:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-02-02 20:19:33,718 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 77 [2018-02-02 20:19:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:33,719 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-02-02 20:19:33,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:19:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-02-02 20:19:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:19:33,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:33,720 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 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] [2018-02-02 20:19:33,720 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash 459506644, now seen corresponding path program 9 times [2018-02-02 20:19:33,720 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:33,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 20:19:33,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:33,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:19:33,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:33,823 INFO L182 omatonBuilderFactory]: Interpolants [6018#true, 6019#false, 6020#(<= 1 ~n), 6021#(<= 2 ~n), 6022#(<= 3 ~n), 6023#(<= 4 ~n), 6024#(<= 5 ~n), 6025#(<= 6 ~n), 6026#(= foo_~i~0 0), 6027#(<= foo_~i~0 1), 6028#(<= foo_~i~0 2), 6029#(<= foo_~i~0 3), 6030#(<= foo_~i~0 4), 6031#(<= foo_~i~0 5), 6032#(<= ~n 5)] [2018-02-02 20:19:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 20:19:33,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:19:33,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:19:33,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:19:33,824 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 15 states. [2018-02-02 20:19:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:34,139 INFO L93 Difference]: Finished difference Result 205 states and 212 transitions. [2018-02-02 20:19:34,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:19:34,140 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2018-02-02 20:19:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:34,140 INFO L225 Difference]: With dead ends: 205 [2018-02-02 20:19:34,140 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 20:19:34,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:19:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 20:19:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 144. [2018-02-02 20:19:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 20:19:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2018-02-02 20:19:34,143 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 80 [2018-02-02 20:19:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:34,143 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2018-02-02 20:19:34,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:19:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2018-02-02 20:19:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:19:34,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:34,144 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-02-02 20:19:34,144 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1572028070, now seen corresponding path program 10 times [2018-02-02 20:19:34,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:34,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 62 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 20:19:34,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:34,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:19:34,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:34,211 INFO L182 omatonBuilderFactory]: Interpolants [6432#(<= 3 foo_~i~0), 6433#(<= 4 foo_~i~0), 6434#(<= 6 ~n), 6422#true, 6423#false, 6424#(<= ~n 1), 6425#(<= ~n 2), 6426#(<= ~n 3), 6427#(<= ~n 4), 6428#(<= ~n 5), 6429#(= foo_~i~0 0), 6430#(<= 1 foo_~i~0), 6431#(<= 2 foo_~i~0)] [2018-02-02 20:19:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 62 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 20:19:34,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:19:34,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:19:34,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:19:34,212 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand 13 states. [2018-02-02 20:19:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:34,445 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-02-02 20:19:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:19:34,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-02-02 20:19:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:34,446 INFO L225 Difference]: With dead ends: 138 [2018-02-02 20:19:34,446 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 20:19:34,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:19:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 20:19:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-02 20:19:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 20:19:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-02-02 20:19:34,447 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 81 [2018-02-02 20:19:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:34,448 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-02-02 20:19:34,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:19:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-02-02 20:19:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:19:34,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:34,448 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 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] [2018-02-02 20:19:34,449 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash -559166732, now seen corresponding path program 11 times [2018-02-02 20:19:34,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:34,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:35,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:35,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 20:19:35,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:35,603 INFO L182 omatonBuilderFactory]: Interpolants [6679#true, 6680#false, 6681#(and (<= 1 ~n) (<= ~n 1)), 6682#(and (<= ~n 2) (<= 2 ~n)), 6683#(and (<= 3 ~n) (<= ~n 3)), 6684#(and (<= 4 ~n) (<= ~n 4)), 6685#(and (<= ~n 5) (<= 5 ~n)), 6686#(and (<= 6 ~n) (<= ~n 6)), 6687#(and (= 0 |main_#t~malloc6.offset|) (<= 6 ~n) (<= ~n 6) (= (select |#valid| |main_#t~malloc6.base|) 1)), 6688#(and (= (select |#valid| ~a.base) 1) (<= 6 ~n) (= 0 ~a.offset) (<= ~n 6)), 6689#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= 6 ~n) (= 0 ~a.offset) (<= ~n 6)), 6690#(and (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 28)) (= |main_#t~post8.offset| 0) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)))) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (= 0 ~a.offset) (<= (+ |main_#t~post8.offset| 28) (+ ~b.offset (* 4 ~n)))), 6691#(and (<= 28 (+ ~b.offset (* 4 ~n))) (= 0 ~a.offset) (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (<= (+ ~b.offset (* 4 ~n)) 28) (<= ~b.offset 4)), 6692#(= |#memory_int| |old(#memory_int)|), 6693#(and (= foo_~i~0 0) (= |#memory_int| |old(#memory_int)|)), 6694#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 6695#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 1) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6696#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 2)), 6697#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 3)), 6698#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 4) (<= 16 (+ (* 4 foo_~i~0) ~a.offset))), 6699#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 20 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 5)), 6700#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 ~a.offset)), 6701#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (<= 1 ~a.offset) (and (= foo_~i~0 0) (<= 0 ~a.offset)))), 6702#(and (or (and (= foo_~i~0 0) (<= 0 ~a.offset)) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27))) (or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 6703#(and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (and (or (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 24)) (<= (* 4 foo_~i~0) (+ ~a.offset 3))) (<= (* 4 foo_~i~0) (+ ~a.offset 4))) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)))), 6704#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)) (or (<= 29 (+ ~b.offset (* 4 ~n))) (and (<= (* 4 foo_~i~0) (+ ~a.offset 8)) (or (<= (* 4 foo_~i~0) (+ ~a.offset 7)) (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 20)))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)))), 6705#(and (or (and (<= (* 4 foo_~i~0) (+ ~a.offset 12)) (or (<= (* 4 foo_~i~0) (+ ~a.offset 11)) (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 16)))) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8))), 6706#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~a.offset 19)) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)) (<= 5 ~b.offset))), 6707#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~a.offset 19)) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)) (<= 5 ~b.offset))), 6708#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~a.offset 23)) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)) (<= 5 ~b.offset)) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16))), 6709#(and (or (<= (* 4 ~n) 20) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)) (<= 5 ~b.offset))), 6710#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 0 ~a.offset)), 6711#(and (= ~n |main_#t~mem10|) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 0 ~a.offset)), 6712#(and (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset))] [2018-02-02 20:19:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:35,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 20:19:35,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 20:19:35,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:19:35,604 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 34 states. [2018-02-02 20:19:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:37,637 INFO L93 Difference]: Finished difference Result 178 states and 183 transitions. [2018-02-02 20:19:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 20:19:37,638 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 88 [2018-02-02 20:19:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:37,638 INFO L225 Difference]: With dead ends: 178 [2018-02-02 20:19:37,638 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 20:19:37,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=581, Invalid=4531, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 20:19:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 20:19:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 155. [2018-02-02 20:19:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:19:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 160 transitions. [2018-02-02 20:19:37,643 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 160 transitions. Word has length 88 [2018-02-02 20:19:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:37,643 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 160 transitions. [2018-02-02 20:19:37,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 20:19:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2018-02-02 20:19:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 20:19:37,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:37,644 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 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] [2018-02-02 20:19:37,644 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:37,644 INFO L82 PathProgramCache]: Analyzing trace with hash -424693361, now seen corresponding path program 12 times [2018-02-02 20:19:37,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:37,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 63 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 20:19:37,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:37,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:19:37,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:37,769 INFO L182 omatonBuilderFactory]: Interpolants [7136#(<= foo_~i~0 5), 7137#(<= ~n 6), 7122#true, 7123#false, 7124#(<= 1 ~n), 7125#(<= 2 ~n), 7126#(<= 3 ~n), 7127#(<= 4 ~n), 7128#(<= 5 ~n), 7129#(<= 6 ~n), 7130#(<= 7 ~n), 7131#(= foo_~i~0 0), 7132#(<= foo_~i~0 1), 7133#(<= foo_~i~0 2), 7134#(<= foo_~i~0 3), 7135#(<= foo_~i~0 4)] [2018-02-02 20:19:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 63 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 20:19:37,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:19:37,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:19:37,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:19:37,770 INFO L87 Difference]: Start difference. First operand 155 states and 160 transitions. Second operand 16 states. [2018-02-02 20:19:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:37,928 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2018-02-02 20:19:37,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:19:37,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-02-02 20:19:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:37,929 INFO L225 Difference]: With dead ends: 173 [2018-02-02 20:19:37,929 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 20:19:37,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:19:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 20:19:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 93. [2018-02-02 20:19:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 20:19:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-02-02 20:19:37,931 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 91 [2018-02-02 20:19:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:37,932 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-02-02 20:19:37,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:19:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-02-02 20:19:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 20:19:37,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:37,932 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-02 20:19:37,932 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1797486475, now seen corresponding path program 13 times [2018-02-02 20:19:37,933 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:37,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 32 proven. 85 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 20:19:38,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:38,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:19:38,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:38,020 INFO L182 omatonBuilderFactory]: Interpolants [7456#(<= 7 ~n), 7442#true, 7443#false, 7444#(<= ~n 1), 7445#(<= ~n 2), 7446#(<= ~n 3), 7447#(<= ~n 4), 7448#(<= ~n 5), 7449#(<= ~n 6), 7450#(= foo_~i~0 0), 7451#(<= 1 foo_~i~0), 7452#(<= 2 foo_~i~0), 7453#(<= 3 foo_~i~0), 7454#(<= 4 foo_~i~0), 7455#(<= 5 foo_~i~0)] [2018-02-02 20:19:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 32 proven. 85 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 20:19:38,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:19:38,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:19:38,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:19:38,021 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 15 states. [2018-02-02 20:19:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:38,279 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2018-02-02 20:19:38,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:19:38,279 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-02-02 20:19:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:38,279 INFO L225 Difference]: With dead ends: 153 [2018-02-02 20:19:38,279 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 20:19:38,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:19:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 20:19:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-02 20:19:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 20:19:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-02-02 20:19:38,281 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 92 [2018-02-02 20:19:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:38,281 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-02-02 20:19:38,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:19:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-02-02 20:19:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:19:38,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:38,281 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 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] [2018-02-02 20:19:38,281 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:38,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1800181926, now seen corresponding path program 14 times [2018-02-02 20:19:38,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:38,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 20:19:38,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:38,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:19:38,424 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:38,424 INFO L182 omatonBuilderFactory]: Interpolants [7726#true, 7727#false, 7728#(<= 1 ~n), 7729#(<= 2 ~n), 7730#(<= 3 ~n), 7731#(<= 4 ~n), 7732#(<= 5 ~n), 7733#(<= 6 ~n), 7734#(<= 7 ~n), 7735#(= foo_~i~0 0), 7736#(<= foo_~i~0 1), 7737#(<= foo_~i~0 2), 7738#(<= foo_~i~0 3), 7739#(<= foo_~i~0 4), 7740#(<= foo_~i~0 5), 7741#(<= foo_~i~0 6), 7742#(<= ~n 6)] [2018-02-02 20:19:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 20:19:38,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:19:38,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:19:38,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:19:38,425 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 17 states. [2018-02-02 20:19:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:38,594 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2018-02-02 20:19:38,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:19:38,594 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2018-02-02 20:19:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:38,594 INFO L225 Difference]: With dead ends: 110 [2018-02-02 20:19:38,595 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 20:19:38,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:19:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 20:19:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-02-02 20:19:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 20:19:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-02-02 20:19:38,597 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2018-02-02 20:19:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:38,597 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-02-02 20:19:38,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:19:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-02-02 20:19:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:19:38,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:38,598 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 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] [2018-02-02 20:19:38,598 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:38,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1419901777, now seen corresponding path program 15 times [2018-02-02 20:19:38,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:38,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 86 proven. 92 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 20:19:39,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:39,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:19:39,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:39,582 INFO L182 omatonBuilderFactory]: Interpolants [7969#true, 7970#false, 7971#(<= 1 ~n), 7972#(<= 2 ~n), 7973#(<= 3 ~n), 7974#(<= 4 ~n), 7975#(<= 5 ~n), 7976#(<= 6 ~n), 7977#(<= 7 ~n), 7978#(and (= 0 |main_#t~malloc6.offset|) (<= 7 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 7979#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 7 ~n)), 7980#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 7 ~n)), 7981#(and (= |main_#t~post8.offset| 0) (= ~a.offset 0) (or (and (= ~b.base |main_#t~post8.base|) (<= (+ |main_#t~post8.offset| 32) (+ ~b.offset (* 4 ~n))) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base))) (not (= ~b.offset 4))) (<= ~b.offset 4)), 7982#(and (= ~a.offset 0) (<= ~b.offset 4) (or (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 28 (* 4 ~n))) (not (= ~b.offset 4)))), 7983#(= |#memory_int| |old(#memory_int)|), 7984#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 7985#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 7986#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (<= (+ (* 4 foo_~i~0) 1) (* 4 ~n)) (= (* 4 ~n) (* 4 foo_~i~0)))), 7987#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 7988#(or (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 7989#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4) (not (= ~b.offset 4))), 7990#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8) (not (= ~b.offset 4))), 7991#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 7992#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16) (not (= ~b.offset 4))), 7993#(or (and (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16))) (= ~a.base ~b.base) (not (= ~b.offset 4))), 7994#(or (and (or (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))) (= ~a.base ~b.base) (not (= ~b.offset 4))), 7995#(or (= ~a.base ~b.base) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 24))) (not (= ~b.offset 4))), 7996#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= ~b.offset 4))) (<= ~b.offset 4)), 7997#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= ~b.offset 4)), 7998#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|) (= ~b.offset 4))] [2018-02-02 20:19:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 86 proven. 92 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 20:19:39,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:19:39,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:19:39,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:19:39,583 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 30 states. [2018-02-02 20:19:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:41,385 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-02-02 20:19:41,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:19:41,385 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 99 [2018-02-02 20:19:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:41,386 INFO L225 Difference]: With dead ends: 111 [2018-02-02 20:19:41,386 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 20:19:41,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1005, Invalid=3825, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 20:19:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 20:19:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-02-02 20:19:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 20:19:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-02-02 20:19:41,389 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 99 [2018-02-02 20:19:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:41,389 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-02-02 20:19:41,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:19:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-02-02 20:19:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 20:19:41,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:41,390 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-02-02 20:19:41,390 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:41,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1134797882, now seen corresponding path program 16 times [2018-02-02 20:19:41,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:41,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 55 proven. 106 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-02 20:19:41,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:41,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:19:41,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:41,667 INFO L182 omatonBuilderFactory]: Interpolants [8294#true, 8295#false, 8296#(<= ~n 1), 8297#(<= ~n 2), 8298#(<= ~n 3), 8299#(<= ~n 4), 8300#(<= ~n 5), 8301#(<= ~n 6), 8302#(<= ~n 7), 8303#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 7) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 8304#(and (= |main_#t~post8.offset| 0) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 24)) (= (* 4 ~n) (select |#length| ~b.base))), 8305#(and (<= (* 4 ~n) (+ ~b.offset 24)) (= (* 4 ~n) (select |#length| ~b.base))), 8306#(= foo_~i~0 0), 8307#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8308#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8309#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8310#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8311#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8312#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8313#(or (<= (+ ~b.offset 28) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-02 20:19:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 55 proven. 106 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-02 20:19:41,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:19:41,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:19:41,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:41,668 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 20 states. [2018-02-02 20:19:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:42,191 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2018-02-02 20:19:42,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:19:42,192 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2018-02-02 20:19:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:42,192 INFO L225 Difference]: With dead ends: 173 [2018-02-02 20:19:42,192 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 20:19:42,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:19:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 20:19:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-02-02 20:19:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 20:19:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-02-02 20:19:42,194 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 103 [2018-02-02 20:19:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:42,194 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-02-02 20:19:42,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:19:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-02-02 20:19:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-02 20:19:42,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:42,195 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 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] [2018-02-02 20:19:42,195 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash -291435573, now seen corresponding path program 17 times [2018-02-02 20:19:42,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:42,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 84 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-02 20:19:42,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:42,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:19:42,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:42,362 INFO L182 omatonBuilderFactory]: Interpolants [8640#(<= foo_~i~0 7), 8641#(<= ~n 7), 8623#true, 8624#false, 8625#(<= 1 ~n), 8626#(<= 2 ~n), 8627#(<= 3 ~n), 8628#(<= 4 ~n), 8629#(<= 5 ~n), 8630#(<= 6 ~n), 8631#(<= 7 ~n), 8632#(<= 8 ~n), 8633#(= foo_~i~0 0), 8634#(<= foo_~i~0 1), 8635#(<= foo_~i~0 2), 8636#(<= foo_~i~0 3), 8637#(<= foo_~i~0 4), 8638#(<= foo_~i~0 5), 8639#(<= foo_~i~0 6)] [2018-02-02 20:19:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 84 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-02 20:19:42,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:19:42,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:19:42,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:19:42,364 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 19 states. [2018-02-02 20:19:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:42,502 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-02-02 20:19:42,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:19:42,502 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 106 [2018-02-02 20:19:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:42,502 INFO L225 Difference]: With dead ends: 121 [2018-02-02 20:19:42,502 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 20:19:42,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:19:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 20:19:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-02-02 20:19:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 20:19:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-02-02 20:19:42,504 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 106 [2018-02-02 20:19:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:42,504 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-02-02 20:19:42,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:19:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-02-02 20:19:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 20:19:42,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:42,505 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 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] [2018-02-02 20:19:42,505 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:42,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1856187308, now seen corresponding path program 18 times [2018-02-02 20:19:42,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:42,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 91 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:44,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:44,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 20:19:44,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:44,271 INFO L182 omatonBuilderFactory]: Interpolants [8896#(and (<= 3 ~n) (<= ~n 3)), 8897#(and (<= 4 ~n) (<= ~n 4)), 8898#(and (<= ~n 5) (<= 5 ~n)), 8899#(and (<= 6 ~n) (<= ~n 6)), 8900#(and (<= ~n 7) (<= 7 ~n)), 8901#(and (<= 8 ~n) (<= ~n 8)), 8902#(and (<= 8 ~n) (= 0 |main_#t~malloc6.offset|) (<= ~n 8) (= (select |#valid| |main_#t~malloc6.base|) 1)), 8903#(and (<= 8 ~n) (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= ~n 8)), 8904#(and (<= 8 ~n) (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= ~n 8)), 8905#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (<= (+ |main_#t~post8.offset| 28) (+ ~b.offset (* 3 ~n))) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 36))), 8906#(and (<= 4 ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 36) (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~b.offset 4) ~n)), 8907#(= |#memory_int| |old(#memory_int)|), 8908#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 8909#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 8910#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (< 7 (+ (* 4 foo_~i~0) ~a.offset))), 8911#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset))), 8912#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 16 (+ (* 4 foo_~i~0) ~a.offset))), 8913#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 20 (+ (* 4 foo_~i~0) ~a.offset))), 8914#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 24 (+ (* 4 foo_~i~0) ~a.offset))), 8915#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 28 (+ (* 4 foo_~i~0) ~a.offset))), 8916#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n) (<= 28 (+ (* 4 foo_~i~0) ~a.offset))), 8917#(and (or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 33 (+ ~a.offset (* 4 ~n)))) (<= 32 (+ ~a.offset (* 4 ~n)))), 8918#(and (= foo_~i~0 0) (or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 33 (+ ~a.offset (* 4 ~n)))) (<= 32 (+ ~a.offset (* 4 ~n)))), 8919#(and (= foo_~i~0 0) (or (<= 37 (+ ~b.offset (* 4 ~n))) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3))) (<= 32 (+ ~a.offset (* 4 ~n)))), 8920#(and (or (<= (+ (* 4 foo_~i~0) 29) (+ ~a.offset (* 4 ~n))) (<= 37 (+ ~b.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (<= ~b.offset (+ ~a.offset 3))) (<= (+ (* 4 foo_~i~0) 28) (+ ~a.offset (* 4 ~n)))), 8921#(and (<= (+ (* 4 foo_~i~0) 24) (+ ~a.offset (* 4 ~n))) (or (<= 37 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3))) (= ~b.offset (+ ~a.offset 4))) (<= (+ (* 4 foo_~i~0) 25) (+ ~a.offset (* 4 ~n))))), 8922#(and (<= (+ (* 4 foo_~i~0) 20) (+ ~a.offset (* 4 ~n))) (or (<= (+ (* 4 foo_~i~0) 21) (+ ~a.offset (* 4 ~n))) (<= 37 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3))) (= ~b.offset (+ ~a.offset 4))))), 8923#(and (<= (+ (* 4 foo_~i~0) 16) (+ ~a.offset (* 4 ~n))) (or (<= (+ (* 4 foo_~i~0) 17) (+ ~a.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (= ~a.base ~b.base) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 11)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3)))) (<= 37 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)))), 8924#(and (or (<= 37 (+ ~b.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 15)) (<= ~n (+ ~b.offset 3)))) (<= ~b.offset (+ ~a.offset 3)) (<= (+ (* 4 foo_~i~0) 13) (+ ~a.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) 12) (+ ~a.offset (* 4 ~n)))), 8925#(or (<= 37 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset) (and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3))) (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)))), 8926#(or (<= 37 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3)))) (<= 5 ~b.offset)), 8927#(or (<= 37 (+ ~b.offset (* 4 ~n))) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 23)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3)))) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset)), 8928#(or (<= 37 (+ ~b.offset (* 4 ~n))) (and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset)), 8929#(and (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 8930#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))), 8931#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|)), 8892#true, 8893#false, 8894#(and (<= 1 ~n) (<= ~n 1)), 8895#(and (<= ~n 2) (<= 2 ~n))] [2018-02-02 20:19:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 91 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:44,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 20:19:44,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 20:19:44,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:19:44,271 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 40 states. [2018-02-02 20:19:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:46,563 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2018-02-02 20:19:46,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 20:19:46,563 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 110 [2018-02-02 20:19:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:46,564 INFO L225 Difference]: With dead ends: 212 [2018-02-02 20:19:46,564 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 20:19:46,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1757 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=760, Invalid=6212, Unknown=0, NotChecked=0, Total=6972 [2018-02-02 20:19:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 20:19:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 193. [2018-02-02 20:19:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 20:19:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 198 transitions. [2018-02-02 20:19:46,568 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 198 transitions. Word has length 110 [2018-02-02 20:19:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:46,568 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 198 transitions. [2018-02-02 20:19:46,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 20:19:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 198 transitions. [2018-02-02 20:19:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 20:19:46,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:46,569 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 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] [2018-02-02 20:19:46,569 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash -522713937, now seen corresponding path program 19 times [2018-02-02 20:19:46,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:46,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 108 proven. 98 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 20:19:46,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:46,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:19:46,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:46,720 INFO L182 omatonBuilderFactory]: Interpolants [9440#(<= foo_~i~0 4), 9441#(<= foo_~i~0 5), 9442#(<= foo_~i~0 6), 9443#(<= foo_~i~0 7), 9444#(<= ~n 8), 9425#true, 9426#false, 9427#(<= 1 ~n), 9428#(<= 2 ~n), 9429#(<= 3 ~n), 9430#(<= 4 ~n), 9431#(<= 5 ~n), 9432#(<= 6 ~n), 9433#(<= 7 ~n), 9434#(<= 8 ~n), 9435#(<= 9 ~n), 9436#(= foo_~i~0 0), 9437#(<= foo_~i~0 1), 9438#(<= foo_~i~0 2), 9439#(<= foo_~i~0 3)] [2018-02-02 20:19:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 108 proven. 98 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 20:19:46,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:19:46,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:19:46,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:46,721 INFO L87 Difference]: Start difference. First operand 193 states and 198 transitions. Second operand 20 states. [2018-02-02 20:19:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:47,048 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-02-02 20:19:47,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:19:47,049 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2018-02-02 20:19:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:47,050 INFO L225 Difference]: With dead ends: 211 [2018-02-02 20:19:47,050 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:19:47,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=437, Invalid=895, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:19:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:19:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 115. [2018-02-02 20:19:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 20:19:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-02-02 20:19:47,053 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 113 [2018-02-02 20:19:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:47,053 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-02-02 20:19:47,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:19:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-02-02 20:19:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 20:19:47,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:47,054 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-02-02 20:19:47,054 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash -512700181, now seen corresponding path program 20 times [2018-02-02 20:19:47,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:47,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 72 proven. 140 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 20:19:47,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:47,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:19:47,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:47,204 INFO L182 omatonBuilderFactory]: Interpolants [9824#(<= ~n 2), 9825#(<= ~n 3), 9826#(<= ~n 4), 9827#(<= ~n 5), 9828#(<= ~n 6), 9829#(<= ~n 7), 9830#(<= ~n 8), 9831#(= foo_~i~0 0), 9832#(<= 1 foo_~i~0), 9833#(<= 2 foo_~i~0), 9834#(<= 3 foo_~i~0), 9835#(<= 4 foo_~i~0), 9836#(<= 5 foo_~i~0), 9837#(<= 6 foo_~i~0), 9838#(<= 7 foo_~i~0), 9839#(<= 9 ~n), 9821#true, 9822#false, 9823#(<= ~n 1)] [2018-02-02 20:19:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 72 proven. 140 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 20:19:47,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:19:47,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:19:47,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:19:47,205 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 19 states. [2018-02-02 20:19:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:47,445 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2018-02-02 20:19:47,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:19:47,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 114 [2018-02-02 20:19:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:47,446 INFO L225 Difference]: With dead ends: 191 [2018-02-02 20:19:47,446 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 20:19:47,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:19:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 20:19:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-02 20:19:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 20:19:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-02-02 20:19:47,448 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 114 [2018-02-02 20:19:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:47,448 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-02-02 20:19:47,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:19:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-02-02 20:19:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 20:19:47,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:47,448 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 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] [2018-02-02 20:19:47,448 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1529455674, now seen corresponding path program 21 times [2018-02-02 20:19:47,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:47,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 108 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 20:19:47,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:47,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:19:47,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:47,616 INFO L182 omatonBuilderFactory]: Interpolants [10176#false, 10177#(<= 1 ~n), 10178#(<= 2 ~n), 10179#(<= 3 ~n), 10180#(<= 4 ~n), 10181#(<= 5 ~n), 10182#(<= 6 ~n), 10183#(<= 7 ~n), 10184#(<= 8 ~n), 10185#(<= 9 ~n), 10186#(= foo_~i~0 0), 10187#(<= foo_~i~0 1), 10188#(<= foo_~i~0 2), 10189#(<= foo_~i~0 3), 10190#(<= foo_~i~0 4), 10191#(<= foo_~i~0 5), 10192#(<= foo_~i~0 6), 10193#(<= foo_~i~0 7), 10194#(<= foo_~i~0 8), 10195#(<= ~n 8), 10175#true] [2018-02-02 20:19:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 108 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 20:19:47,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:19:47,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:19:47,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:19:47,617 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 21 states. [2018-02-02 20:19:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:47,824 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-02-02 20:19:47,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:47,824 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-02-02 20:19:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:47,825 INFO L225 Difference]: With dead ends: 132 [2018-02-02 20:19:47,825 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 20:19:47,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=295, Invalid=635, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:19:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 20:19:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-02-02 20:19:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:19:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-02-02 20:19:47,826 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 117 [2018-02-02 20:19:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:47,826 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-02-02 20:19:47,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:19:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-02-02 20:19:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-02 20:19:47,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:47,827 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 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] [2018-02-02 20:19:47,827 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1776114225, now seen corresponding path program 22 times [2018-02-02 20:19:47,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:47,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 120 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:49,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:49,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 20:19:49,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:49,678 INFO L182 omatonBuilderFactory]: Interpolants [10496#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n) (<= 32 (+ (* 4 foo_~i~0) ~a.offset))), 10497#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 36 (+ ~a.offset (* 4 ~n)))), 10498#(and (or (<= 36 (+ ~a.offset (* 4 ~n))) (< (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 32)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 10499#(and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 27)) (and (<= (+ (* 4 foo_~i~0) ~b.offset 64) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (or (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 68)) (<= (+ (* 4 foo_~i~0) ~b.offset 65) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n))))) (not (= (* 4 ~n) (select |#length| ~b.base))))), 10500#(and (or (and (or (<= (+ (* 4 foo_~i~0) ~b.offset 61) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 64)) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) ~b.offset 60) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n)))) (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 23)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4))), 10501#(and (or (and (or (<= (+ (* 4 foo_~i~0) ~b.offset 57) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 60)) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) ~b.offset 56) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n)))) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 19))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8))), 10502#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 15)) (and (<= (+ (* 4 foo_~i~0) ~b.offset 52) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (or (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 56)) (<= (+ (* 4 foo_~i~0) ~b.offset 53) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n))))) (not (= (* 4 ~n) (select |#length| ~b.base))))), 10503#(and (or (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 11)) (and (or (<= (+ (* 4 foo_~i~0) ~b.offset 49) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 52)) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) ~b.offset 48) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n)))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16))), 10504#(and (or (and (or (<= (+ (* 4 foo_~i~0) ~b.offset 45) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 48)) (<= 41 (+ ~b.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) ~b.offset 44) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n)))) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 7))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 10505#(and (or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= 37 (select |#length| ~b.base)) (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 3)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 41 (+ ~b.offset (* 4 ~n))))), 10506#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= 37 (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 41 (+ ~b.offset (* 4 ~n)))) (or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 10507#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= 37 (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 41 (+ ~b.offset (* 4 ~n))))), 10508#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= 37 (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 41 (+ ~b.offset (* 4 ~n)))) (or (<= (* 4 ~n) 32) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 10509#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))), 10510#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))), 10511#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|)), 10470#true, 10471#false, 10472#(and (<= 1 ~n) (<= ~n 1)), 10473#(and (<= ~n 2) (<= 2 ~n)), 10474#(and (<= 3 ~n) (<= ~n 3)), 10475#(and (<= 4 ~n) (<= ~n 4)), 10476#(and (<= ~n 5) (<= 5 ~n)), 10477#(and (<= 6 ~n) (<= ~n 6)), 10478#(and (<= ~n 7) (<= 7 ~n)), 10479#(and (<= 8 ~n) (<= ~n 8)), 10480#(and (<= ~n 9) (<= 9 ~n)), 10481#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 9) (<= 9 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 10482#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= ~n 9) (<= 9 ~n)), 10483#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= ~n 9) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 9 ~n)), 10484#(and (= ~b.base |main_#t~post8.base|) (= 4 ~b.offset) (<= (+ |main_#t~post8.offset| 40) (+ ~b.offset (* 4 ~n))) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)) (= (+ |main_#t~post8.offset| 4) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 40))), 10485#(and (= 4 ~b.offset) (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n 9) (<= 36 (* 4 ~n)) (= (* 4 ~n) (select |#length| ~b.base))), 10486#(= |#memory_int| |old(#memory_int)|), 10487#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 10488#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 10489#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset))), 10490#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset))), 10491#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 16 (+ (* 4 foo_~i~0) ~a.offset))), 10492#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 20 (+ (* 4 foo_~i~0) ~a.offset))), 10493#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 24 (+ (* 4 foo_~i~0) ~a.offset))), 10494#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 28 (+ (* 4 foo_~i~0) ~a.offset))), 10495#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 32 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-02 20:19:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 120 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:49,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 20:19:49,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 20:19:49,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1572, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:19:49,680 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 42 states. [2018-02-02 20:19:51,671 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 164 DAG size of output 102 [2018-02-02 20:19:51,940 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 161 DAG size of output 107 [2018-02-02 20:19:52,185 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 155 DAG size of output 104 [2018-02-02 20:19:52,450 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 144 DAG size of output 99 [2018-02-02 20:19:52,698 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 138 DAG size of output 96 [2018-02-02 20:19:52,939 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 128 DAG size of output 92 [2018-02-02 20:19:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:55,165 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2018-02-02 20:19:55,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-02 20:19:55,166 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2018-02-02 20:19:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:55,166 INFO L225 Difference]: With dead ends: 235 [2018-02-02 20:19:55,166 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 20:19:55,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3406 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1362, Invalid=10628, Unknown=0, NotChecked=0, Total=11990 [2018-02-02 20:19:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 20:19:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2018-02-02 20:19:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 20:19:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 217 transitions. [2018-02-02 20:19:55,171 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 217 transitions. Word has length 121 [2018-02-02 20:19:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:55,171 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 217 transitions. [2018-02-02 20:19:55,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 20:19:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 217 transitions. [2018-02-02 20:19:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-02 20:19:55,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:55,172 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 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] [2018-02-02 20:19:55,172 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:55,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1726955156, now seen corresponding path program 23 times [2018-02-02 20:19:55,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:55,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 135 proven. 128 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 20:19:55,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:55,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:19:55,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:55,321 INFO L182 omatonBuilderFactory]: Interpolants [11104#(<= 7 ~n), 11105#(<= 8 ~n), 11106#(<= 9 ~n), 11107#(<= 10 ~n), 11108#(= foo_~i~0 0), 11109#(<= foo_~i~0 1), 11110#(<= foo_~i~0 2), 11111#(<= foo_~i~0 3), 11112#(<= foo_~i~0 4), 11113#(<= foo_~i~0 5), 11114#(<= foo_~i~0 6), 11115#(<= foo_~i~0 7), 11116#(<= foo_~i~0 8), 11117#(<= ~n 9), 11096#true, 11097#false, 11098#(<= 1 ~n), 11099#(<= 2 ~n), 11100#(<= 3 ~n), 11101#(<= 4 ~n), 11102#(<= 5 ~n), 11103#(<= 6 ~n)] [2018-02-02 20:19:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 135 proven. 128 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 20:19:55,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:19:55,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:19:55,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:19:55,322 INFO L87 Difference]: Start difference. First operand 212 states and 217 transitions. Second operand 22 states. [2018-02-02 20:19:55,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:55,602 INFO L93 Difference]: Finished difference Result 230 states and 234 transitions. [2018-02-02 20:19:55,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:19:55,603 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 124 [2018-02-02 20:19:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:55,603 INFO L225 Difference]: With dead ends: 230 [2018-02-02 20:19:55,603 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 20:19:55,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=540, Invalid=1100, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:19:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 20:19:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 126. [2018-02-02 20:19:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 20:19:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-02-02 20:19:55,605 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 124 [2018-02-02 20:19:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:55,605 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-02-02 20:19:55,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:19:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-02-02 20:19:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-02 20:19:55,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:55,606 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-02-02 20:19:55,606 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:55,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2085917466, now seen corresponding path program 24 times [2018-02-02 20:19:55,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:55,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 105 proven. 165 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 20:19:55,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:55,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:19:55,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:55,838 INFO L182 omatonBuilderFactory]: Interpolants [11530#true, 11531#false, 11532#(<= ~n 1), 11533#(<= ~n 2), 11534#(<= ~n 3), 11535#(<= ~n 4), 11536#(<= ~n 5), 11537#(<= ~n 6), 11538#(<= ~n 7), 11539#(<= ~n 8), 11540#(<= ~n 9), 11541#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 9) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 11542#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 32))), 11543#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 32))), 11544#(= foo_~i~0 0), 11545#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11546#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11547#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11548#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11549#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11550#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11551#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11552#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11553#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11554#(or (<= (+ ~b.offset 36) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-02 20:19:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 105 proven. 165 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 20:19:55,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:19:55,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:19:55,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:19:55,838 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 25 states. [2018-02-02 20:19:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:56,387 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-02-02 20:19:56,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:19:56,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 125 [2018-02-02 20:19:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:56,388 INFO L225 Difference]: With dead ends: 211 [2018-02-02 20:19:56,388 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:19:56,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=1152, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:19:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:19:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-02-02 20:19:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:19:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-02-02 20:19:56,389 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 125 [2018-02-02 20:19:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:56,390 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-02-02 20:19:56,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:19:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-02-02 20:19:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-02 20:19:56,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:56,390 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 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] [2018-02-02 20:19:56,390 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2000952107, now seen corresponding path program 25 times [2018-02-02 20:19:56,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:56,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 135 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 20:19:56,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:56,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:19:56,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:56,524 INFO L182 omatonBuilderFactory]: Interpolants [11936#(<= 5 ~n), 11937#(<= 6 ~n), 11938#(<= 7 ~n), 11939#(<= 8 ~n), 11940#(<= 9 ~n), 11941#(<= 10 ~n), 11942#(= foo_~i~0 0), 11943#(<= foo_~i~0 1), 11944#(<= foo_~i~0 2), 11945#(<= foo_~i~0 3), 11946#(<= foo_~i~0 4), 11947#(<= foo_~i~0 5), 11948#(<= foo_~i~0 6), 11949#(<= foo_~i~0 7), 11950#(<= foo_~i~0 8), 11951#(<= foo_~i~0 9), 11952#(<= ~n 9), 11930#true, 11931#false, 11932#(<= 1 ~n), 11933#(<= 2 ~n), 11934#(<= 3 ~n), 11935#(<= 4 ~n)] [2018-02-02 20:19:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 135 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 20:19:56,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:19:56,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:19:56,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:19:56,525 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 23 states. [2018-02-02 20:19:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:56,685 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2018-02-02 20:19:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:19:56,686 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 128 [2018-02-02 20:19:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:56,686 INFO L225 Difference]: With dead ends: 143 [2018-02-02 20:19:56,686 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 20:19:56,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=357, Invalid=765, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:19:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 20:19:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-02-02 20:19:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 20:19:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-02-02 20:19:56,688 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2018-02-02 20:19:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:56,689 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-02-02 20:19:56,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:19:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-02-02 20:19:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 20:19:56,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:56,689 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 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] [2018-02-02 20:19:56,689 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:19:56,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1725145524, now seen corresponding path program 26 times [2018-02-02 20:19:56,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:56,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 170 proven. 191 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:19:58,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:58,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 20:19:58,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:58,009 INFO L182 omatonBuilderFactory]: Interpolants [12251#true, 12252#false, 12253#(<= 1 ~n), 12254#(<= 2 ~n), 12255#(<= 3 ~n), 12256#(<= 4 ~n), 12257#(<= 5 ~n), 12258#(<= 6 ~n), 12259#(<= 7 ~n), 12260#(<= 8 ~n), 12261#(<= 9 ~n), 12262#(<= 10 ~n), 12263#(and (= 0 |main_#t~malloc6.offset|) (<= 10 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 12264#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 10 ~n)), 12265#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 10 ~n)), 12266#(and (or (not (= 4 ~b.offset)) (and (<= (+ |main_#t~post8.offset| 44) (+ ~b.offset (* 4 ~n))) (= (* 4 ~n) (select |#length| ~b.base)))) (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (<= ~b.offset 4)), 12267#(and (= ~a.offset 0) (not (= ~a.base ~b.base)) (or (and (<= 40 (* 4 ~n)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 12268#(= |#memory_int| |old(#memory_int)|), 12269#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 12270#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 12271#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 12272#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12273#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12274#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 12275#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 12276#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12277#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 12278#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12279#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12280#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 12281#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)))), 12282#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 12283#(or (and (or (<= (* 4 ~n) 36) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 12284#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 12285#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 12286#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-02 20:19:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 170 proven. 191 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:19:58,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:19:58,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:19:58,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:19:58,010 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 36 states. [2018-02-02 20:20:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:00,058 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-02-02 20:20:00,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 20:20:00,058 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 132 [2018-02-02 20:20:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:00,059 INFO L225 Difference]: With dead ends: 144 [2018-02-02 20:20:00,059 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 20:20:00,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1580, Invalid=5392, Unknown=0, NotChecked=0, Total=6972 [2018-02-02 20:20:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 20:20:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-02-02 20:20:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 20:20:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-02-02 20:20:00,060 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 132 [2018-02-02 20:20:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:00,061 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-02-02 20:20:00,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 20:20:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-02-02 20:20:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-02 20:20:00,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:00,061 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-02-02 20:20:00,061 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:00,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1510075979, now seen corresponding path program 27 times [2018-02-02 20:20:00,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:00,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 136 proven. 199 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:20:00,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:00,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:20:00,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:00,361 INFO L182 omatonBuilderFactory]: Interpolants [12672#(<= ~n 7), 12673#(<= ~n 8), 12674#(<= ~n 9), 12675#(<= ~n 10), 12676#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 10) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 12677#(and (= |main_#t~post8.offset| 0) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 36)) (= (* 4 ~n) (select |#length| ~b.base))), 12678#(and (<= (* 4 ~n) (+ ~b.offset 36)) (= (* 4 ~n) (select |#length| ~b.base))), 12679#(= foo_~i~0 0), 12680#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12681#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12682#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12683#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12684#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12685#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12686#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12687#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12688#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12689#(or (<= (+ ~b.offset 40) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12664#true, 12665#false, 12666#(<= ~n 1), 12667#(<= ~n 2), 12668#(<= ~n 3), 12669#(<= ~n 4), 12670#(<= ~n 5), 12671#(<= ~n 6)] [2018-02-02 20:20:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 136 proven. 199 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:20:00,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:20:00,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:20:00,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:20:00,362 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 26 states. [2018-02-02 20:20:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:00,810 INFO L93 Difference]: Finished difference Result 230 states and 233 transitions. [2018-02-02 20:20:00,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 20:20:00,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 136 [2018-02-02 20:20:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:00,811 INFO L225 Difference]: With dead ends: 230 [2018-02-02 20:20:00,811 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 20:20:00,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:20:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 20:20:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-02-02 20:20:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 20:20:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-02 20:20:00,812 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 136 [2018-02-02 20:20:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:00,813 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-02 20:20:00,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:20:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-02 20:20:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-02 20:20:00,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:00,813 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 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] [2018-02-02 20:20:00,813 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2001595674, now seen corresponding path program 28 times [2018-02-02 20:20:00,814 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:00,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 165 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:20:00,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:00,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:20:00,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:00,984 INFO L182 omatonBuilderFactory]: Interpolants [13120#(<= foo_~i~0 9), 13121#(<= foo_~i~0 10), 13122#(<= ~n 10), 13098#true, 13099#false, 13100#(<= 1 ~n), 13101#(<= 2 ~n), 13102#(<= 3 ~n), 13103#(<= 4 ~n), 13104#(<= 5 ~n), 13105#(<= 6 ~n), 13106#(<= 7 ~n), 13107#(<= 8 ~n), 13108#(<= 9 ~n), 13109#(<= 10 ~n), 13110#(<= 11 ~n), 13111#(= foo_~i~0 0), 13112#(<= foo_~i~0 1), 13113#(<= foo_~i~0 2), 13114#(<= foo_~i~0 3), 13115#(<= foo_~i~0 4), 13116#(<= foo_~i~0 5), 13117#(<= foo_~i~0 6), 13118#(<= foo_~i~0 7), 13119#(<= foo_~i~0 8)] [2018-02-02 20:20:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 165 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:20:00,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:20:00,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:20:00,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:20:00,984 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 25 states. [2018-02-02 20:20:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:01,174 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-02-02 20:20:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:20:01,174 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 139 [2018-02-02 20:20:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:01,175 INFO L225 Difference]: With dead ends: 154 [2018-02-02 20:20:01,175 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 20:20:01,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=425, Invalid=907, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:20:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 20:20:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2018-02-02 20:20:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 20:20:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-02-02 20:20:01,177 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 139 [2018-02-02 20:20:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:01,178 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-02-02 20:20:01,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:20:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-02-02 20:20:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-02 20:20:01,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:01,179 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 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] [2018-02-02 20:20:01,179 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -808371473, now seen corresponding path program 29 times [2018-02-02 20:20:01,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:01,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 204 proven. 232 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 20:20:02,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:02,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 20:20:02,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:02,644 INFO L182 omatonBuilderFactory]: Interpolants [13445#true, 13446#false, 13447#(<= 1 ~n), 13448#(<= 2 ~n), 13449#(<= 3 ~n), 13450#(<= 4 ~n), 13451#(<= 5 ~n), 13452#(<= 6 ~n), 13453#(<= 7 ~n), 13454#(<= 8 ~n), 13455#(<= 9 ~n), 13456#(<= 10 ~n), 13457#(<= 11 ~n), 13458#(and (= 0 |main_#t~malloc6.offset|) (<= 11 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 13459#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 11 ~n)), 13460#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 11 ~n)), 13461#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ |main_#t~post8.offset| 48) (+ ~b.offset (* 4 ~n)))), 13462#(and (<= 44 (* 4 ~n)) (<= 4 ~b.offset) (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset 4)), 13463#(= |#memory_int| |old(#memory_int)|), 13464#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 13465#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 13466#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 13467#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13468#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13469#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 13470#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 13471#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13472#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 13473#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13474#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13475#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 13476#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 13477#(and (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32))), 13478#(and (or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 13479#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 40)) (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 13480#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 13481#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 13482#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-02 20:20:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 204 proven. 232 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 20:20:02,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 20:20:02,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 20:20:02,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:20:02,645 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 38 states. [2018-02-02 20:20:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:04,907 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-02-02 20:20:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 20:20:04,907 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2018-02-02 20:20:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:04,908 INFO L225 Difference]: With dead ends: 155 [2018-02-02 20:20:04,908 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 20:20:04,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 12 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1823, Invalid=6009, Unknown=0, NotChecked=0, Total=7832 [2018-02-02 20:20:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 20:20:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-02 20:20:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 20:20:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-02-02 20:20:04,910 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 143 [2018-02-02 20:20:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:04,910 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-02-02 20:20:04,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 20:20:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-02-02 20:20:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 20:20:04,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:04,911 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-02-02 20:20:04,911 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:04,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1808429574, now seen corresponding path program 30 times [2018-02-02 20:20:04,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:04,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 171 proven. 236 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 20:20:05,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:05,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:20:05,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:05,306 INFO L182 omatonBuilderFactory]: Interpolants [13888#true, 13889#false, 13890#(<= ~n 1), 13891#(<= ~n 2), 13892#(<= ~n 3), 13893#(<= ~n 4), 13894#(<= ~n 5), 13895#(<= ~n 6), 13896#(<= ~n 7), 13897#(<= ~n 8), 13898#(<= ~n 9), 13899#(<= ~n 10), 13900#(<= ~n 11), 13901#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 11) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 13902#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 40))), 13903#(and (<= (* 4 ~n) (+ ~b.offset 40)) (= (* 4 ~n) (select |#length| ~b.base))), 13904#(= foo_~i~0 0), 13905#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13906#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13907#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13908#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13909#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13910#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13911#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13912#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13913#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13914#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13915#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13916#(or (<= (+ ~b.offset 44) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-02 20:20:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 171 proven. 236 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 20:20:05,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:20:05,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:20:05,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:20:05,306 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 29 states. [2018-02-02 20:20:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:05,988 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-02-02 20:20:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:20:05,988 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 147 [2018-02-02 20:20:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:05,989 INFO L225 Difference]: With dead ends: 249 [2018-02-02 20:20:05,989 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 20:20:05,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=346, Invalid=1546, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:20:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 20:20:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-02-02 20:20:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 20:20:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-02-02 20:20:05,990 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 147 [2018-02-02 20:20:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:05,990 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-02-02 20:20:05,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:20:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-02-02 20:20:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-02-02 20:20:05,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:05,991 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:05,991 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash -756355445, now seen corresponding path program 31 times [2018-02-02 20:20:05,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:06,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 198 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 20:20:06,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:06,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:20:06,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:06,307 INFO L182 omatonBuilderFactory]: Interpolants [14358#true, 14359#false, 14360#(<= 1 ~n), 14361#(<= 2 ~n), 14362#(<= 3 ~n), 14363#(<= 4 ~n), 14364#(<= 5 ~n), 14365#(<= 6 ~n), 14366#(<= 7 ~n), 14367#(<= 8 ~n), 14368#(<= 9 ~n), 14369#(<= 10 ~n), 14370#(<= 11 ~n), 14371#(<= 12 ~n), 14372#(= foo_~i~0 0), 14373#(<= foo_~i~0 1), 14374#(<= foo_~i~0 2), 14375#(<= foo_~i~0 3), 14376#(<= foo_~i~0 4), 14377#(<= foo_~i~0 5), 14378#(<= foo_~i~0 6), 14379#(<= foo_~i~0 7), 14380#(<= foo_~i~0 8), 14381#(<= foo_~i~0 9), 14382#(<= foo_~i~0 10), 14383#(<= foo_~i~0 11), 14384#(<= ~n 11)] [2018-02-02 20:20:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 198 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 20:20:06,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:20:06,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:20:06,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:20:06,308 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 27 states. [2018-02-02 20:20:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:06,616 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-02-02 20:20:06,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:20:06,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 150 [2018-02-02 20:20:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:06,617 INFO L225 Difference]: With dead ends: 165 [2018-02-02 20:20:06,617 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 20:20:06,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=499, Invalid=1061, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:20:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 20:20:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2018-02-02 20:20:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:20:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-02-02 20:20:06,619 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 150 [2018-02-02 20:20:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:06,619 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-02-02 20:20:06,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:20:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-02-02 20:20:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 20:20:06,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:06,620 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:06,620 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:06,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1115802860, now seen corresponding path program 32 times [2018-02-02 20:20:06,621 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:06,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 43 proven. 475 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 20:20:08,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:08,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 20:20:08,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:08,653 INFO L182 omatonBuilderFactory]: Interpolants [14731#true, 14732#false, 14733#(and (<= 1 ~n) (<= ~n 1)), 14734#(and (<= ~n 2) (<= 2 ~n)), 14735#(and (<= 3 ~n) (<= ~n 3)), 14736#(and (<= 4 ~n) (<= ~n 4)), 14737#(and (<= ~n 5) (<= 5 ~n)), 14738#(and (<= 6 ~n) (<= ~n 6)), 14739#(and (<= ~n 7) (<= 7 ~n)), 14740#(and (<= 8 ~n) (<= ~n 8)), 14741#(and (<= ~n 9) (<= 9 ~n)), 14742#(and (<= ~n 10) (<= 10 ~n)), 14743#(and (<= ~n 11) (<= 11 ~n)), 14744#(and (<= ~n 12) (<= 12 ~n)), 14745#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 12) (<= 12 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 14746#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= ~n 12) (<= 12 ~n)), 14747#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= ~n 12) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 12 ~n)), 14748#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ ~b.offset (* 3 ~n)) (+ |main_#t~post8.offset| 40)) (<= 12 ~n)), 14749#(and (= 4 ~b.offset) (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~n 12) (<= 12 ~n)), 14750#(= |#memory_int| |old(#memory_int)|), 14751#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 14752#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 14753#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (<= 37 (+ ~a.offset (* 3 ~n))) (<= (+ (* 4 foo_~i~0) ~a.offset) (+ ~n 35)) (< foo_~i~0 (+ ~n 1)))), 14754#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14755#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14756#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 14757#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 14758#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14759#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 14760#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14761#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14762#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 14763#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 14764#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14765#(and (or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~a.offset (* 3 ~n)) 35) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= 41 (+ ~b.offset (* 3 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 14766#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)) (or (<= (+ ~a.offset (* 3 ~n)) 35) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 41 (+ ~b.offset (* 3 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 14767#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 44)) (or (<= (+ ~a.offset (* 3 ~n)) 35) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 41 (+ ~b.offset (* 3 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 14768#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 14769#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 14770#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-02 20:20:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 43 proven. 475 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 20:20:08,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 20:20:08,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 20:20:08,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:20:08,654 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 40 states. [2018-02-02 20:20:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:12,367 INFO L93 Difference]: Finished difference Result 292 states and 298 transitions. [2018-02-02 20:20:12,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-02-02 20:20:12,367 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-02-02 20:20:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:12,368 INFO L225 Difference]: With dead ends: 292 [2018-02-02 20:20:12,368 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 20:20:12,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3783 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1966, Invalid=11606, Unknown=0, NotChecked=0, Total=13572 [2018-02-02 20:20:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 20:20:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 269. [2018-02-02 20:20:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 20:20:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 274 transitions. [2018-02-02 20:20:12,371 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 274 transitions. Word has length 154 [2018-02-02 20:20:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:12,372 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 274 transitions. [2018-02-02 20:20:12,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 20:20:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 274 transitions. [2018-02-02 20:20:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 20:20:12,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:12,373 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:12,373 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:12,373 INFO L82 PathProgramCache]: Analyzing trace with hash 471238383, now seen corresponding path program 33 times [2018-02-02 20:20:12,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:12,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 234 proven. 288 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 20:20:12,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:12,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:20:12,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:12,573 INFO L182 omatonBuilderFactory]: Interpolants [15488#false, 15489#(<= 1 ~n), 15490#(<= 2 ~n), 15491#(<= 3 ~n), 15492#(<= 4 ~n), 15493#(<= 5 ~n), 15494#(<= 6 ~n), 15495#(<= 7 ~n), 15496#(<= 8 ~n), 15497#(<= 9 ~n), 15498#(<= 10 ~n), 15499#(<= 11 ~n), 15500#(<= 12 ~n), 15501#(<= 13 ~n), 15502#(= foo_~i~0 0), 15503#(<= foo_~i~0 1), 15504#(<= foo_~i~0 2), 15505#(<= foo_~i~0 3), 15506#(<= foo_~i~0 4), 15507#(<= foo_~i~0 5), 15508#(<= foo_~i~0 6), 15509#(<= foo_~i~0 7), 15510#(<= foo_~i~0 8), 15511#(<= foo_~i~0 9), 15512#(<= foo_~i~0 10), 15513#(<= foo_~i~0 11), 15514#(<= foo_~i~0 12), 15515#(<= ~n 12), 15487#true] [2018-02-02 20:20:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 234 proven. 288 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 20:20:12,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:20:12,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:20:12,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:20:12,573 INFO L87 Difference]: Start difference. First operand 269 states and 274 transitions. Second operand 29 states. [2018-02-02 20:20:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:13,097 INFO L93 Difference]: Finished difference Result 366 states and 373 transitions. [2018-02-02 20:20:13,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 20:20:13,098 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 157 [2018-02-02 20:20:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:13,099 INFO L225 Difference]: With dead ends: 366 [2018-02-02 20:20:13,099 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 20:20:13,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1518, Invalid=3312, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 20:20:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 20:20:13,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 277. [2018-02-02 20:20:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-02 20:20:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 282 transitions. [2018-02-02 20:20:13,102 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 282 transitions. Word has length 157 [2018-02-02 20:20:13,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:13,102 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 282 transitions. [2018-02-02 20:20:13,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:20:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 282 transitions. [2018-02-02 20:20:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-02 20:20:13,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:13,103 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:13,104 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1279578027, now seen corresponding path program 34 times [2018-02-02 20:20:13,104 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:13,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 200 proven. 286 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-02 20:20:13,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:13,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:20:13,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:13,309 INFO L182 omatonBuilderFactory]: Interpolants [16256#(<= 1 foo_~i~0), 16257#(<= 2 foo_~i~0), 16258#(<= 3 foo_~i~0), 16259#(<= 4 foo_~i~0), 16260#(<= 5 foo_~i~0), 16261#(<= 6 foo_~i~0), 16262#(<= 7 foo_~i~0), 16263#(<= 8 foo_~i~0), 16264#(<= 9 foo_~i~0), 16265#(<= 10 foo_~i~0), 16266#(<= 11 foo_~i~0), 16267#(<= 13 ~n), 16241#true, 16242#false, 16243#(<= ~n 1), 16244#(<= ~n 2), 16245#(<= ~n 3), 16246#(<= ~n 4), 16247#(<= ~n 5), 16248#(<= ~n 6), 16249#(<= ~n 7), 16250#(<= ~n 8), 16251#(<= ~n 9), 16252#(<= ~n 10), 16253#(<= ~n 11), 16254#(<= ~n 12), 16255#(= foo_~i~0 0)] [2018-02-02 20:20:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 200 proven. 286 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-02 20:20:13,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:20:13,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:20:13,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:20:13,309 INFO L87 Difference]: Start difference. First operand 277 states and 282 transitions. Second operand 27 states. [2018-02-02 20:20:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:13,767 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2018-02-02 20:20:13,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:20:13,768 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 158 [2018-02-02 20:20:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:13,768 INFO L225 Difference]: With dead ends: 271 [2018-02-02 20:20:13,768 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 20:20:13,768 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=344, Invalid=1216, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:20:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 20:20:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 20:20:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 20:20:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-02-02 20:20:13,770 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 158 [2018-02-02 20:20:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:13,770 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-02-02 20:20:13,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:20:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-02-02 20:20:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-02 20:20:13,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:13,771 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:13,771 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash -955005937, now seen corresponding path program 35 times [2018-02-02 20:20:13,771 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:13,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 281 proven. 326 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-02 20:20:15,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:15,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 20:20:15,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:15,575 INFO L182 omatonBuilderFactory]: Interpolants [16768#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16769#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 16770#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 16771#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16772#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 16773#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16774#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16775#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 16776#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 16777#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16778#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)), 16779#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 16780#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 16781#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 ~n) 48) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 16782#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 16783#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 16784#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|)), 16743#true, 16744#false, 16745#(<= 1 ~n), 16746#(<= 2 ~n), 16747#(<= 3 ~n), 16748#(<= 4 ~n), 16749#(<= 5 ~n), 16750#(<= 6 ~n), 16751#(<= 7 ~n), 16752#(<= 8 ~n), 16753#(<= 9 ~n), 16754#(<= 10 ~n), 16755#(<= 11 ~n), 16756#(<= 12 ~n), 16757#(<= 13 ~n), 16758#(and (= 0 |main_#t~malloc6.offset|) (<= 13 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 16759#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 13 ~n)), 16760#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= 13 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 16761#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (or (not (= 4 ~b.offset)) (and (<= (+ |main_#t~post8.offset| 56) (+ ~b.offset (* 4 ~n))) (= (* 4 ~n) (select |#length| ~b.base)))) (<= ~b.offset 4)), 16762#(and (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 52 (* 4 ~n))) (not (= 4 ~b.offset))) (= ~a.offset 0) (not (= ~a.base ~b.base)) (<= ~b.offset 4)), 16763#(= |#memory_int| |old(#memory_int)|), 16764#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 16765#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 16766#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (< foo_~i~0 (+ ~n 1))), 16767#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))] [2018-02-02 20:20:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 281 proven. 326 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-02 20:20:15,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 20:20:15,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 20:20:15,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:20:15,576 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 42 states. [2018-02-02 20:20:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:18,215 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-02-02 20:20:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-02 20:20:18,215 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 165 [2018-02-02 20:20:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:18,215 INFO L225 Difference]: With dead ends: 177 [2018-02-02 20:20:18,216 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 20:20:18,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 14 SyntacticMatches, 12 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2291, Invalid=7411, Unknown=0, NotChecked=0, Total=9702 [2018-02-02 20:20:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 20:20:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-02-02 20:20:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 20:20:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-02-02 20:20:18,217 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 165 [2018-02-02 20:20:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:18,217 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-02-02 20:20:18,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 20:20:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-02-02 20:20:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-02 20:20:18,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:18,218 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:18,218 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2120444710, now seen corresponding path program 36 times [2018-02-02 20:20:18,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:18,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 253 proven. 319 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-02 20:20:18,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:18,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 20:20:18,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:18,617 INFO L182 omatonBuilderFactory]: Interpolants [17246#true, 17247#false, 17248#(<= ~n 1), 17249#(<= ~n 2), 17250#(<= ~n 3), 17251#(<= ~n 4), 17252#(<= ~n 5), 17253#(<= ~n 6), 17254#(<= ~n 7), 17255#(<= ~n 8), 17256#(<= ~n 9), 17257#(<= ~n 10), 17258#(<= ~n 11), 17259#(<= ~n 12), 17260#(<= ~n 13), 17261#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 13)), 17262#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 48))), 17263#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 48))), 17264#(= foo_~i~0 0), 17265#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17266#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17267#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17268#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17269#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17270#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17271#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17272#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17273#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17274#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17275#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17276#(or (<= 11 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17277#(or (<= 12 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17278#(or (<= (+ ~b.offset 52) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-02 20:20:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 253 proven. 319 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-02 20:20:18,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:20:18,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:20:18,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:20:18,618 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 33 states. [2018-02-02 20:20:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:19,462 INFO L93 Difference]: Finished difference Result 287 states and 290 transitions. [2018-02-02 20:20:19,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 20:20:19,462 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 169 [2018-02-02 20:20:19,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:19,463 INFO L225 Difference]: With dead ends: 287 [2018-02-02 20:20:19,463 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 20:20:19,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=454, Invalid=1996, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:20:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 20:20:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-02-02 20:20:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 20:20:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-02-02 20:20:19,465 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 169 [2018-02-02 20:20:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:19,465 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-02-02 20:20:19,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:20:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-02-02 20:20:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 20:20:19,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:19,465 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:19,465 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:19,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1602455019, now seen corresponding path program 37 times [2018-02-02 20:20:19,466 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:19,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 273 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-02 20:20:19,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:19,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:20:19,696 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:19,696 INFO L182 omatonBuilderFactory]: Interpolants [17792#(<= 5 ~n), 17793#(<= 6 ~n), 17794#(<= 7 ~n), 17795#(<= 8 ~n), 17796#(<= 9 ~n), 17797#(<= 10 ~n), 17798#(<= 11 ~n), 17799#(<= 12 ~n), 17800#(<= 13 ~n), 17801#(<= 14 ~n), 17802#(= foo_~i~0 0), 17803#(<= foo_~i~0 1), 17804#(<= foo_~i~0 2), 17805#(<= foo_~i~0 3), 17806#(<= foo_~i~0 4), 17807#(<= foo_~i~0 5), 17808#(<= foo_~i~0 6), 17809#(<= foo_~i~0 7), 17810#(<= foo_~i~0 8), 17811#(<= foo_~i~0 9), 17812#(<= foo_~i~0 10), 17813#(<= foo_~i~0 11), 17814#(<= foo_~i~0 12), 17815#(<= foo_~i~0 13), 17816#(<= ~n 13), 17786#true, 17787#false, 17788#(<= 1 ~n), 17789#(<= 2 ~n), 17790#(<= 3 ~n), 17791#(<= 4 ~n)] [2018-02-02 20:20:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 273 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-02 20:20:19,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 20:20:19,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 20:20:19,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:20:19,697 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 31 states. [2018-02-02 20:20:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:19,967 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2018-02-02 20:20:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:20:19,967 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 172 [2018-02-02 20:20:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:19,968 INFO L225 Difference]: With dead ends: 187 [2018-02-02 20:20:19,968 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 20:20:19,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=665, Invalid=1405, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:20:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 20:20:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2018-02-02 20:20:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 20:20:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2018-02-02 20:20:19,970 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 172 [2018-02-02 20:20:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:19,970 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2018-02-02 20:20:19,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 20:20:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2018-02-02 20:20:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-02-02 20:20:19,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:19,971 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:19,971 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2051704948, now seen corresponding path program 38 times [2018-02-02 20:20:19,971 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:19,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 187 proven. 516 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-02-02 20:20:21,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:21,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 20:20:21,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:21,665 INFO L182 omatonBuilderFactory]: Interpolants [18240#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 3 foo_~i~0)), 18241#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 4 foo_~i~0)), 18242#(or (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 5 foo_~i~0)) (not (= 4 ~b.offset))), 18243#(or (not (= 4 ~b.offset)) (and (<= 6 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 18244#(or (not (= 4 ~b.offset)) (and (<= 7 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 18245#(or (not (= 4 ~b.offset)) (and (<= 8 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 18246#(or (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 9 foo_~i~0)) (not (= 4 ~b.offset))), 18247#(or (not (= 4 ~b.offset)) (and (<= 10 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 18248#(or (and (<= 11 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (not (= 4 ~b.offset))), 18249#(or (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 12 foo_~i~0)) (not (= 4 ~b.offset))), 18250#(or (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (and (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~b.offset 53) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))) (<= 12 foo_~i~0))), 18251#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~b.offset 53) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 18252#(and (= 0 ~a.offset) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 18253#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= 0 ~a.offset)), 18254#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset)), 18211#true, 18212#false, 18213#(<= ~n 1), 18214#(<= ~n 2), 18215#(<= ~n 3), 18216#(<= ~n 4), 18217#(<= ~n 5), 18218#(<= ~n 6), 18219#(<= ~n 7), 18220#(<= ~n 8), 18221#(<= ~n 9), 18222#(<= ~n 10), 18223#(<= ~n 11), 18224#(<= ~n 12), 18225#(<= ~n 13), 18226#(<= ~n 14), 18227#(and (<= ~n 14) (= 0 |main_#t~malloc6.offset|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 18228#(and (<= ~n 14) (= (select |#valid| ~a.base) 1) (= 0 ~a.offset)), 18229#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= ~n 14) (= 0 ~a.offset) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 18230#(and (= 4 ~b.offset) (= ~b.base |main_#t~post8.base|) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 52)) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)) (= (+ |main_#t~post8.offset| 4) ~b.offset) (= 0 ~a.offset)), 18231#(and (= 0 ~a.offset) (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 52)))) (<= ~b.offset 4)), 18232#(= |#memory_int| |old(#memory_int)|), 18233#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 18234#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 18235#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 18236#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0)), 18237#(and (= foo_~i~0 0) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 18238#(and (<= 1 foo_~i~0) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 18239#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 2 foo_~i~0))] [2018-02-02 20:20:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 187 proven. 516 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-02-02 20:20:21,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 20:20:21,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 20:20:21,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1663, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:20:21,666 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand 44 states. [2018-02-02 20:20:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:26,247 INFO L93 Difference]: Finished difference Result 308 states and 312 transitions. [2018-02-02 20:20:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-02-02 20:20:26,247 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 176 [2018-02-02 20:20:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:26,248 INFO L225 Difference]: With dead ends: 308 [2018-02-02 20:20:26,248 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:20:26,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 15 SyntacticMatches, 13 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6944 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2723, Invalid=19033, Unknown=0, NotChecked=0, Total=21756 [2018-02-02 20:20:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:20:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-02-02 20:20:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 20:20:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-02-02 20:20:26,250 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 176 [2018-02-02 20:20:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:26,250 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-02-02 20:20:26,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 20:20:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-02-02 20:20:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-02 20:20:26,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:26,251 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:26,251 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash -469715441, now seen corresponding path program 39 times [2018-02-02 20:20:26,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:26,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 315 proven. 338 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-02 20:20:26,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:26,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:20:26,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:26,487 INFO L182 omatonBuilderFactory]: Interpolants [18951#true, 18952#false, 18953#(<= 1 ~n), 18954#(<= 2 ~n), 18955#(<= 3 ~n), 18956#(<= 4 ~n), 18957#(<= 5 ~n), 18958#(<= 6 ~n), 18959#(<= 7 ~n), 18960#(<= 8 ~n), 18961#(<= 9 ~n), 18962#(<= 10 ~n), 18963#(<= 11 ~n), 18964#(<= 12 ~n), 18965#(<= 13 ~n), 18966#(<= 14 ~n), 18967#(<= 15 ~n), 18968#(= foo_~i~0 0), 18969#(<= foo_~i~0 1), 18970#(<= foo_~i~0 2), 18971#(<= foo_~i~0 3), 18972#(<= foo_~i~0 4), 18973#(<= foo_~i~0 5), 18974#(<= foo_~i~0 6), 18975#(<= foo_~i~0 7), 18976#(<= foo_~i~0 8), 18977#(<= foo_~i~0 9), 18978#(<= foo_~i~0 10), 18979#(<= foo_~i~0 11), 18980#(<= foo_~i~0 12), 18981#(<= foo_~i~0 13), 18982#(<= ~n 14)] [2018-02-02 20:20:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 315 proven. 338 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-02 20:20:26,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:20:26,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:20:26,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:20:26,487 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 32 states. [2018-02-02 20:20:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:26,794 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-02-02 20:20:26,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:20:26,794 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 179 [2018-02-02 20:20:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:26,795 INFO L225 Difference]: With dead ends: 188 [2018-02-02 20:20:26,795 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 20:20:26,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=695, Invalid=1467, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:20:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 20:20:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2018-02-02 20:20:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 20:20:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-02-02 20:20:26,797 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 179 [2018-02-02 20:20:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:26,797 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-02-02 20:20:26,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:20:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-02-02 20:20:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-02 20:20:26,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:26,798 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:26,798 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:26,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1752736474, now seen corresponding path program 40 times [2018-02-02 20:20:26,799 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:26,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 315 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-02 20:20:27,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:27,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 20:20:27,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:27,113 INFO L182 omatonBuilderFactory]: Interpolants [19399#true, 19400#false, 19401#(<= 1 ~n), 19402#(<= 2 ~n), 19403#(<= 3 ~n), 19404#(<= 4 ~n), 19405#(<= 5 ~n), 19406#(<= 6 ~n), 19407#(<= 7 ~n), 19408#(<= 8 ~n), 19409#(<= 9 ~n), 19410#(<= 10 ~n), 19411#(<= 11 ~n), 19412#(<= 12 ~n), 19413#(<= 13 ~n), 19414#(<= 14 ~n), 19415#(<= 15 ~n), 19416#(= foo_~i~0 0), 19417#(<= foo_~i~0 1), 19418#(<= foo_~i~0 2), 19419#(<= foo_~i~0 3), 19420#(<= foo_~i~0 4), 19421#(<= foo_~i~0 5), 19422#(<= foo_~i~0 6), 19423#(<= foo_~i~0 7), 19424#(<= foo_~i~0 8), 19425#(<= foo_~i~0 9), 19426#(<= foo_~i~0 10), 19427#(<= foo_~i~0 11), 19428#(<= foo_~i~0 12), 19429#(<= foo_~i~0 13), 19430#(<= foo_~i~0 14), 19431#(<= ~n 14)] [2018-02-02 20:20:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 315 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-02 20:20:27,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:20:27,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:20:27,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:20:27,114 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 33 states. [2018-02-02 20:20:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:27,445 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2018-02-02 20:20:27,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:20:27,445 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 183 [2018-02-02 20:20:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:27,445 INFO L225 Difference]: With dead ends: 198 [2018-02-02 20:20:27,445 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 20:20:27,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=757, Invalid=1595, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:20:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 20:20:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2018-02-02 20:20:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 20:20:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-02-02 20:20:27,447 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 183 [2018-02-02 20:20:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:27,447 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-02-02 20:20:27,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:20:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-02-02 20:20:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 20:20:27,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:27,448 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:27,448 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash -602652369, now seen corresponding path program 41 times [2018-02-02 20:20:27,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:27,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 370 proven. 436 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-02-02 20:20:29,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:29,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-02 20:20:29,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:29,665 INFO L182 omatonBuilderFactory]: Interpolants [19850#true, 19851#false, 19852#(<= 1 ~n), 19853#(<= 2 ~n), 19854#(<= 3 ~n), 19855#(<= 4 ~n), 19856#(<= 5 ~n), 19857#(<= 6 ~n), 19858#(<= 7 ~n), 19859#(<= 8 ~n), 19860#(<= 9 ~n), 19861#(<= 10 ~n), 19862#(<= 11 ~n), 19863#(<= 12 ~n), 19864#(<= 13 ~n), 19865#(<= 14 ~n), 19866#(<= 15 ~n), 19867#(and (= 0 |main_#t~malloc6.offset|) (<= 15 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 19868#(and (= (select |#valid| ~a.base) 1) (= 0 ~a.offset) (<= 15 ~n)), 19869#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= 0 ~a.offset) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 15 ~n)), 19870#(and (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 64) (+ ~b.offset (* 4 ~n))) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)))) (= 0 ~a.offset) (<= ~b.offset 4)), 19871#(and (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= 60 (* 4 ~n)) (= (* 4 ~n) (select |#length| ~b.base)))) (= 0 ~a.offset) (<= ~b.offset 4)), 19872#(= |#memory_int| |old(#memory_int)|), 19873#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 19874#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 19875#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 19876#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19877#(or (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19878#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 19879#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 19880#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19881#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 19882#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19883#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19884#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 19885#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 19886#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19887#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)), 19888#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44)), 19889#(or (<= (* 4 foo_~i~0) 48) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19890#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 foo_~i~0) 48) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 19891#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 52)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 19892#(or (and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 56))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 19893#(and (= 0 ~a.offset) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 19894#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= 0 ~a.offset)), 19895#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset))] [2018-02-02 20:20:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 370 proven. 436 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-02-02 20:20:29,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 20:20:29,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 20:20:29,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1663, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:20:29,666 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 46 states. [2018-02-02 20:20:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:32,740 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-02-02 20:20:32,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-02 20:20:32,740 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 187 [2018-02-02 20:20:32,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:32,740 INFO L225 Difference]: With dead ends: 199 [2018-02-02 20:20:32,741 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 20:20:32,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 16 SyntacticMatches, 14 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2848, Invalid=9142, Unknown=0, NotChecked=0, Total=11990 [2018-02-02 20:20:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 20:20:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-02-02 20:20:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:20:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-02-02 20:20:32,742 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 187 [2018-02-02 20:20:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:32,742 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-02-02 20:20:32,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 20:20:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-02-02 20:20:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-02 20:20:32,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:32,743 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:32,743 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:32,743 INFO L82 PathProgramCache]: Analyzing trace with hash -157263802, now seen corresponding path program 42 times [2018-02-02 20:20:32,744 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:32,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 351 proven. 414 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-02 20:20:33,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:33,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 20:20:33,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:33,416 INFO L182 omatonBuilderFactory]: Interpolants [20416#false, 20417#(<= ~n 1), 20418#(<= ~n 2), 20419#(<= ~n 3), 20420#(<= ~n 4), 20421#(<= ~n 5), 20422#(<= ~n 6), 20423#(<= ~n 7), 20424#(<= ~n 8), 20425#(<= ~n 9), 20426#(<= ~n 10), 20427#(<= ~n 11), 20428#(<= ~n 12), 20429#(<= ~n 13), 20430#(<= ~n 14), 20431#(<= ~n 15), 20432#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 15)), 20433#(and (= |main_#t~post8.offset| 0) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 56)) (= (* 4 ~n) (select |#length| ~b.base))), 20434#(and (<= (* 4 ~n) (+ ~b.offset 56)) (= (* 4 ~n) (select |#length| ~b.base))), 20435#(= foo_~i~0 0), 20436#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20437#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20438#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20439#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20440#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20441#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20442#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20443#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20444#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20445#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20446#(or (<= 11 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20447#(or (<= 12 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20448#(or (<= 13 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20449#(or (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 14 foo_~i~0)), 20450#(or (<= (+ ~b.offset 60) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20415#true] [2018-02-02 20:20:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 351 proven. 414 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-02 20:20:33,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:20:33,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:20:33,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:20:33,417 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 36 states. [2018-02-02 20:20:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:34,401 INFO L93 Difference]: Finished difference Result 325 states and 328 transitions. [2018-02-02 20:20:34,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 20:20:34,401 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 191 [2018-02-02 20:20:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:34,402 INFO L225 Difference]: With dead ends: 325 [2018-02-02 20:20:34,402 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 20:20:34,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=574, Invalid=2396, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:20:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 20:20:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-02-02 20:20:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 20:20:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2018-02-02 20:20:34,403 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 191 [2018-02-02 20:20:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:34,403 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2018-02-02 20:20:34,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 20:20:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-02-02 20:20:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-02 20:20:34,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:34,404 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:34,404 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-02 20:20:34,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1635508555, now seen corresponding path program 43 times [2018-02-02 20:20:34,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:34,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 360 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-02 20:20:34,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:34,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 20:20:34,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:34,677 INFO L182 omatonBuilderFactory]: Interpolants [21056#(<= foo_~i~0 14), 21057#(<= foo_~i~0 15), 21058#(<= ~n 15), 21024#true, 21025#false, 21026#(<= 1 ~n), 21027#(<= 2 ~n), 21028#(<= 3 ~n), 21029#(<= 4 ~n), 21030#(<= 5 ~n), 21031#(<= 6 ~n), 21032#(<= 7 ~n), 21033#(<= 8 ~n), 21034#(<= 9 ~n), 21035#(<= 10 ~n), 21036#(<= 11 ~n), 21037#(<= 12 ~n), 21038#(<= 13 ~n), 21039#(<= 14 ~n), 21040#(<= 15 ~n), 21041#(<= 16 ~n), 21042#(= foo_~i~0 0), 21043#(<= foo_~i~0 1), 21044#(<= foo_~i~0 2), 21045#(<= foo_~i~0 3), 21046#(<= foo_~i~0 4), 21047#(<= foo_~i~0 5), 21048#(<= foo_~i~0 6), 21049#(<= foo_~i~0 7), 21050#(<= foo_~i~0 8), 21051#(<= foo_~i~0 9), 21052#(<= foo_~i~0 10), 21053#(<= foo_~i~0 11), 21054#(<= foo_~i~0 12), 21055#(<= foo_~i~0 13)] [2018-02-02 20:20:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 360 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-02 20:20:34,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 20:20:34,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 20:20:34,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:20:34,678 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 35 states. Received shutdown request... [2018-02-02 20:20:34,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:20:34,920 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:20:34,924 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:20:34,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:20:34 BoogieIcfgContainer [2018-02-02 20:20:34,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:20:34,925 INFO L168 Benchmark]: Toolchain (without parser) took 77096.39 ms. Allocated memory was 398.5 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 355.1 MB in the beginning and 1.3 GB in the end (delta: -941.5 MB). Peak memory consumption was 82.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:34,926 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:20:34,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.86 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 344.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:34,926 INFO L168 Benchmark]: Boogie Preprocessor took 30.35 ms. Allocated memory is still 398.5 MB. Free memory was 344.5 MB in the beginning and 343.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:34,926 INFO L168 Benchmark]: RCFGBuilder took 191.50 ms. Allocated memory is still 398.5 MB. Free memory was 343.1 MB in the beginning and 321.9 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:34,927 INFO L168 Benchmark]: TraceAbstraction took 76715.79 ms. Allocated memory was 398.5 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 321.9 MB in the beginning and 1.3 GB in the end (delta: -974.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:34,928 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.22 ms. Allocated memory is still 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.86 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 344.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.35 ms. Allocated memory is still 398.5 MB. Free memory was 344.5 MB in the beginning and 343.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 191.50 ms. Allocated memory is still 398.5 MB. Free memory was 343.1 MB in the beginning and 321.9 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76715.79 ms. Allocated memory was 398.5 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 321.9 MB in the beginning and 1.3 GB in the end (delta: -974.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (195states) and interpolant automaton (currently 35 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (158 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 19 error locations. TIMEOUT Result, 76.6s OverallTime, 63 OverallIterations, 16 TraceHistogramMax, 48.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2432 SDtfs, 24544 SDslu, 20422 SDs, 0 SdLazy, 32669 SolverSat, 9120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2864 GetRequests, 368 SyntacticMatches, 140 SemanticMatches, 2356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37516 ImplicationChecksByTransitivity, 52.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 12413/20746 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 62 MinimizatonAttempts, 890 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 5796 NumberOfCodeBlocks, 5796 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 5733 ConstructedInterpolants, 0 QuantifiedInterpolants, 5612131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 63 InterpolantComputations, 13 PerfectInterpolantSequences, 12413/20746 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-20-34-934.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-20-34-934.csv Completed graceful shutdown