java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:41:09,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:41:09,175 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:41:09,186 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:41:09,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:41:09,187 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:41:09,188 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:41:09,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:41:09,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:41:09,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:41:09,192 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:41:09,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:41:09,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:41:09,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:41:09,195 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:41:09,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:41:09,198 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:41:09,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:41:09,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:41:09,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:41:09,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:41:09,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:41:09,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:41:09,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:41:09,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:41:09,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:41:09,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:41:09,207 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:41:09,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:41:09,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:41:09,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:41:09,208 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:41:09,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:41:09,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:41:09,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:41:09,220 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:41:09,220 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:41:09,220 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:41:09,220 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:41:09,221 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:41:09,221 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:41:09,221 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:41:09,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:41:09,221 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:41:09,221 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:41:09,222 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:41:09,222 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:41:09,222 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:41:09,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:41:09,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:41:09,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:41:09,223 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:41:09,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:41:09,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:41:09,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:41:09,223 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:41:09,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:41:09,261 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:41:09,263 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:41:09,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:41:09,264 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:41:09,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-02-02 10:41:09,339 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:41:09,340 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:41:09,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:41:09,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:41:09,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:41:09,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:41:09" (1/1) ... [2018-02-02 10:41:09,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3965f966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09, skipping insertion in model container [2018-02-02 10:41:09,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:41:09" (1/1) ... [2018-02-02 10:41:09,356 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:41:09,366 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:41:09,442 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:41:09,455 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:41:09,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09 WrapperNode [2018-02-02 10:41:09,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:41:09,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:41:09,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:41:09,460 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:41:09,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09" (1/1) ... [2018-02-02 10:41:09,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09" (1/1) ... [2018-02-02 10:41:09,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09" (1/1) ... [2018-02-02 10:41:09,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09" (1/1) ... [2018-02-02 10:41:09,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09" (1/1) ... [2018-02-02 10:41:09,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09" (1/1) ... [2018-02-02 10:41:09,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09" (1/1) ... [2018-02-02 10:41:09,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:41:09,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:41:09,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:41:09,490 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:41:09,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:41:09,538 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:41:09,538 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:41:09,538 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 10:41:09,538 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:41:09,538 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:41:09,538 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:41:09,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:41:09,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:41:09,539 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:41:09,539 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 10:41:09,539 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:41:09,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:41:09,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:41:09,697 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:41:09,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:41:09 BoogieIcfgContainer [2018-02-02 10:41:09,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:41:09,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:41:09,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:41:09,700 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:41:09,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:41:09" (1/3) ... [2018-02-02 10:41:09,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7c629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:41:09, skipping insertion in model container [2018-02-02 10:41:09,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:41:09" (2/3) ... [2018-02-02 10:41:09,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7c629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:41:09, skipping insertion in model container [2018-02-02 10:41:09,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:41:09" (3/3) ... [2018-02-02 10:41:09,702 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-02-02 10:41:09,708 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:41:09,712 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 10:41:09,742 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:41:09,743 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:41:09,743 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:41:09,743 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:41:09,743 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:41:09,743 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:41:09,743 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:41:09,743 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:41:09,744 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:41:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 10:41:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:41:09,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:09,764 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:09,765 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-02 10:41:09,801 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:09,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:09,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:41:09,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:41:09,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:09,901 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-02 10:41:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:09,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:41:09,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:41:09,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:41:09,916 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 10:41:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:09,985 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-02 10:41:09,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:41:09,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 10:41:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:09,998 INFO L225 Difference]: With dead ends: 63 [2018-02-02 10:41:09,998 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 10:41:10,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:41:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 10:41:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-02 10:41:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:41:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-02 10:41:10,069 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-02 10:41:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:10,070 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-02 10:41:10,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:41:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-02 10:41:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:41:10,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:10,070 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:10,070 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-02 10:41:10,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:10,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:41:10,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:41:10,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,133 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= 0 main_~i~1), 167#(= 0 |foo_#in~size|), 168#(and (= foo_~size 0) (= foo_~i~0 0)), 169#(= foo_~i~0 0)] [2018-02-02 10:41:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:41:10,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:41:10,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:41:10,135 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-02-02 10:41:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:10,273 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-02 10:41:10,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:41:10,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-02 10:41:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:10,276 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:41:10,276 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:41:10,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:41:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:41:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-02-02 10:41:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 10:41:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-02-02 10:41:10,283 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-02-02 10:41:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:10,283 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-02-02 10:41:10,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:41:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-02-02 10:41:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:41:10,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:10,284 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:10,284 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-02 10:41:10,285 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:10,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:41:10,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:41:10,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,452 INFO L182 omatonBuilderFactory]: Interpolants [336#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 329#true, 330#false, 331#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 332#(and (= 0 main_~i~1) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 333#(and (= 0 |foo_#in~b.offset|) (= 0 |foo_#in~size|) (= 32 (select |#length| |foo_#in~b.base|))), 334#(and (= foo_~size 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 335#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0))] [2018-02-02 10:41:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:41:10,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:41:10,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:41:10,453 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 8 states. [2018-02-02 10:41:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:10,611 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 10:41:10,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:41:10,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 10:41:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:10,612 INFO L225 Difference]: With dead ends: 75 [2018-02-02 10:41:10,612 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 10:41:10,612 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 10:41:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 10:41:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-02 10:41:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 10:41:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-02 10:41:10,616 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2018-02-02 10:41:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:10,616 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-02 10:41:10,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:41:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-02 10:41:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:41:10,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:10,617 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:10,617 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-02 10:41:10,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:10,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:41:10,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:41:10,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,651 INFO L182 omatonBuilderFactory]: Interpolants [484#true, 485#false, 486#(= 1 (select |#valid| |main_~#mask~0.base|)), 487#(= 1 (select |#valid| |foo_#in~b.base|)), 488#(= 1 (select |#valid| foo_~b.base))] [2018-02-02 10:41:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:41:10,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:41:10,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:41:10,652 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-02-02 10:41:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:10,688 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-02 10:41:10,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:41:10,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:41:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:10,689 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:41:10,689 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:41:10,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:41:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:41:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-02 10:41:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 10:41:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-02-02 10:41:10,693 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-02-02 10:41:10,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:10,693 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-02-02 10:41:10,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:41:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-02-02 10:41:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:41:10,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:10,693 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] [2018-02-02 10:41:10,693 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-02 10:41:10,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:10,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:10,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:41:10,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,813 INFO L182 omatonBuilderFactory]: Interpolants [624#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 625#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 626#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 627#(and (<= 0 foo_~i~0) (<= foo_~i~0 31)), 628#(and (<= 1 foo_~i~0) (<= foo_~i~0 32)), 621#true, 622#false, 623#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))] [2018-02-02 10:41:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:41:10,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:41:10,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:41:10,814 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 8 states. [2018-02-02 10:41:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:10,935 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-02-02 10:41:10,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:41:10,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 10:41:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:10,936 INFO L225 Difference]: With dead ends: 73 [2018-02-02 10:41:10,936 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 10:41:10,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:41:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 10:41:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-02-02 10:41:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 10:41:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-02 10:41:10,940 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 22 [2018-02-02 10:41:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:10,940 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-02 10:41:10,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:41:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-02 10:41:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:41:10,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:10,941 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:10,941 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:10,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-02-02 10:41:10,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:10,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:41:10,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:41:10,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:41:10,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:10,979 INFO L182 omatonBuilderFactory]: Interpolants [772#true, 773#false, 774#(<= 0 main_~i~1), 775#(<= 1 main_~i~1), 776#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-02 10:41:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:41:10,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:41:10,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:41:10,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:41:10,980 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 5 states. [2018-02-02 10:41:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:11,027 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-02-02 10:41:11,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:41:11,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:41:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:11,028 INFO L225 Difference]: With dead ends: 73 [2018-02-02 10:41:11,028 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 10:41:11,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:41:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 10:41:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2018-02-02 10:41:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:41:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-02 10:41:11,033 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 29 [2018-02-02 10:41:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:11,033 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-02 10:41:11,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:41:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-02 10:41:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:41:11,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:11,034 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:11,034 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:11,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-02 10:41:11,035 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:11,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:41:11,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:11,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:41:11,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:11,068 INFO L182 omatonBuilderFactory]: Interpolants [912#false, 913#(= main_~i~1 0), 914#(<= main_~i~1 1), 911#true] [2018-02-02 10:41:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:41:11,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:41:11,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:41:11,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:41:11,069 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 4 states. [2018-02-02 10:41:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:11,128 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-02-02 10:41:11,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:41:11,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-02-02 10:41:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:11,130 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:41:11,130 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:41:11,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:41:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:41:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2018-02-02 10:41:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 10:41:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-02 10:41:11,136 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 37 [2018-02-02 10:41:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:11,136 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-02 10:41:11,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:41:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-02 10:41:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:41:11,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:11,137 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:11,138 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:11,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1556698143, now seen corresponding path program 1 times [2018-02-02 10:41:11,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:11,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:41:11,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:11,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:41:11,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:11,223 INFO L182 omatonBuilderFactory]: Interpolants [1072#true, 1073#false, 1074#(= 0 main_~i~1), 1075#(and (= foo_~i~0 0) (or (= foo_~size 0) (= |foo_#in~size| foo_~size))), 1076#(and (or (= foo_~size 0) (= |foo_#in~size| foo_~size)) (or (not (= foo_~size 0)) (<= foo_~i~0 1))), 1077#(not (= |foo_#in~size| 0))] [2018-02-02 10:41:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:41:11,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:41:11,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:41:11,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:41:11,224 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 6 states. [2018-02-02 10:41:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:11,293 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-02-02 10:41:11,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:41:11,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 10:41:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:11,294 INFO L225 Difference]: With dead ends: 103 [2018-02-02 10:41:11,294 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 10:41:11,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:41:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 10:41:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2018-02-02 10:41:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:41:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-02 10:41:11,298 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 41 [2018-02-02 10:41:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:11,299 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-02 10:41:11,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:41:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-02 10:41:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:41:11,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:11,300 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:11,300 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1270913383, now seen corresponding path program 2 times [2018-02-02 10:41:11,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:11,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:41:11,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:11,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:41:11,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:11,421 INFO L182 omatonBuilderFactory]: Interpolants [1264#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 1265#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 1266#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 1267#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 1261#true, 1262#false, 1263#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))] [2018-02-02 10:41:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:41:11,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:41:11,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:41:11,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:41:11,422 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 7 states. [2018-02-02 10:41:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:11,517 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-02 10:41:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:41:11,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-02-02 10:41:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:11,518 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:41:11,519 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:41:11,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:41:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:41:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2018-02-02 10:41:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:41:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-02 10:41:11,523 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 47 [2018-02-02 10:41:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:11,524 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-02 10:41:11,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:41:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-02 10:41:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:41:11,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:11,525 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:11,525 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:11,525 INFO L82 PathProgramCache]: Analyzing trace with hash 303054831, now seen corresponding path program 3 times [2018-02-02 10:41:11,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:11,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 39 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:41:11,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:11,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:41:11,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:11,661 INFO L182 omatonBuilderFactory]: Interpolants [1448#true, 1449#false, 1450#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 1451#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 1452#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 1453#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 1454#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 1455#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (<= foo_~i~0 2) (= foo_~b.offset 0))] [2018-02-02 10:41:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 39 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:41:11,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:41:11,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:41:11,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:41:11,661 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 8 states. [2018-02-02 10:41:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:11,746 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-02-02 10:41:11,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:41:11,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-02-02 10:41:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:11,747 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:41:11,747 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:41:11,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:41:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:41:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2018-02-02 10:41:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:41:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-02-02 10:41:11,750 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 53 [2018-02-02 10:41:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:11,750 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-02-02 10:41:11,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:41:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-02-02 10:41:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:41:11,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:11,751 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:11,752 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1141394329, now seen corresponding path program 2 times [2018-02-02 10:41:11,753 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:11,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 10:41:11,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:11,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:41:11,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:11,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 10:41:11,796 INFO L182 omatonBuilderFactory]: Interpolants [1664#(= main_~i~1 0), 1665#(<= main_~i~1 1), 1666#(<= main_~i~1 2), 1662#true, 1663#false] [2018-02-02 10:41:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 10:41:11,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:41:11,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:41:11,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:41:11,796 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 5 states. [2018-02-02 10:41:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:11,858 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-02-02 10:41:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:41:11,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-02-02 10:41:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:11,861 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:41:11,861 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:41:11,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:41:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:41:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2018-02-02 10:41:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:41:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-02 10:41:11,867 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 55 [2018-02-02 10:41:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:11,867 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-02 10:41:11,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:41:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-02 10:41:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:41:11,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:11,870 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:11,870 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 4 times [2018-02-02 10:41:11,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:11,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:41:12,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:12,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:41:12,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:12,021 INFO L182 omatonBuilderFactory]: Interpolants [1888#false, 1889#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 1890#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 1891#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 1892#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 1893#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 1894#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 1895#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (<= foo_~i~0 3) (= foo_~b.offset 0)), 1887#true] [2018-02-02 10:41:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:41:12,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:41:12,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:41:12,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:41:12,022 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 9 states. [2018-02-02 10:41:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:12,119 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-02-02 10:41:12,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:41:12,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-02-02 10:41:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:12,120 INFO L225 Difference]: With dead ends: 141 [2018-02-02 10:41:12,120 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:41:12,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:41:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:41:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2018-02-02 10:41:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:41:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2018-02-02 10:41:12,124 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 59 [2018-02-02 10:41:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:12,124 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-02-02 10:41:12,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:41:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2018-02-02 10:41:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:41:12,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:12,125 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:12,125 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:12,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2038233855, now seen corresponding path program 5 times [2018-02-02 10:41:12,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:12,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 67 proven. 52 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:41:12,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:12,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:41:12,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:12,312 INFO L182 omatonBuilderFactory]: Interpolants [2150#true, 2151#false, 2152#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 2153#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 2154#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 2155#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 2156#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 2157#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 2158#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 2159#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0))] [2018-02-02 10:41:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 67 proven. 52 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:41:12,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:41:12,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:41:12,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:41:12,313 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 10 states. [2018-02-02 10:41:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:12,432 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2018-02-02 10:41:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:41:12,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 10:41:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:12,433 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:41:12,433 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:41:12,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:41:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:41:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 111. [2018-02-02 10:41:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 10:41:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-02-02 10:41:12,440 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 65 [2018-02-02 10:41:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:12,440 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-02-02 10:41:12,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:41:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-02-02 10:41:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:41:12,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:12,441 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:12,441 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1242576168, now seen corresponding path program 3 times [2018-02-02 10:41:12,442 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:12,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:41:12,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:12,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:41:12,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:41:12,486 INFO L182 omatonBuilderFactory]: Interpolants [2440#true, 2441#false, 2442#(= main_~i~1 0), 2443#(<= main_~i~1 1), 2444#(<= main_~i~1 2), 2445#(<= main_~i~1 3)] [2018-02-02 10:41:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:41:12,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:41:12,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:41:12,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:41:12,487 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 6 states. [2018-02-02 10:41:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:12,527 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-02-02 10:41:12,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:41:12,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-02-02 10:41:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:12,528 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:41:12,528 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:41:12,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:41:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:41:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2018-02-02 10:41:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:41:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-02-02 10:41:12,530 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 67 [2018-02-02 10:41:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:12,531 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-02-02 10:41:12,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:41:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-02-02 10:41:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:41:12,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:12,532 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:12,532 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1477243001, now seen corresponding path program 6 times [2018-02-02 10:41:12,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:12,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 81 proven. 14 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 10:41:12,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:12,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:41:12,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:12,687 INFO L182 omatonBuilderFactory]: Interpolants [2720#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (= main_~i~1 0)), 2721#(and (= 32 (select |#length| |main_~#mask~0.base|)) (<= main_~i~1 1) (= 0 |main_~#mask~0.offset|)), 2722#(and (= 0 |foo_#in~b.offset|) (<= |foo_#in~size| 1) (= 32 (select |#length| |foo_#in~b.base|))), 2723#(and (<= foo_~size 1) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 2724#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 2725#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (<= foo_~i~0 2) (= foo_~b.offset 0)), 2717#true, 2718#false, 2719#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))] [2018-02-02 10:41:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 81 proven. 14 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 10:41:12,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:41:12,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:41:12,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:41:12,688 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 9 states. [2018-02-02 10:41:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:12,828 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2018-02-02 10:41:12,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:41:12,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-02-02 10:41:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:12,829 INFO L225 Difference]: With dead ends: 169 [2018-02-02 10:41:12,829 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 10:41:12,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:41:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 10:41:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 132. [2018-02-02 10:41:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 10:41:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2018-02-02 10:41:12,833 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 71 [2018-02-02 10:41:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:12,833 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2018-02-02 10:41:12,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:41:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2018-02-02 10:41:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 10:41:12,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:12,835 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:12,835 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:12,835 INFO L82 PathProgramCache]: Analyzing trace with hash -936338327, now seen corresponding path program 4 times [2018-02-02 10:41:12,835 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:12,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 54 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-02 10:41:12,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:12,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:41:12,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:41:12,903 INFO L182 omatonBuilderFactory]: Interpolants [3040#(<= (+ |foo_#in~size| 2) 0), 3033#true, 3034#false, 3035#(<= 0 main_~i~1), 3036#(<= 1 main_~i~1), 3037#(<= 2 main_~i~1), 3038#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3039#(and (= foo_~i~0 0) (<= (+ |foo_#in~size| 2) foo_~i~0))] [2018-02-02 10:41:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 54 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-02 10:41:12,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:41:12,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:41:12,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:41:12,903 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 8 states. [2018-02-02 10:41:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:13,008 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-02-02 10:41:13,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:41:13,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-02-02 10:41:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:13,009 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:41:13,009 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:41:13,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:41:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:41:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2018-02-02 10:41:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:41:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2018-02-02 10:41:13,013 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 79 [2018-02-02 10:41:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:13,013 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2018-02-02 10:41:13,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:41:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2018-02-02 10:41:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:41:13,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:13,014 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:13,014 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash 339275984, now seen corresponding path program 7 times [2018-02-02 10:41:13,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:13,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-02-02 10:41:13,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:13,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:41:13,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:13,131 INFO L182 omatonBuilderFactory]: Interpolants [3331#true, 3332#false, 3333#(<= 0 main_~i~1), 3334#(<= 1 main_~i~1), 3335#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3336#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 3337#(<= (+ |foo_#in~size| 1) 0)] [2018-02-02 10:41:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-02-02 10:41:13,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:41:13,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:41:13,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:41:13,132 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand 7 states. [2018-02-02 10:41:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:13,215 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-02-02 10:41:13,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:41:13,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-02-02 10:41:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:13,216 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:41:13,216 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:41:13,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:41:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:41:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2018-02-02 10:41:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:41:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2018-02-02 10:41:13,220 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 89 [2018-02-02 10:41:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:13,220 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2018-02-02 10:41:13,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:41:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2018-02-02 10:41:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 10:41:13,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:13,221 INFO L351 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:13,222 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:13,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1067717288, now seen corresponding path program 8 times [2018-02-02 10:41:13,222 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:13,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 213 proven. 10 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-02-02 10:41:13,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:13,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:41:13,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:13,329 INFO L182 omatonBuilderFactory]: Interpolants [3639#true, 3640#false, 3641#(<= 0 main_~i~1), 3642#(<= 1 main_~i~1), 3643#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3644#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 3645#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 3646#(<= |foo_#in~size| 0)] [2018-02-02 10:41:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 213 proven. 10 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-02-02 10:41:13,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:41:13,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:41:13,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:41:13,330 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand 8 states. [2018-02-02 10:41:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:13,443 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-02-02 10:41:13,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:41:13,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-02-02 10:41:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:13,444 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:41:13,444 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:41:13,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:41:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:41:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2018-02-02 10:41:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:41:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-02-02 10:41:13,448 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 95 [2018-02-02 10:41:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:13,449 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-02-02 10:41:13,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:41:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-02-02 10:41:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 10:41:13,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:13,450 INFO L351 BasicCegarLoop]: trace histogram [13, 11, 11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:13,450 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:13,450 INFO L82 PathProgramCache]: Analyzing trace with hash 128017376, now seen corresponding path program 9 times [2018-02-02 10:41:13,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:13,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 262 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-02 10:41:13,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:13,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:41:13,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:13,558 INFO L182 omatonBuilderFactory]: Interpolants [3969#true, 3970#false, 3971#(= main_~i~1 0), 3972#(<= main_~i~1 1), 3973#(<= main_~i~1 2), 3974#(<= |foo_#in~size| 2), 3975#(<= foo_~size 2), 3976#(<= foo_~size (+ foo_~i~0 2)), 3977#(<= foo_~size (+ foo_~i~0 1)), 3978#(<= foo_~size foo_~i~0), 3979#(<= (+ foo_~size 1) foo_~i~0), 3980#(<= (+ foo_~size 2) foo_~i~0), 3981#(<= (+ foo_~size 3) foo_~i~0)] [2018-02-02 10:41:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 262 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-02 10:41:13,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:41:13,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:41:13,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:41:13,559 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 13 states. [2018-02-02 10:41:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:13,752 INFO L93 Difference]: Finished difference Result 209 states and 218 transitions. [2018-02-02 10:41:13,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:41:13,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-02-02 10:41:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:13,753 INFO L225 Difference]: With dead ends: 209 [2018-02-02 10:41:13,753 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 10:41:13,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:41:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 10:41:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2018-02-02 10:41:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 10:41:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2018-02-02 10:41:13,756 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 101 [2018-02-02 10:41:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:13,756 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2018-02-02 10:41:13,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:41:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2018-02-02 10:41:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-02 10:41:13,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:13,758 INFO L351 BasicCegarLoop]: trace histogram [17, 14, 14, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:13,758 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash -378382727, now seen corresponding path program 10 times [2018-02-02 10:41:13,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:13,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 311 proven. 80 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-02-02 10:41:13,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:13,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:41:13,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:13,945 INFO L182 omatonBuilderFactory]: Interpolants [4400#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 4401#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 4402#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 4403#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 4404#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 4405#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 5)), 4395#true, 4396#false, 4397#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 4398#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 4399#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0))] [2018-02-02 10:41:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 311 proven. 80 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-02-02 10:41:13,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:41:13,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:41:13,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:41:13,946 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 11 states. [2018-02-02 10:41:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:14,083 INFO L93 Difference]: Finished difference Result 223 states and 236 transitions. [2018-02-02 10:41:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:41:14,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2018-02-02 10:41:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:14,084 INFO L225 Difference]: With dead ends: 223 [2018-02-02 10:41:14,084 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 10:41:14,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:41:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 10:41:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 200. [2018-02-02 10:41:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 10:41:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 213 transitions. [2018-02-02 10:41:14,087 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 213 transitions. Word has length 131 [2018-02-02 10:41:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:14,088 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 213 transitions. [2018-02-02 10:41:14,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:41:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 213 transitions. [2018-02-02 10:41:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-02 10:41:14,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:14,088 INFO L351 BasicCegarLoop]: trace histogram [15, 11, 11, 11, 11, 11, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:14,088 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1127108721, now seen corresponding path program 5 times [2018-02-02 10:41:14,089 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:14,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 193 proven. 32 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-02-02 10:41:14,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:14,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:41:14,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:14,259 INFO L182 omatonBuilderFactory]: Interpolants [4848#(or (not (= |foo_#in~b.offset| 0)) (not (= (select |#length| |foo_#in~b.base|) 32)) (<= |foo_#in~size| 30)), 4849#(<= main_~i~1 30), 4850#(<= main_~i~1 31), 4841#true, 4842#false, 4843#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 4844#(and (or (= |foo_#in~b.offset| foo_~b.offset) (= foo_~b.offset 0)) (or (and (<= |foo_#in~size| foo_~size) (= foo_~b.base |foo_#in~b.base|)) (not (= foo_~b.offset 0)))), 4845#(and (or (= |foo_#in~b.offset| foo_~b.offset) (= foo_~b.offset 0)) (or (not (= foo_~b.offset 0)) (and (or (= (select |#length| foo_~b.base) 32) (= foo_~b.base |foo_#in~b.base|)) (or (<= |foo_#in~size| foo_~size) (not (= (select |#length| foo_~b.base) 32)))))), 4846#(or (<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 31)) (not (= |foo_#in~b.offset| 0)) (not (= (select |#length| |foo_#in~b.base|) 32))), 4847#(or (<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 32)) (not (= |foo_#in~b.offset| 0)) (not (= (select |#length| |foo_#in~b.base|) 32)))] [2018-02-02 10:41:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 193 proven. 32 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-02-02 10:41:14,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:41:14,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:41:14,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:41:14,260 INFO L87 Difference]: Start difference. First operand 200 states and 213 transitions. Second operand 10 states. [2018-02-02 10:41:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:14,474 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-02-02 10:41:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:41:14,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2018-02-02 10:41:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:14,475 INFO L225 Difference]: With dead ends: 169 [2018-02-02 10:41:14,475 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 10:41:14,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:41:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 10:41:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-02-02 10:41:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:41:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 173 transitions. [2018-02-02 10:41:14,478 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 173 transitions. Word has length 133 [2018-02-02 10:41:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:14,479 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 173 transitions. [2018-02-02 10:41:14,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:41:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 173 transitions. [2018-02-02 10:41:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-02 10:41:14,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:14,479 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 15, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:14,479 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:14,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1729075327, now seen corresponding path program 11 times [2018-02-02 10:41:14,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:14,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 517 proven. 24 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:41:14,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:14,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:41:14,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:14,580 INFO L182 omatonBuilderFactory]: Interpolants [5200#(<= 0 main_~i~1), 5201#(<= 1 main_~i~1), 5202#(<= 2 main_~i~1), 5203#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 5204#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 5205#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 5206#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 5207#(<= |foo_#in~size| 1), 5198#true, 5199#false] [2018-02-02 10:41:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 517 proven. 24 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:41:14,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:41:14,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:41:14,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:41:14,581 INFO L87 Difference]: Start difference. First operand 165 states and 173 transitions. Second operand 10 states. [2018-02-02 10:41:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:14,688 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2018-02-02 10:41:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:41:14,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2018-02-02 10:41:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:14,691 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:41:14,691 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:41:14,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:41:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:41:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2018-02-02 10:41:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:41:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 171 transitions. [2018-02-02 10:41:14,693 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 171 transitions. Word has length 137 [2018-02-02 10:41:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:14,693 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 171 transitions. [2018-02-02 10:41:14,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:41:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 171 transitions. [2018-02-02 10:41:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-02 10:41:14,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:14,694 INFO L351 BasicCegarLoop]: trace histogram [19, 16, 16, 15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:14,694 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash -970437815, now seen corresponding path program 12 times [2018-02-02 10:41:14,695 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:14,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 405 proven. 114 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-02 10:41:14,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:14,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:41:14,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:14,945 INFO L182 omatonBuilderFactory]: Interpolants [5568#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 5557#true, 5558#false, 5559#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 5560#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 5561#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 5562#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 5563#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 5564#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 5565#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 5566#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 5567#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0))] [2018-02-02 10:41:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 405 proven. 114 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-02 10:41:14,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:41:14,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:41:14,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:41:14,946 INFO L87 Difference]: Start difference. First operand 165 states and 171 transitions. Second operand 12 states. [2018-02-02 10:41:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:15,100 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2018-02-02 10:41:15,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:41:15,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2018-02-02 10:41:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:15,101 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:41:15,101 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:41:15,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:41:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:41:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2018-02-02 10:41:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:41:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 178 transitions. [2018-02-02 10:41:15,105 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 178 transitions. Word has length 143 [2018-02-02 10:41:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:15,106 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 178 transitions. [2018-02-02 10:41:15,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:41:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 178 transitions. [2018-02-02 10:41:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-02 10:41:15,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:15,107 INFO L351 BasicCegarLoop]: trace histogram [20, 17, 17, 16, 16, 16, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:15,107 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash -982548399, now seen corresponding path program 13 times [2018-02-02 10:41:15,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:15,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 465 proven. 154 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-02 10:41:15,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:15,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:41:15,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:15,380 INFO L182 omatonBuilderFactory]: Interpolants [5952#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 5953#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 5954#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 5955#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 5956#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 5957#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 5945#true, 5946#false, 5947#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 5948#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 5949#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 5950#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 5951#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0))] [2018-02-02 10:41:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 465 proven. 154 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-02 10:41:15,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:41:15,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:41:15,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:41:15,381 INFO L87 Difference]: Start difference. First operand 171 states and 178 transitions. Second operand 13 states. [2018-02-02 10:41:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:15,607 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2018-02-02 10:41:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:41:15,607 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 149 [2018-02-02 10:41:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:15,608 INFO L225 Difference]: With dead ends: 200 [2018-02-02 10:41:15,608 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 10:41:15,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:41:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 10:41:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 177. [2018-02-02 10:41:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 10:41:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 185 transitions. [2018-02-02 10:41:15,611 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 185 transitions. Word has length 149 [2018-02-02 10:41:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:15,612 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 185 transitions. [2018-02-02 10:41:15,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:41:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 185 transitions. [2018-02-02 10:41:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-02 10:41:15,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:15,612 INFO L351 BasicCegarLoop]: trace histogram [21, 18, 18, 17, 17, 17, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:15,612 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1156370265, now seen corresponding path program 14 times [2018-02-02 10:41:15,613 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:15,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 525 proven. 200 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-02 10:41:15,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:15,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:41:15,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:15,979 INFO L182 omatonBuilderFactory]: Interpolants [6351#true, 6352#false, 6353#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 6354#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 6355#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 6356#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 6357#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 6358#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 6359#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 6360#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 6361#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 6362#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 6363#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 6364#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 8))] [2018-02-02 10:41:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 525 proven. 200 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-02 10:41:15,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:41:15,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:41:15,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:41:15,979 INFO L87 Difference]: Start difference. First operand 177 states and 185 transitions. Second operand 14 states. [2018-02-02 10:41:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:16,162 INFO L93 Difference]: Finished difference Result 209 states and 218 transitions. [2018-02-02 10:41:16,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:41:16,162 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-02-02 10:41:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:16,163 INFO L225 Difference]: With dead ends: 209 [2018-02-02 10:41:16,163 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 10:41:16,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:41:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 10:41:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 183. [2018-02-02 10:41:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:41:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 192 transitions. [2018-02-02 10:41:16,167 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 192 transitions. Word has length 155 [2018-02-02 10:41:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:16,167 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 192 transitions. [2018-02-02 10:41:16,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:41:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 192 transitions. [2018-02-02 10:41:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-02 10:41:16,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:16,168 INFO L351 BasicCegarLoop]: trace histogram [22, 19, 19, 18, 18, 18, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:16,168 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash 639940705, now seen corresponding path program 15 times [2018-02-02 10:41:16,169 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:16,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 585 proven. 252 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-02 10:41:16,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:16,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:41:16,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:16,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 10:41:16,524 INFO L182 omatonBuilderFactory]: Interpolants [6784#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 6785#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 6786#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 6787#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 6788#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 6789#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 6775#true, 6776#false, 6777#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 6778#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 6779#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 6780#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 6781#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 6782#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 6783#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0))] [2018-02-02 10:41:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 585 proven. 252 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-02 10:41:16,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:41:16,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:41:16,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:41:16,525 INFO L87 Difference]: Start difference. First operand 183 states and 192 transitions. Second operand 15 states. [2018-02-02 10:41:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:16,789 INFO L93 Difference]: Finished difference Result 218 states and 228 transitions. [2018-02-02 10:41:16,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:41:16,789 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 161 [2018-02-02 10:41:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:16,790 INFO L225 Difference]: With dead ends: 218 [2018-02-02 10:41:16,790 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:41:16,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:41:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:41:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 189. [2018-02-02 10:41:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 10:41:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2018-02-02 10:41:16,795 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 161 [2018-02-02 10:41:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:16,795 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2018-02-02 10:41:16,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:41:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2018-02-02 10:41:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-02 10:41:16,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:16,797 INFO L351 BasicCegarLoop]: trace histogram [23, 20, 20, 19, 19, 19, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:16,797 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash 893107049, now seen corresponding path program 16 times [2018-02-02 10:41:16,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:16,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 645 proven. 50 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-02 10:41:17,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:17,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:41:17,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:17,037 INFO L182 omatonBuilderFactory]: Interpolants [7217#true, 7218#false, 7219#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 7220#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (= main_~i~1 0)), 7221#(and (= 32 (select |#length| |main_~#mask~0.base|)) (<= main_~i~1 1) (= 0 |main_~#mask~0.offset|)), 7222#(and (<= main_~i~1 2) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 7223#(and (<= main_~i~1 3) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 7224#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|)) (<= |foo_#in~size| 3)), 7225#(and (<= foo_~size 3) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 7226#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 7227#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0))] [2018-02-02 10:41:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 645 proven. 50 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-02 10:41:17,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:41:17,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:41:17,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:41:17,038 INFO L87 Difference]: Start difference. First operand 189 states and 199 transitions. Second operand 11 states. [2018-02-02 10:41:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:17,113 INFO L93 Difference]: Finished difference Result 265 states and 282 transitions. [2018-02-02 10:41:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:41:17,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 167 [2018-02-02 10:41:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:17,114 INFO L225 Difference]: With dead ends: 265 [2018-02-02 10:41:17,114 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 10:41:17,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:41:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 10:41:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 225. [2018-02-02 10:41:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 10:41:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 236 transitions. [2018-02-02 10:41:17,117 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 236 transitions. Word has length 167 [2018-02-02 10:41:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:17,117 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 236 transitions. [2018-02-02 10:41:17,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:41:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 236 transitions. [2018-02-02 10:41:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-02-02 10:41:17,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:17,118 INFO L351 BasicCegarLoop]: trace histogram [28, 24, 24, 23, 23, 23, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:17,118 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1030100086, now seen corresponding path program 17 times [2018-02-02 10:41:17,118 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:17,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 1249 proven. 44 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-02-02 10:41:17,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:17,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:41:17,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:17,255 INFO L182 omatonBuilderFactory]: Interpolants [7728#(<= 2 main_~i~1), 7729#(<= 3 main_~i~1), 7730#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 7731#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 7732#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 7733#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 7734#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 7735#(<= |foo_#in~size| 2), 7724#true, 7725#false, 7726#(<= 0 main_~i~1), 7727#(<= 1 main_~i~1)] [2018-02-02 10:41:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 1249 proven. 44 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-02-02 10:41:17,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:41:17,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:41:17,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:41:17,257 INFO L87 Difference]: Start difference. First operand 225 states and 236 transitions. Second operand 12 states. [2018-02-02 10:41:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:17,376 INFO L93 Difference]: Finished difference Result 250 states and 260 transitions. [2018-02-02 10:41:17,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:41:17,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 203 [2018-02-02 10:41:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:17,378 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:41:17,378 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 10:41:17,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:41:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 10:41:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-02-02 10:41:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:41:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 241 transitions. [2018-02-02 10:41:17,381 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 241 transitions. Word has length 203 [2018-02-02 10:41:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:17,381 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 241 transitions. [2018-02-02 10:41:17,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:41:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 241 transitions. [2018-02-02 10:41:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-02 10:41:17,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:17,382 INFO L351 BasicCegarLoop]: trace histogram [29, 25, 25, 24, 24, 24, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:17,382 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash -213343086, now seen corresponding path program 18 times [2018-02-02 10:41:17,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:17,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2044 backedges. 1269 proven. 81 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-02-02 10:41:17,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:17,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:41:17,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:17,564 INFO L182 omatonBuilderFactory]: Interpolants [8224#false, 8225#(= main_~i~1 0), 8226#(<= main_~i~1 1), 8227#(<= main_~i~1 2), 8228#(<= main_~i~1 3), 8229#(<= main_~i~1 4), 8230#(<= |foo_#in~size| 4), 8231#(<= foo_~size 4), 8232#(<= foo_~size (+ foo_~i~0 4)), 8233#(<= foo_~size (+ foo_~i~0 3)), 8234#(<= foo_~size (+ foo_~i~0 2)), 8235#(<= foo_~size (+ foo_~i~0 1)), 8236#(<= foo_~size foo_~i~0), 8237#(<= (+ foo_~size 1) foo_~i~0), 8238#(<= (+ foo_~size 2) foo_~i~0), 8239#(<= (+ foo_~size 3) foo_~i~0), 8240#(<= (+ foo_~size 4) foo_~i~0), 8241#(<= (+ foo_~size 5) foo_~i~0), 8242#(<= (+ foo_~size 6) foo_~i~0), 8223#true] [2018-02-02 10:41:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2044 backedges. 1269 proven. 81 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-02-02 10:41:17,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:41:17,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:41:17,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:41:17,565 INFO L87 Difference]: Start difference. First operand 231 states and 241 transitions. Second operand 20 states. [2018-02-02 10:41:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:17,772 INFO L93 Difference]: Finished difference Result 287 states and 298 transitions. [2018-02-02 10:41:17,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:41:17,772 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 209 [2018-02-02 10:41:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:17,773 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:41:17,773 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 10:41:17,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:41:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 10:41:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-02-02 10:41:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-02 10:41:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 296 transitions. [2018-02-02 10:41:17,776 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 296 transitions. Word has length 209 [2018-02-02 10:41:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:17,776 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 296 transitions. [2018-02-02 10:41:17,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:41:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 296 transitions. [2018-02-02 10:41:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-02-02 10:41:17,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:17,777 INFO L351 BasicCegarLoop]: trace histogram [35, 30, 30, 29, 29, 29, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:17,777 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:17,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1482880389, now seen corresponding path program 19 times [2018-02-02 10:41:17,778 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:17,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2997 backedges. 1331 proven. 100 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2018-02-02 10:41:18,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:18,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:41:18,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:18,084 INFO L182 omatonBuilderFactory]: Interpolants [8832#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (= main_~i~1 0)), 8833#(and (= 32 (select |#length| |main_~#mask~0.base|)) (<= main_~i~1 1) (= 0 |main_~#mask~0.offset|)), 8834#(and (<= main_~i~1 2) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 8835#(and (<= main_~i~1 3) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 8836#(and (<= main_~i~1 4) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 8837#(and (= 32 (select |#length| |main_~#mask~0.base|)) (<= main_~i~1 5) (= 0 |main_~#mask~0.offset|)), 8838#(and (<= |foo_#in~size| 5) (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 8839#(and (<= foo_~size 5) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 8840#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 8841#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 8829#true, 8830#false, 8831#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))] [2018-02-02 10:41:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2997 backedges. 1331 proven. 100 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2018-02-02 10:41:18,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:41:18,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:41:18,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:41:18,086 INFO L87 Difference]: Start difference. First operand 285 states and 296 transitions. Second operand 13 states. [2018-02-02 10:41:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:18,276 INFO L93 Difference]: Finished difference Result 361 states and 378 transitions. [2018-02-02 10:41:18,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:41:18,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 251 [2018-02-02 10:41:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:18,277 INFO L225 Difference]: With dead ends: 361 [2018-02-02 10:41:18,278 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 10:41:18,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:41:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 10:41:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 327. [2018-02-02 10:41:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 10:41:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 339 transitions. [2018-02-02 10:41:18,281 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 339 transitions. Word has length 251 [2018-02-02 10:41:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:18,282 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 339 transitions. [2018-02-02 10:41:18,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:41:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 339 transitions. [2018-02-02 10:41:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-02-02 10:41:18,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:18,283 INFO L351 BasicCegarLoop]: trace histogram [41, 35, 35, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:18,283 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:18,283 INFO L82 PathProgramCache]: Analyzing trace with hash 741408036, now seen corresponding path program 20 times [2018-02-02 10:41:18,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:18,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 2290 proven. 245 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2018-02-02 10:41:18,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:18,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:41:18,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:18,570 INFO L182 omatonBuilderFactory]: Interpolants [9536#true, 9537#false, 9538#(<= 0 main_~i~1), 9539#(<= 1 main_~i~1), 9540#(<= 2 main_~i~1), 9541#(<= 3 main_~i~1), 9542#(<= 4 main_~i~1), 9543#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 9544#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 9545#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 9546#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 9547#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 9548#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 9549#(<= |foo_#in~size| 3)] [2018-02-02 10:41:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 2290 proven. 245 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2018-02-02 10:41:18,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:41:18,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:41:18,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:41:18,572 INFO L87 Difference]: Start difference. First operand 327 states and 339 transitions. Second operand 14 states. [2018-02-02 10:41:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:18,734 INFO L93 Difference]: Finished difference Result 358 states and 368 transitions. [2018-02-02 10:41:18,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:41:18,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 293 [2018-02-02 10:41:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:18,736 INFO L225 Difference]: With dead ends: 358 [2018-02-02 10:41:18,736 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 10:41:18,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:41:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 10:41:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 333. [2018-02-02 10:41:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-02 10:41:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 343 transitions. [2018-02-02 10:41:18,740 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 343 transitions. Word has length 293 [2018-02-02 10:41:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:18,740 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 343 transitions. [2018-02-02 10:41:18,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:41:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 343 transitions. [2018-02-02 10:41:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-02-02 10:41:18,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:18,742 INFO L351 BasicCegarLoop]: trace histogram [43, 37, 37, 36, 36, 36, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:18,742 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2132808972, now seen corresponding path program 21 times [2018-02-02 10:41:18,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:18,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2761 proven. 102 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2018-02-02 10:41:19,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:19,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:41:19,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:19,021 INFO L182 omatonBuilderFactory]: Interpolants [10249#true, 10250#false, 10251#(<= 0 main_~i~1), 10252#(<= 1 main_~i~1), 10253#(<= 2 main_~i~1), 10254#(<= 3 main_~i~1), 10255#(<= 4 main_~i~1), 10256#(<= 5 main_~i~1), 10257#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 10258#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 10259#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 10260#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 10261#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 10262#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 10263#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 10264#(<= |foo_#in~size| 4)] [2018-02-02 10:41:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2761 proven. 102 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2018-02-02 10:41:19,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:41:19,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:41:19,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:41:19,022 INFO L87 Difference]: Start difference. First operand 333 states and 343 transitions. Second operand 16 states. [2018-02-02 10:41:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:19,293 INFO L93 Difference]: Finished difference Result 361 states and 370 transitions. [2018-02-02 10:41:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:41:19,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 305 [2018-02-02 10:41:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:19,294 INFO L225 Difference]: With dead ends: 361 [2018-02-02 10:41:19,295 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 10:41:19,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:41:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 10:41:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 339. [2018-02-02 10:41:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 10:41:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 348 transitions. [2018-02-02 10:41:19,299 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 348 transitions. Word has length 305 [2018-02-02 10:41:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:19,299 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 348 transitions. [2018-02-02 10:41:19,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:41:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 348 transitions. [2018-02-02 10:41:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-02-02 10:41:19,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:19,301 INFO L351 BasicCegarLoop]: trace histogram [44, 38, 38, 37, 37, 37, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:19,301 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1713892476, now seen corresponding path program 22 times [2018-02-02 10:41:19,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:19,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4810 backedges. 2147 proven. 143 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-02 10:41:19,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:19,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:41:19,696 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41: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 10:41:19,697 INFO L182 omatonBuilderFactory]: Interpolants [10976#false, 10977#(= main_~i~1 0), 10978#(<= main_~i~1 1), 10979#(<= main_~i~1 2), 10980#(<= main_~i~1 3), 10981#(<= main_~i~1 4), 10982#(<= main_~i~1 5), 10983#(<= main_~i~1 6), 10984#(<= |foo_#in~size| 6), 10985#(<= foo_~size 6), 10986#(<= foo_~size (+ foo_~i~0 6)), 10987#(<= foo_~size (+ foo_~i~0 5)), 10988#(<= foo_~size (+ foo_~i~0 4)), 10989#(<= foo_~size (+ foo_~i~0 3)), 10990#(<= foo_~size (+ foo_~i~0 2)), 10991#(<= foo_~size (+ foo_~i~0 1)), 10992#(<= foo_~size foo_~i~0), 10993#(<= (+ foo_~size 1) foo_~i~0), 10994#(<= (+ foo_~size 2) foo_~i~0), 10995#(<= (+ foo_~size 3) foo_~i~0), 10996#(<= (+ foo_~size 4) foo_~i~0), 10975#true] [2018-02-02 10:41:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4810 backedges. 2147 proven. 143 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-02 10:41:19,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:41:19,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:41:19,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:41:19,698 INFO L87 Difference]: Start difference. First operand 339 states and 348 transitions. Second operand 22 states. [2018-02-02 10:41:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:19,979 INFO L93 Difference]: Finished difference Result 407 states and 417 transitions. [2018-02-02 10:41:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:41:19,979 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 311 [2018-02-02 10:41:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:19,980 INFO L225 Difference]: With dead ends: 407 [2018-02-02 10:41:19,980 INFO L226 Difference]: Without dead ends: 407 [2018-02-02 10:41:19,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:41:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-02-02 10:41:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2018-02-02 10:41:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-02 10:41:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 415 transitions. [2018-02-02 10:41:19,986 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 415 transitions. Word has length 311 [2018-02-02 10:41:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:19,987 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 415 transitions. [2018-02-02 10:41:19,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:41:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 415 transitions. [2018-02-02 10:41:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-02-02 10:41:19,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:19,988 INFO L351 BasicCegarLoop]: trace histogram [52, 45, 45, 44, 44, 44, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:19,988 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:19,988 INFO L82 PathProgramCache]: Analyzing trace with hash 779331957, now seen corresponding path program 23 times [2018-02-02 10:41:19,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:20,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6769 backedges. 3793 proven. 140 refuted. 0 times theorem prover too weak. 2836 trivial. 0 not checked. [2018-02-02 10:41:20,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:20,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:41:20,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:20,310 INFO L182 omatonBuilderFactory]: Interpolants [11840#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11841#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 11842#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 11843#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 11844#(<= |foo_#in~size| 5), 11827#true, 11828#false, 11829#(<= 0 main_~i~1), 11830#(<= 1 main_~i~1), 11831#(<= 2 main_~i~1), 11832#(<= 3 main_~i~1), 11833#(<= 4 main_~i~1), 11834#(<= 5 main_~i~1), 11835#(<= 6 main_~i~1), 11836#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11837#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11838#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11839#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3))] [2018-02-02 10:41:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6769 backedges. 3793 proven. 140 refuted. 0 times theorem prover too weak. 2836 trivial. 0 not checked. [2018-02-02 10:41:20,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:41:20,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:41:20,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:41:20,311 INFO L87 Difference]: Start difference. First operand 405 states and 415 transitions. Second operand 18 states. [2018-02-02 10:41:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:20,507 INFO L93 Difference]: Finished difference Result 426 states and 434 transitions. [2018-02-02 10:41:20,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:41:20,507 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 365 [2018-02-02 10:41:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:20,508 INFO L225 Difference]: With dead ends: 426 [2018-02-02 10:41:20,508 INFO L226 Difference]: Without dead ends: 420 [2018-02-02 10:41:20,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:41:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-02-02 10:41:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 405. [2018-02-02 10:41:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-02 10:41:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 413 transitions. [2018-02-02 10:41:20,513 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 413 transitions. Word has length 365 [2018-02-02 10:41:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:20,513 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 413 transitions. [2018-02-02 10:41:20,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:41:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 413 transitions. [2018-02-02 10:41:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-02-02 10:41:20,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:20,514 INFO L351 BasicCegarLoop]: trace histogram [53, 46, 46, 45, 45, 45, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:20,514 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash -512162243, now seen corresponding path program 24 times [2018-02-02 10:41:20,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:20,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7051 backedges. 2682 proven. 183 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-02-02 10:41:20,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:20,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:41:20,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:20,899 INFO L182 omatonBuilderFactory]: Interpolants [12704#(<= foo_~size (+ foo_~i~0 3)), 12705#(<= foo_~size (+ foo_~i~0 2)), 12706#(<= foo_~size (+ foo_~i~0 1)), 12707#(<= foo_~size foo_~i~0), 12708#(<= (+ foo_~size 1) foo_~i~0), 12709#(<= (+ foo_~size 2) foo_~i~0), 12710#(<= (+ foo_~size 3) foo_~i~0), 12688#true, 12689#false, 12690#(= main_~i~1 0), 12691#(<= main_~i~1 1), 12692#(<= main_~i~1 2), 12693#(<= main_~i~1 3), 12694#(<= main_~i~1 4), 12695#(<= main_~i~1 5), 12696#(<= main_~i~1 6), 12697#(<= main_~i~1 7), 12698#(<= |foo_#in~size| 7), 12699#(<= foo_~size 7), 12700#(<= foo_~size (+ foo_~i~0 7)), 12701#(<= foo_~size (+ foo_~i~0 6)), 12702#(<= foo_~size (+ foo_~i~0 5)), 12703#(<= foo_~size (+ foo_~i~0 4))] [2018-02-02 10:41:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7051 backedges. 2682 proven. 183 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-02-02 10:41:20,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:41:20,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:41:20,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:41:20,900 INFO L87 Difference]: Start difference. First operand 405 states and 413 transitions. Second operand 23 states. [2018-02-02 10:41:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:21,181 INFO L93 Difference]: Finished difference Result 473 states and 482 transitions. [2018-02-02 10:41:21,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:41:21,181 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 371 [2018-02-02 10:41:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:21,182 INFO L225 Difference]: With dead ends: 473 [2018-02-02 10:41:21,182 INFO L226 Difference]: Without dead ends: 473 [2018-02-02 10:41:21,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:41:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-02 10:41:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2018-02-02 10:41:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-02 10:41:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 480 transitions. [2018-02-02 10:41:21,186 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 480 transitions. Word has length 371 [2018-02-02 10:41:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:21,186 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 480 transitions. [2018-02-02 10:41:21,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:41:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 480 transitions. [2018-02-02 10:41:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-02-02 10:41:21,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:21,188 INFO L351 BasicCegarLoop]: trace histogram [62, 54, 54, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:21,189 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:21,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1264279426, now seen corresponding path program 25 times [2018-02-02 10:41:21,189 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:21,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 5033 proven. 184 refuted. 0 times theorem prover too weak. 4503 trivial. 0 not checked. [2018-02-02 10:41:21,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:21,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:41:21,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:21,596 INFO L182 omatonBuilderFactory]: Interpolants [13675#true, 13676#false, 13677#(<= 0 main_~i~1), 13678#(<= 1 main_~i~1), 13679#(<= 2 main_~i~1), 13680#(<= 3 main_~i~1), 13681#(<= 4 main_~i~1), 13682#(<= 5 main_~i~1), 13683#(<= 6 main_~i~1), 13684#(<= 7 main_~i~1), 13685#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 13686#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 13687#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 13688#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 13689#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 13690#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 13691#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 13692#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 13693#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 13694#(<= |foo_#in~size| 6)] [2018-02-02 10:41:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 5033 proven. 184 refuted. 0 times theorem prover too weak. 4503 trivial. 0 not checked. [2018-02-02 10:41:21,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:41:21,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:41:21,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:41:21,597 INFO L87 Difference]: Start difference. First operand 471 states and 480 transitions. Second operand 20 states. [2018-02-02 10:41:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:21,837 INFO L93 Difference]: Finished difference Result 492 states and 499 transitions. [2018-02-02 10:41:21,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:41:21,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 431 [2018-02-02 10:41:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:21,838 INFO L225 Difference]: With dead ends: 492 [2018-02-02 10:41:21,838 INFO L226 Difference]: Without dead ends: 486 [2018-02-02 10:41:21,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:41:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-02-02 10:41:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 471. [2018-02-02 10:41:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-02 10:41:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 478 transitions. [2018-02-02 10:41:21,842 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 478 transitions. Word has length 431 [2018-02-02 10:41:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:21,842 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 478 transitions. [2018-02-02 10:41:21,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:41:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 478 transitions. [2018-02-02 10:41:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-02-02 10:41:21,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:21,844 INFO L351 BasicCegarLoop]: trace histogram [63, 55, 55, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:21,844 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:21,844 INFO L82 PathProgramCache]: Analyzing trace with hash 49074822, now seen corresponding path program 26 times [2018-02-02 10:41:21,844 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:21,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10058 backedges. 3281 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-02 10:41:22,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:22,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:41:22,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:22,355 INFO L182 omatonBuilderFactory]: Interpolants [14688#(<= foo_~size (+ foo_~i~0 5)), 14689#(<= foo_~size (+ foo_~i~0 4)), 14690#(<= foo_~size (+ foo_~i~0 3)), 14691#(<= foo_~size (+ foo_~i~0 2)), 14692#(<= foo_~size (+ foo_~i~0 1)), 14693#(<= foo_~size foo_~i~0), 14694#(<= (+ foo_~size 1) foo_~i~0), 14695#(<= (+ foo_~size 2) foo_~i~0), 14672#true, 14673#false, 14674#(= main_~i~1 0), 14675#(<= main_~i~1 1), 14676#(<= main_~i~1 2), 14677#(<= main_~i~1 3), 14678#(<= main_~i~1 4), 14679#(<= main_~i~1 5), 14680#(<= main_~i~1 6), 14681#(<= main_~i~1 7), 14682#(<= main_~i~1 8), 14683#(<= |foo_#in~size| 8), 14684#(<= foo_~size 8), 14685#(<= foo_~size (+ foo_~i~0 8)), 14686#(<= foo_~size (+ foo_~i~0 7)), 14687#(<= foo_~size (+ foo_~i~0 6))] [2018-02-02 10:41:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10058 backedges. 3281 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-02 10:41:22,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:41:22,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:41:22,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:41:22,357 INFO L87 Difference]: Start difference. First operand 471 states and 478 transitions. Second operand 24 states. [2018-02-02 10:41:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:22,712 INFO L93 Difference]: Finished difference Result 545 states and 553 transitions. [2018-02-02 10:41:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:41:22,712 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 437 [2018-02-02 10:41:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:22,714 INFO L225 Difference]: With dead ends: 545 [2018-02-02 10:41:22,714 INFO L226 Difference]: Without dead ends: 545 [2018-02-02 10:41:22,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:41:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-02-02 10:41:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2018-02-02 10:41:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-02-02 10:41:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 551 transitions. [2018-02-02 10:41:22,718 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 551 transitions. Word has length 437 [2018-02-02 10:41:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:22,718 INFO L432 AbstractCegarLoop]: Abstraction has 543 states and 551 transitions. [2018-02-02 10:41:22,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:41:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 551 transitions. [2018-02-02 10:41:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-02-02 10:41:22,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:22,720 INFO L351 BasicCegarLoop]: trace histogram [73, 64, 64, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:22,720 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1416226959, now seen corresponding path program 27 times [2018-02-02 10:41:22,720 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:22,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 3599 proven. 310 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:23,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:23,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:41:23,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:23,376 INFO L182 omatonBuilderFactory]: Interpolants [15808#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 15809#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 15810#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 15811#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 15812#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 15813#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 15814#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 15815#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 15816#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 15817#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 15818#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 15819#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 15820#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 15821#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (<= foo_~i~0 10) (= foo_~b.offset 0)), 15806#true, 15807#false] [2018-02-02 10:41:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 3599 proven. 310 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:23,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:41:23,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:41:23,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:41:23,377 INFO L87 Difference]: Start difference. First operand 543 states and 551 transitions. Second operand 16 states. [2018-02-02 10:41:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:23,637 INFO L93 Difference]: Finished difference Result 575 states and 584 transitions. [2018-02-02 10:41:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:41:23,637 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 503 [2018-02-02 10:41:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:23,638 INFO L225 Difference]: With dead ends: 575 [2018-02-02 10:41:23,638 INFO L226 Difference]: Without dead ends: 575 [2018-02-02 10:41:23,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:41:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-02 10:41:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 549. [2018-02-02 10:41:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-02-02 10:41:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 558 transitions. [2018-02-02 10:41:23,645 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 558 transitions. Word has length 503 [2018-02-02 10:41:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:23,645 INFO L432 AbstractCegarLoop]: Abstraction has 549 states and 558 transitions. [2018-02-02 10:41:23,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:41:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 558 transitions. [2018-02-02 10:41:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-02-02 10:41:23,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:23,648 INFO L351 BasicCegarLoop]: trace histogram [74, 65, 65, 64, 64, 64, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:23,648 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:23,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2009362153, now seen corresponding path program 28 times [2018-02-02 10:41:23,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:23,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13999 backedges. 3935 proven. 374 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:24,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:24,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:41:24,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:24,364 INFO L182 omatonBuilderFactory]: Interpolants [16968#true, 16969#false, 16970#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 16971#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 16972#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 16973#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 16974#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 16975#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 16976#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 16977#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 16978#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 16979#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 16980#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 16981#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 16982#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 16983#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0)), 16984#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (<= 0 foo_~i~0) (= foo_~b.offset 0))] [2018-02-02 10:41:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13999 backedges. 3935 proven. 374 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:24,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:41:24,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:41:24,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:41:24,365 INFO L87 Difference]: Start difference. First operand 549 states and 558 transitions. Second operand 17 states. [2018-02-02 10:41:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:24,607 INFO L93 Difference]: Finished difference Result 584 states and 594 transitions. [2018-02-02 10:41:24,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:41:24,607 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 509 [2018-02-02 10:41:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:24,609 INFO L225 Difference]: With dead ends: 584 [2018-02-02 10:41:24,609 INFO L226 Difference]: Without dead ends: 584 [2018-02-02 10:41:24,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=291, Invalid=521, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:41:24,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-02 10:41:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 555. [2018-02-02 10:41:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-02-02 10:41:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 565 transitions. [2018-02-02 10:41:24,616 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 565 transitions. Word has length 509 [2018-02-02 10:41:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:24,616 INFO L432 AbstractCegarLoop]: Abstraction has 555 states and 565 transitions. [2018-02-02 10:41:24,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:41:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 565 transitions. [2018-02-02 10:41:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-02-02 10:41:24,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:24,619 INFO L351 BasicCegarLoop]: trace histogram [75, 66, 66, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:24,620 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:24,620 INFO L82 PathProgramCache]: Analyzing trace with hash 209630111, now seen corresponding path program 29 times [2018-02-02 10:41:24,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:24,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4271 proven. 444 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:25,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:25,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:41:25,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:25,302 INFO L182 omatonBuilderFactory]: Interpolants [18148#true, 18149#false, 18150#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 18151#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 18152#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 18153#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 18154#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 18155#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 18156#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 18157#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 18158#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 18159#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 18160#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 18161#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 18162#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 18163#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0)), 18164#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (= foo_~b.offset 0)), 18165#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (<= 0 foo_~i~0) (= foo_~b.offset 0))] [2018-02-02 10:41:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4271 proven. 444 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:25,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:41:25,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:41:25,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:41:25,303 INFO L87 Difference]: Start difference. First operand 555 states and 565 transitions. Second operand 18 states. [2018-02-02 10:41:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:25,608 INFO L93 Difference]: Finished difference Result 593 states and 604 transitions. [2018-02-02 10:41:25,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:41:25,608 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 515 [2018-02-02 10:41:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:25,609 INFO L225 Difference]: With dead ends: 593 [2018-02-02 10:41:25,610 INFO L226 Difference]: Without dead ends: 593 [2018-02-02 10:41:25,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=596, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:41:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-02 10:41:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 561. [2018-02-02 10:41:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-02-02 10:41:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 572 transitions. [2018-02-02 10:41:25,616 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 572 transitions. Word has length 515 [2018-02-02 10:41:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:25,617 INFO L432 AbstractCegarLoop]: Abstraction has 561 states and 572 transitions. [2018-02-02 10:41:25,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:41:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 572 transitions. [2018-02-02 10:41:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-02-02 10:41:25,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:25,620 INFO L351 BasicCegarLoop]: trace histogram [76, 67, 67, 66, 66, 66, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:25,621 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:25,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1062219737, now seen corresponding path program 30 times [2018-02-02 10:41:25,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:25,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 14817 backedges. 4607 proven. 520 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:26,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:26,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:41:26,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:26,349 INFO L182 omatonBuilderFactory]: Interpolants [19360#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 19361#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0)), 19362#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (= foo_~b.offset 0)), 19363#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 13)), 19364#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 13)), 19346#true, 19347#false, 19348#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 19349#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 19350#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 19351#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 19352#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 19353#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 19354#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 19355#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 19356#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 19357#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 19358#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 19359#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0))] [2018-02-02 10:41:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14817 backedges. 4607 proven. 520 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:26,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:41:26,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:41:26,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:41:26,350 INFO L87 Difference]: Start difference. First operand 561 states and 572 transitions. Second operand 19 states. [2018-02-02 10:41:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:26,625 INFO L93 Difference]: Finished difference Result 602 states and 614 transitions. [2018-02-02 10:41:26,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:41:26,625 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 521 [2018-02-02 10:41:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:26,626 INFO L225 Difference]: With dead ends: 602 [2018-02-02 10:41:26,627 INFO L226 Difference]: Without dead ends: 602 [2018-02-02 10:41:26,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:41:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-02-02 10:41:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 567. [2018-02-02 10:41:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-02-02 10:41:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 579 transitions. [2018-02-02 10:41:26,632 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 579 transitions. Word has length 521 [2018-02-02 10:41:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:26,632 INFO L432 AbstractCegarLoop]: Abstraction has 567 states and 579 transitions. [2018-02-02 10:41:26,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:41:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 579 transitions. [2018-02-02 10:41:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-02-02 10:41:26,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:26,635 INFO L351 BasicCegarLoop]: trace histogram [77, 68, 68, 67, 67, 67, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:26,635 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:26,636 INFO L82 PathProgramCache]: Analyzing trace with hash 350971567, now seen corresponding path program 31 times [2018-02-02 10:41:26,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:26,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15235 backedges. 4943 proven. 602 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:27,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:27,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:41:27,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:27,391 INFO L182 omatonBuilderFactory]: Interpolants [20576#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 20577#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0)), 20578#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (= foo_~b.offset 0)), 20579#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 13)), 20580#(and (<= foo_~i~0 14) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 20581#(and (<= foo_~i~0 14) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 20562#true, 20563#false, 20564#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 20565#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 20566#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 20567#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 20568#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 20569#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 20570#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 20571#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 20572#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 20573#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 20574#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 20575#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0))] [2018-02-02 10:41:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15235 backedges. 4943 proven. 602 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:27,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:41:27,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:41:27,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:41:27,392 INFO L87 Difference]: Start difference. First operand 567 states and 579 transitions. Second operand 20 states. [2018-02-02 10:41:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:27,728 INFO L93 Difference]: Finished difference Result 611 states and 624 transitions. [2018-02-02 10:41:27,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:41:27,729 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 527 [2018-02-02 10:41:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:27,730 INFO L225 Difference]: With dead ends: 611 [2018-02-02 10:41:27,730 INFO L226 Difference]: Without dead ends: 611 [2018-02-02 10:41:27,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=761, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:41:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-02-02 10:41:27,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 573. [2018-02-02 10:41:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-02-02 10:41:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 586 transitions. [2018-02-02 10:41:27,734 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 586 transitions. Word has length 527 [2018-02-02 10:41:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:27,734 INFO L432 AbstractCegarLoop]: Abstraction has 573 states and 586 transitions. [2018-02-02 10:41:27,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:41:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 586 transitions. [2018-02-02 10:41:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2018-02-02 10:41:27,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:27,736 INFO L351 BasicCegarLoop]: trace histogram [78, 69, 69, 68, 68, 68, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:27,736 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:27,736 INFO L82 PathProgramCache]: Analyzing trace with hash 300807991, now seen corresponding path program 32 times [2018-02-02 10:41:27,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:27,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15659 backedges. 5279 proven. 690 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:28,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:28,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:41:28,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:28,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 10:41:28,582 INFO L182 omatonBuilderFactory]: Interpolants [21796#true, 21797#false, 21798#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 21799#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 21800#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 21801#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 21802#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 21803#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 21804#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 21805#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 21806#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 21807#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 21808#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 21809#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 21810#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 21811#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0)), 21812#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (= foo_~b.offset 0)), 21813#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 13)), 21814#(and (<= foo_~i~0 14) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 21815#(and (<= foo_~i~0 15) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 21816#(and (<= foo_~i~0 15) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0))] [2018-02-02 10:41:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15659 backedges. 5279 proven. 690 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 10:41:28,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:41:28,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:41:28,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:41:28,583 INFO L87 Difference]: Start difference. First operand 573 states and 586 transitions. Second operand 21 states. [2018-02-02 10:41:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:28,919 INFO L93 Difference]: Finished difference Result 620 states and 634 transitions. [2018-02-02 10:41:28,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:41:28,919 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 533 [2018-02-02 10:41:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:28,920 INFO L225 Difference]: With dead ends: 620 [2018-02-02 10:41:28,920 INFO L226 Difference]: Without dead ends: 620 [2018-02-02 10:41:28,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=481, Invalid=851, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:41:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-02-02 10:41:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 579. [2018-02-02 10:41:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-02-02 10:41:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 593 transitions. [2018-02-02 10:41:28,926 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 593 transitions. Word has length 533 [2018-02-02 10:41:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:28,927 INFO L432 AbstractCegarLoop]: Abstraction has 579 states and 593 transitions. [2018-02-02 10:41:28,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:41:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 593 transitions. [2018-02-02 10:41:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-02-02 10:41:28,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:28,930 INFO L351 BasicCegarLoop]: trace histogram [79, 70, 70, 69, 69, 69, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:28,930 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1628701119, now seen corresponding path program 33 times [2018-02-02 10:41:28,931 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:28,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 16089 backedges. 7381 proven. 1200 refuted. 0 times theorem prover too weak. 7508 trivial. 0 not checked. [2018-02-02 10:41:29,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:29,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:41:29,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:29,677 INFO L182 omatonBuilderFactory]: Interpolants [23048#true, 23049#false, 23050#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 23051#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 23052#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 23053#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 23054#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 23055#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 23056#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 23057#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 23058#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 23059#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 23060#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 23061#(<= |foo_#in~size| 7), 23062#(and (<= main_~i~1 7) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 23063#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (<= main_~i~1 8)), 23064#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|)) (<= |foo_#in~size| 8)), 23065#(and (= (select |#length| foo_~b.base) 32) (<= foo_~size 8) (= foo_~b.offset 0)), 23066#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 23067#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0))] [2018-02-02 10:41:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16089 backedges. 7381 proven. 1200 refuted. 0 times theorem prover too weak. 7508 trivial. 0 not checked. [2018-02-02 10:41:29,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:41:29,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:41:29,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:41:29,677 INFO L87 Difference]: Start difference. First operand 579 states and 593 transitions. Second operand 20 states. [2018-02-02 10:41:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:30,578 INFO L93 Difference]: Finished difference Result 715 states and 737 transitions. [2018-02-02 10:41:30,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 10:41:30,578 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 539 [2018-02-02 10:41:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:30,580 INFO L225 Difference]: With dead ends: 715 [2018-02-02 10:41:30,580 INFO L226 Difference]: Without dead ends: 715 [2018-02-02 10:41:30,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=2825, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:41:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-02-02 10:41:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 660. [2018-02-02 10:41:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-02-02 10:41:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 676 transitions. [2018-02-02 10:41:30,589 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 676 transitions. Word has length 539 [2018-02-02 10:41:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:30,589 INFO L432 AbstractCegarLoop]: Abstraction has 660 states and 676 transitions. [2018-02-02 10:41:30,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:41:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 676 transitions. [2018-02-02 10:41:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-02-02 10:41:30,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:30,593 INFO L351 BasicCegarLoop]: trace histogram [80, 71, 71, 70, 70, 70, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:30,593 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:30,593 INFO L82 PathProgramCache]: Analyzing trace with hash -418963705, now seen corresponding path program 34 times [2018-02-02 10:41:30,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:30,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16525 backedges. 5715 proven. 284 refuted. 0 times theorem prover too weak. 10526 trivial. 0 not checked. [2018-02-02 10:41:31,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:31,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:41:31,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:31,313 INFO L182 omatonBuilderFactory]: Interpolants [24544#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 24545#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (<= foo_~i~0 10) (= foo_~b.offset 0)), 24529#true, 24530#false, 24531#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 24532#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (= main_~i~1 0)), 24533#(and (= 32 (select |#length| |main_~#mask~0.base|)) (<= main_~i~1 1) (= 0 |main_~#mask~0.offset|)), 24534#(and (<= main_~i~1 2) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 24535#(and (<= main_~i~1 3) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 24536#(and (<= main_~i~1 4) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 24537#(and (= 32 (select |#length| |main_~#mask~0.base|)) (<= main_~i~1 5) (= 0 |main_~#mask~0.offset|)), 24538#(and (<= main_~i~1 6) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 24539#(and (<= main_~i~1 7) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 24540#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (<= main_~i~1 8)), 24541#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (<= main_~i~1 9)), 24542#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|)) (<= |foo_#in~size| 9)), 24543#(and (<= foo_~size 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0))] [2018-02-02 10:41:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16525 backedges. 5715 proven. 284 refuted. 0 times theorem prover too weak. 10526 trivial. 0 not checked. [2018-02-02 10:41:31,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:41:31,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:41:31,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:41:31,314 INFO L87 Difference]: Start difference. First operand 660 states and 676 transitions. Second operand 17 states. [2018-02-02 10:41:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:31,429 INFO L93 Difference]: Finished difference Result 852 states and 878 transitions. [2018-02-02 10:41:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:41:31,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 545 [2018-02-02 10:41:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:31,431 INFO L225 Difference]: With dead ends: 852 [2018-02-02 10:41:31,431 INFO L226 Difference]: Without dead ends: 852 [2018-02-02 10:41:31,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:41:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-02-02 10:41:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 657. [2018-02-02 10:41:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-02-02 10:41:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 673 transitions. [2018-02-02 10:41:31,435 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 673 transitions. Word has length 545 [2018-02-02 10:41:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:31,436 INFO L432 AbstractCegarLoop]: Abstraction has 657 states and 673 transitions. [2018-02-02 10:41:31,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:41:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 673 transitions. [2018-02-02 10:41:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2018-02-02 10:41:31,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:31,440 INFO L351 BasicCegarLoop]: trace histogram [90, 80, 80, 79, 79, 79, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:31,440 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1064911760, now seen corresponding path program 35 times [2018-02-02 10:41:31,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:31,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 20992 backedges. 9602 proven. 817 refuted. 0 times theorem prover too weak. 10573 trivial. 0 not checked. [2018-02-02 10:41:32,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:32,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:41:32,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:32,030 INFO L182 omatonBuilderFactory]: Interpolants [26080#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 26081#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 26082#(<= |foo_#in~size| 7), 26061#true, 26062#false, 26063#(<= 0 main_~i~1), 26064#(<= 1 main_~i~1), 26065#(<= 2 main_~i~1), 26066#(<= 3 main_~i~1), 26067#(<= 4 main_~i~1), 26068#(<= 5 main_~i~1), 26069#(<= 6 main_~i~1), 26070#(<= 7 main_~i~1), 26071#(<= 8 main_~i~1), 26072#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 26073#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 26074#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 26075#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 26076#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 26077#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 26078#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 26079#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7))] [2018-02-02 10:41:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 20992 backedges. 9602 proven. 817 refuted. 0 times theorem prover too weak. 10573 trivial. 0 not checked. [2018-02-02 10:41:32,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:41:32,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:41:32,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:41:32,031 INFO L87 Difference]: Start difference. First operand 657 states and 673 transitions. Second operand 22 states. [2018-02-02 10:41:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:32,187 INFO L93 Difference]: Finished difference Result 679 states and 692 transitions. [2018-02-02 10:41:32,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:41:32,223 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 611 [2018-02-02 10:41:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:32,224 INFO L225 Difference]: With dead ends: 679 [2018-02-02 10:41:32,224 INFO L226 Difference]: Without dead ends: 670 [2018-02-02 10:41:32,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:41:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-02-02 10:41:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-02-02 10:41:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-02-02 10:41:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 664 transitions. [2018-02-02 10:41:32,229 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 664 transitions. Word has length 611 [2018-02-02 10:41:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:32,229 INFO L432 AbstractCegarLoop]: Abstraction has 651 states and 664 transitions. [2018-02-02 10:41:32,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:41:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 664 transitions. [2018-02-02 10:41:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-02-02 10:41:32,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:32,232 INFO L351 BasicCegarLoop]: trace histogram [91, 81, 81, 80, 80, 80, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:32,232 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1592809688, now seen corresponding path program 36 times [2018-02-02 10:41:32,232 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:32,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 21490 backedges. 10633 proven. 290 refuted. 0 times theorem prover too weak. 10567 trivial. 0 not checked. [2018-02-02 10:41:32,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:32,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:41:32,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:32,828 INFO L182 omatonBuilderFactory]: Interpolants [27429#true, 27430#false, 27431#(<= 0 main_~i~1), 27432#(<= 1 main_~i~1), 27433#(<= 2 main_~i~1), 27434#(<= 3 main_~i~1), 27435#(<= 4 main_~i~1), 27436#(<= 5 main_~i~1), 27437#(<= 6 main_~i~1), 27438#(<= 7 main_~i~1), 27439#(<= 8 main_~i~1), 27440#(<= 9 main_~i~1), 27441#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 27442#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 27443#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 27444#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 27445#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 27446#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 27447#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 27448#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 27449#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 27450#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 27451#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 27452#(<= |foo_#in~size| 8)] [2018-02-02 10:41:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21490 backedges. 10633 proven. 290 refuted. 0 times theorem prover too weak. 10567 trivial. 0 not checked. [2018-02-02 10:41:32,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:41:32,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:41:32,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:41:32,829 INFO L87 Difference]: Start difference. First operand 651 states and 664 transitions. Second operand 24 states. [2018-02-02 10:41:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:33,169 INFO L93 Difference]: Finished difference Result 682 states and 694 transitions. [2018-02-02 10:41:33,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:41:33,170 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 617 [2018-02-02 10:41:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:33,171 INFO L225 Difference]: With dead ends: 682 [2018-02-02 10:41:33,171 INFO L226 Difference]: Without dead ends: 676 [2018-02-02 10:41:33,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:41:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-02-02 10:41:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 657. [2018-02-02 10:41:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-02-02 10:41:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 669 transitions. [2018-02-02 10:41:33,175 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 669 transitions. Word has length 617 [2018-02-02 10:41:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:33,175 INFO L432 AbstractCegarLoop]: Abstraction has 657 states and 669 transitions. [2018-02-02 10:41:33,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:41:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 669 transitions. [2018-02-02 10:41:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2018-02-02 10:41:33,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:33,177 INFO L351 BasicCegarLoop]: trace histogram [92, 82, 82, 81, 81, 81, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:33,177 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:33,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2021785440, now seen corresponding path program 37 times [2018-02-02 10:41:33,178 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:33,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21994 backedges. 7587 proven. 357 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-02-02 10:41:34,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:34,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:41:34,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:34,090 INFO L182 omatonBuilderFactory]: Interpolants [28810#true, 28811#false, 28812#(= main_~i~1 0), 28813#(<= main_~i~1 1), 28814#(<= main_~i~1 2), 28815#(<= main_~i~1 3), 28816#(<= main_~i~1 4), 28817#(<= main_~i~1 5), 28818#(<= main_~i~1 6), 28819#(<= main_~i~1 7), 28820#(<= main_~i~1 8), 28821#(<= main_~i~1 9), 28822#(<= main_~i~1 10), 28823#(<= |foo_#in~size| 10), 28824#(<= foo_~size 10), 28825#(<= foo_~size (+ foo_~i~0 10)), 28826#(<= foo_~size (+ foo_~i~0 9)), 28827#(<= foo_~size (+ foo_~i~0 8)), 28828#(<= foo_~size (+ foo_~i~0 7)), 28829#(<= foo_~size (+ foo_~i~0 6)), 28830#(<= foo_~size (+ foo_~i~0 5)), 28831#(<= foo_~size (+ foo_~i~0 4)), 28832#(<= foo_~size (+ foo_~i~0 3)), 28833#(<= foo_~size (+ foo_~i~0 2)), 28834#(<= foo_~size (+ foo_~i~0 1)), 28835#(<= foo_~size foo_~i~0), 28836#(<= (+ foo_~size 1) foo_~i~0), 28837#(<= (+ foo_~size 2) foo_~i~0), 28838#(<= (+ foo_~size 3) foo_~i~0), 28839#(<= (+ foo_~size 4) foo_~i~0), 28840#(<= (+ foo_~size 5) foo_~i~0), 28841#(<= (+ foo_~size 6) foo_~i~0)] [2018-02-02 10:41:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 21994 backedges. 7587 proven. 357 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-02-02 10:41:34,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:41:34,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:41:34,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:41:34,090 INFO L87 Difference]: Start difference. First operand 657 states and 669 transitions. Second operand 32 states. [2018-02-02 10:41:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:34,491 INFO L93 Difference]: Finished difference Result 749 states and 762 transitions. [2018-02-02 10:41:34,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:41:34,491 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 623 [2018-02-02 10:41:34,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:34,493 INFO L225 Difference]: With dead ends: 749 [2018-02-02 10:41:34,493 INFO L226 Difference]: Without dead ends: 749 [2018-02-02 10:41:34,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=473, Invalid=1507, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:41:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-02-02 10:41:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 747. [2018-02-02 10:41:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-02-02 10:41:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 760 transitions. [2018-02-02 10:41:34,497 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 760 transitions. Word has length 623 [2018-02-02 10:41:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:34,497 INFO L432 AbstractCegarLoop]: Abstraction has 747 states and 760 transitions. [2018-02-02 10:41:34,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:41:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 760 transitions. [2018-02-02 10:41:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-02-02 10:41:34,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:34,500 INFO L351 BasicCegarLoop]: trace histogram [104, 93, 93, 92, 92, 92, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:34,500 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:34,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1605076985, now seen corresponding path program 38 times [2018-02-02 10:41:34,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:34,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 28245 backedges. 16198 proven. 1218 refuted. 0 times theorem prover too weak. 10829 trivial. 0 not checked. [2018-02-02 10:41:35,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:35,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:41:35,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:35,401 INFO L182 omatonBuilderFactory]: Interpolants [30364#true, 30365#false, 30366#(<= foo_~size |foo_#in~size|), 30367#(<= foo_~size (+ foo_~i~0 |foo_#in~size|)), 30368#(<= (+ foo_~size 1) (+ foo_~i~0 |foo_#in~size|)), 30369#(<= (+ foo_~size 2) (+ foo_~i~0 |foo_#in~size|)), 30370#(<= (+ foo_~size 3) (+ foo_~i~0 |foo_#in~size|)), 30371#(<= (+ foo_~size 4) (+ foo_~i~0 |foo_#in~size|)), 30372#(<= (+ foo_~size 5) (+ foo_~i~0 |foo_#in~size|)), 30373#(<= (+ foo_~size 6) (+ foo_~i~0 |foo_#in~size|)), 30374#(<= (+ foo_~size 7) (+ foo_~i~0 |foo_#in~size|)), 30375#(<= (+ foo_~size 8) (+ foo_~i~0 |foo_#in~size|)), 30376#(<= (+ foo_~size 9) (+ foo_~i~0 |foo_#in~size|)), 30377#(<= (+ foo_~size 10) (+ foo_~i~0 |foo_#in~size|)), 30378#(<= 9 |foo_#in~size|), 30379#(<= 9 main_~i~1), 30380#(<= 10 main_~i~1), 30381#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 30382#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 30383#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 30384#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 30385#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 30386#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 30387#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 30388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 30389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 30390#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 30391#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 30392#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 30393#(<= |foo_#in~size| 9)] [2018-02-02 10:41:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 28245 backedges. 16198 proven. 1218 refuted. 0 times theorem prover too weak. 10829 trivial. 0 not checked. [2018-02-02 10:41:35,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:41:35,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:41:35,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:41:35,402 INFO L87 Difference]: Start difference. First operand 747 states and 760 transitions. Second operand 30 states. [2018-02-02 10:41:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:36,134 INFO L93 Difference]: Finished difference Result 771 states and 782 transitions. [2018-02-02 10:41:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:41:36,134 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 701 [2018-02-02 10:41:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:36,135 INFO L225 Difference]: With dead ends: 771 [2018-02-02 10:41:36,135 INFO L226 Difference]: Without dead ends: 765 [2018-02-02 10:41:36,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=768, Invalid=3264, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:41:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-02-02 10:41:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 747. [2018-02-02 10:41:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-02-02 10:41:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 758 transitions. [2018-02-02 10:41:36,141 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 758 transitions. Word has length 701 [2018-02-02 10:41:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:36,141 INFO L432 AbstractCegarLoop]: Abstraction has 747 states and 758 transitions. [2018-02-02 10:41:36,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:41:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 758 transitions. [2018-02-02 10:41:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-02-02 10:41:36,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:36,144 INFO L351 BasicCegarLoop]: trace histogram [105, 94, 94, 93, 93, 93, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:36,144 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash -678719039, now seen corresponding path program 39 times [2018-02-02 10:41:36,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:36,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 28823 backedges. 8822 proven. 421 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-02 10:41:37,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:37,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:41:37,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:37,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:37,237 INFO L182 omatonBuilderFactory]: Interpolants [32000#(<= foo_~size (+ foo_~i~0 8)), 32001#(<= foo_~size (+ foo_~i~0 7)), 32002#(<= foo_~size (+ foo_~i~0 6)), 32003#(<= foo_~size (+ foo_~i~0 5)), 32004#(<= foo_~size (+ foo_~i~0 4)), 32005#(<= foo_~size (+ foo_~i~0 3)), 32006#(<= foo_~size (+ foo_~i~0 2)), 32007#(<= foo_~size (+ foo_~i~0 1)), 32008#(<= foo_~size foo_~i~0), 32009#(<= (+ foo_~size 1) foo_~i~0), 32010#(<= (+ foo_~size 2) foo_~i~0), 32011#(<= (+ foo_~size 3) foo_~i~0), 32012#(<= (+ foo_~size 4) foo_~i~0), 32013#(<= (+ foo_~size 5) foo_~i~0), 31981#true, 31982#false, 31983#(= main_~i~1 0), 31984#(<= main_~i~1 1), 31985#(<= main_~i~1 2), 31986#(<= main_~i~1 3), 31987#(<= main_~i~1 4), 31988#(<= main_~i~1 5), 31989#(<= main_~i~1 6), 31990#(<= main_~i~1 7), 31991#(<= main_~i~1 8), 31992#(<= main_~i~1 9), 31993#(<= main_~i~1 10), 31994#(<= main_~i~1 11), 31995#(<= |foo_#in~size| 11), 31996#(<= foo_~size 11), 31997#(<= foo_~size (+ foo_~i~0 11)), 31998#(<= foo_~size (+ foo_~i~0 10)), 31999#(<= foo_~size (+ foo_~i~0 9))] [2018-02-02 10:41:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 28823 backedges. 8822 proven. 421 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-02 10:41:37,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:41:37,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:41:37,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:41:37,239 INFO L87 Difference]: Start difference. First operand 747 states and 758 transitions. Second operand 33 states. [2018-02-02 10:41:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:37,686 INFO L93 Difference]: Finished difference Result 839 states and 851 transitions. [2018-02-02 10:41:37,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:41:37,686 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 707 [2018-02-02 10:41:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:37,688 INFO L225 Difference]: With dead ends: 839 [2018-02-02 10:41:37,688 INFO L226 Difference]: Without dead ends: 839 [2018-02-02 10:41:37,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=517, Invalid=1645, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:41:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-02-02 10:41:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-02-02 10:41:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-02-02 10:41:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 849 transitions. [2018-02-02 10:41:37,693 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 849 transitions. Word has length 707 [2018-02-02 10:41:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:37,693 INFO L432 AbstractCegarLoop]: Abstraction has 837 states and 849 transitions. [2018-02-02 10:41:37,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:41:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 849 transitions. [2018-02-02 10:41:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2018-02-02 10:41:37,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:37,696 INFO L351 BasicCegarLoop]: trace histogram [118, 106, 106, 105, 105, 105, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:37,696 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash 387817890, now seen corresponding path program 40 times [2018-02-02 10:41:37,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:37,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36576 backedges. 18862 proven. 2197 refuted. 0 times theorem prover too weak. 15517 trivial. 0 not checked. [2018-02-02 10:41:38,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:38,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:41:38,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:38,913 INFO L182 omatonBuilderFactory]: Interpolants [33728#(<= (+ foo_~size 7) (+ foo_~i~0 |foo_#in~size|)), 33729#(<= (+ foo_~size 8) (+ foo_~i~0 |foo_#in~size|)), 33730#(<= (+ foo_~size 9) (+ foo_~i~0 |foo_#in~size|)), 33731#(<= (+ foo_~size 10) (+ foo_~i~0 |foo_#in~size|)), 33732#(<= 9 |foo_#in~size|), 33733#(<= 9 main_~i~1), 33734#(<= 10 main_~i~1), 33735#(<= 11 main_~i~1), 33736#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 33737#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 33738#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 33739#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 33740#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 33741#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 33742#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 33743#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 33744#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 33745#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 33746#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 33747#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 33748#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 33749#(<= |foo_#in~size| 10), 33718#true, 33719#false, 33720#(<= foo_~size |foo_#in~size|), 33721#(<= foo_~size (+ foo_~i~0 |foo_#in~size|)), 33722#(<= (+ foo_~size 1) (+ foo_~i~0 |foo_#in~size|)), 33723#(<= (+ foo_~size 2) (+ foo_~i~0 |foo_#in~size|)), 33724#(<= (+ foo_~size 3) (+ foo_~i~0 |foo_#in~size|)), 33725#(<= (+ foo_~size 4) (+ foo_~i~0 |foo_#in~size|)), 33726#(<= (+ foo_~size 5) (+ foo_~i~0 |foo_#in~size|)), 33727#(<= (+ foo_~size 6) (+ foo_~i~0 |foo_#in~size|))] [2018-02-02 10:41:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36576 backedges. 18862 proven. 2197 refuted. 0 times theorem prover too weak. 15517 trivial. 0 not checked. [2018-02-02 10:41:38,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:41:38,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:41:38,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:41:38,914 INFO L87 Difference]: Start difference. First operand 837 states and 849 transitions. Second operand 32 states. [2018-02-02 10:41:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:39,709 INFO L93 Difference]: Finished difference Result 861 states and 871 transitions. [2018-02-02 10:41:39,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:41:39,710 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 791 [2018-02-02 10:41:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:39,712 INFO L225 Difference]: With dead ends: 861 [2018-02-02 10:41:39,712 INFO L226 Difference]: Without dead ends: 855 [2018-02-02 10:41:39,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=859, Invalid=3697, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:41:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-02-02 10:41:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 837. [2018-02-02 10:41:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-02-02 10:41:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 847 transitions. [2018-02-02 10:41:39,717 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 847 transitions. Word has length 791 [2018-02-02 10:41:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:39,717 INFO L432 AbstractCegarLoop]: Abstraction has 837 states and 847 transitions. [2018-02-02 10:41:39,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:41:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 847 transitions. [2018-02-02 10:41:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2018-02-02 10:41:39,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:39,721 INFO L351 BasicCegarLoop]: trace histogram [119, 107, 107, 106, 106, 106, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:39,721 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash 423889066, now seen corresponding path program 41 times [2018-02-02 10:41:39,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:39,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 37234 backedges. 10157 proven. 491 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-02-02 10:41:40,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:40,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:41:40,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:40,873 INFO L182 omatonBuilderFactory]: Interpolants [35521#true, 35522#false, 35523#(= main_~i~1 0), 35524#(<= main_~i~1 1), 35525#(<= main_~i~1 2), 35526#(<= main_~i~1 3), 35527#(<= main_~i~1 4), 35528#(<= main_~i~1 5), 35529#(<= main_~i~1 6), 35530#(<= main_~i~1 7), 35531#(<= main_~i~1 8), 35532#(<= main_~i~1 9), 35533#(<= main_~i~1 10), 35534#(<= main_~i~1 11), 35535#(<= main_~i~1 12), 35536#(<= |foo_#in~size| 12), 35537#(<= foo_~size 12), 35538#(<= foo_~size (+ foo_~i~0 12)), 35539#(<= foo_~size (+ foo_~i~0 11)), 35540#(<= foo_~size (+ foo_~i~0 10)), 35541#(<= foo_~size (+ foo_~i~0 9)), 35542#(<= foo_~size (+ foo_~i~0 8)), 35543#(<= foo_~size (+ foo_~i~0 7)), 35544#(<= foo_~size (+ foo_~i~0 6)), 35545#(<= foo_~size (+ foo_~i~0 5)), 35546#(<= foo_~size (+ foo_~i~0 4)), 35547#(<= foo_~size (+ foo_~i~0 3)), 35548#(<= foo_~size (+ foo_~i~0 2)), 35549#(<= foo_~size (+ foo_~i~0 1)), 35550#(<= foo_~size foo_~i~0), 35551#(<= (+ foo_~size 1) foo_~i~0), 35552#(<= (+ foo_~size 2) foo_~i~0), 35553#(<= (+ foo_~size 3) foo_~i~0), 35554#(<= (+ foo_~size 4) foo_~i~0)] [2018-02-02 10:41:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 37234 backedges. 10157 proven. 491 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-02-02 10:41:40,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:41:40,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:41:40,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:41:40,875 INFO L87 Difference]: Start difference. First operand 837 states and 847 transitions. Second operand 34 states. [2018-02-02 10:41:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:41,436 INFO L93 Difference]: Finished difference Result 935 states and 946 transitions. [2018-02-02 10:41:41,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:41:41,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 797 [2018-02-02 10:41:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:41,438 INFO L225 Difference]: With dead ends: 935 [2018-02-02 10:41:41,438 INFO L226 Difference]: Without dead ends: 935 [2018-02-02 10:41:41,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=564, Invalid=1788, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:41:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-02-02 10:41:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 933. [2018-02-02 10:41:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-02-02 10:41:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 944 transitions. [2018-02-02 10:41:41,444 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 944 transitions. Word has length 797 [2018-02-02 10:41:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:41,444 INFO L432 AbstractCegarLoop]: Abstraction has 933 states and 944 transitions. [2018-02-02 10:41:41,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:41:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 944 transitions. [2018-02-02 10:41:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2018-02-02 10:41:41,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:41,448 INFO L351 BasicCegarLoop]: trace histogram [133, 120, 120, 119, 119, 119, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:41,448 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:41,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1555789395, now seen corresponding path program 42 times [2018-02-02 10:41:41,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:41,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 21860 proven. 3250 refuted. 0 times theorem prover too weak. 21613 trivial. 0 not checked. [2018-02-02 10:41:42,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:42,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:41:42,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:42,885 INFO L182 omatonBuilderFactory]: Interpolants [37453#true, 37454#false, 37455#(<= foo_~size |foo_#in~size|), 37456#(<= foo_~size (+ foo_~i~0 |foo_#in~size|)), 37457#(<= (+ foo_~size 1) (+ foo_~i~0 |foo_#in~size|)), 37458#(<= (+ foo_~size 2) (+ foo_~i~0 |foo_#in~size|)), 37459#(<= (+ foo_~size 3) (+ foo_~i~0 |foo_#in~size|)), 37460#(<= (+ foo_~size 4) (+ foo_~i~0 |foo_#in~size|)), 37461#(<= (+ foo_~size 5) (+ foo_~i~0 |foo_#in~size|)), 37462#(<= (+ foo_~size 6) (+ foo_~i~0 |foo_#in~size|)), 37463#(<= (+ foo_~size 7) (+ foo_~i~0 |foo_#in~size|)), 37464#(<= (+ foo_~size 8) (+ foo_~i~0 |foo_#in~size|)), 37465#(<= (+ foo_~size 9) (+ foo_~i~0 |foo_#in~size|)), 37466#(<= (+ foo_~size 10) (+ foo_~i~0 |foo_#in~size|)), 37467#(<= 9 |foo_#in~size|), 37468#(<= 9 main_~i~1), 37469#(<= 10 main_~i~1), 37470#(<= 11 main_~i~1), 37471#(<= 12 main_~i~1), 37472#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 37473#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 37474#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 37475#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 37476#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 37477#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 37478#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 37479#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 37480#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 37481#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 37482#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 37483#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 37484#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 37485#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 37486#(<= |foo_#in~size| 11)] [2018-02-02 10:41:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 21860 proven. 3250 refuted. 0 times theorem prover too weak. 21613 trivial. 0 not checked. [2018-02-02 10:41:42,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:41:42,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:41:42,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:41:42,887 INFO L87 Difference]: Start difference. First operand 933 states and 944 transitions. Second operand 34 states. [2018-02-02 10:41:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:43,703 INFO L93 Difference]: Finished difference Result 957 states and 966 transitions. [2018-02-02 10:41:43,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:41:43,703 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 887 [2018-02-02 10:41:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:43,704 INFO L225 Difference]: With dead ends: 957 [2018-02-02 10:41:43,704 INFO L226 Difference]: Without dead ends: 951 [2018-02-02 10:41:43,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=957, Invalid=4155, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 10:41:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-02-02 10:41:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 933. [2018-02-02 10:41:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-02-02 10:41:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 942 transitions. [2018-02-02 10:41:43,709 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 942 transitions. Word has length 887 [2018-02-02 10:41:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:43,709 INFO L432 AbstractCegarLoop]: Abstraction has 933 states and 942 transitions. [2018-02-02 10:41:43,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:41:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 942 transitions. [2018-02-02 10:41:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2018-02-02 10:41:43,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:43,713 INFO L351 BasicCegarLoop]: trace histogram [134, 121, 121, 120, 120, 120, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:43,713 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 828495003, now seen corresponding path program 43 times [2018-02-02 10:41:43,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:43,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 47467 backedges. 11592 proven. 567 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-02 10:41:45,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:45,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:41:45,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:45,136 INFO L182 omatonBuilderFactory]: Interpolants [39488#(<= (+ foo_~size 3) foo_~i~0), 39454#true, 39455#false, 39456#(= main_~i~1 0), 39457#(<= main_~i~1 1), 39458#(<= main_~i~1 2), 39459#(<= main_~i~1 3), 39460#(<= main_~i~1 4), 39461#(<= main_~i~1 5), 39462#(<= main_~i~1 6), 39463#(<= main_~i~1 7), 39464#(<= main_~i~1 8), 39465#(<= main_~i~1 9), 39466#(<= main_~i~1 10), 39467#(<= main_~i~1 11), 39468#(<= main_~i~1 12), 39469#(<= main_~i~1 13), 39470#(<= |foo_#in~size| 13), 39471#(<= foo_~size 13), 39472#(<= foo_~size (+ foo_~i~0 13)), 39473#(<= foo_~size (+ foo_~i~0 12)), 39474#(<= foo_~size (+ foo_~i~0 11)), 39475#(<= foo_~size (+ foo_~i~0 10)), 39476#(<= foo_~size (+ foo_~i~0 9)), 39477#(<= foo_~size (+ foo_~i~0 8)), 39478#(<= foo_~size (+ foo_~i~0 7)), 39479#(<= foo_~size (+ foo_~i~0 6)), 39480#(<= foo_~size (+ foo_~i~0 5)), 39481#(<= foo_~size (+ foo_~i~0 4)), 39482#(<= foo_~size (+ foo_~i~0 3)), 39483#(<= foo_~size (+ foo_~i~0 2)), 39484#(<= foo_~size (+ foo_~i~0 1)), 39485#(<= foo_~size foo_~i~0), 39486#(<= (+ foo_~size 1) foo_~i~0), 39487#(<= (+ foo_~size 2) foo_~i~0)] [2018-02-02 10:41:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 47467 backedges. 11592 proven. 567 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-02 10:41:45,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:41:45,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:41:45,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=896, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:41:45,137 INFO L87 Difference]: Start difference. First operand 933 states and 942 transitions. Second operand 35 states. [2018-02-02 10:41:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:45,744 INFO L93 Difference]: Finished difference Result 1037 states and 1047 transitions. [2018-02-02 10:41:45,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:41:45,744 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 893 [2018-02-02 10:41:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:45,745 INFO L225 Difference]: With dead ends: 1037 [2018-02-02 10:41:45,745 INFO L226 Difference]: Without dead ends: 1037 [2018-02-02 10:41:45,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=614, Invalid=1936, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:41:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-02-02 10:41:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1035. [2018-02-02 10:41:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-02-02 10:41:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1045 transitions. [2018-02-02 10:41:45,751 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1045 transitions. Word has length 893 [2018-02-02 10:41:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:45,751 INFO L432 AbstractCegarLoop]: Abstraction has 1035 states and 1045 transitions. [2018-02-02 10:41:45,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:41:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1045 transitions. [2018-02-02 10:41:45,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-02-02 10:41:45,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:45,755 INFO L351 BasicCegarLoop]: trace histogram [149, 135, 135, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:45,755 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:45,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1597215884, now seen corresponding path program 44 times [2018-02-02 10:41:45,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:45,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 25210 proven. 4377 refuted. 0 times theorem prover too weak. 29357 trivial. 0 not checked. [2018-02-02 10:41:47,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:47,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:41:47,534 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:47,535 INFO L182 omatonBuilderFactory]: Interpolants [41600#(<= (+ foo_~size 4) (+ foo_~i~0 |foo_#in~size|)), 41601#(<= (+ foo_~size 5) (+ foo_~i~0 |foo_#in~size|)), 41602#(<= (+ foo_~size 6) (+ foo_~i~0 |foo_#in~size|)), 41603#(<= (+ foo_~size 7) (+ foo_~i~0 |foo_#in~size|)), 41604#(<= (+ foo_~size 8) (+ foo_~i~0 |foo_#in~size|)), 41605#(<= (+ foo_~size 9) (+ foo_~i~0 |foo_#in~size|)), 41606#(<= (+ foo_~size 10) (+ foo_~i~0 |foo_#in~size|)), 41607#(<= 9 |foo_#in~size|), 41608#(<= 9 main_~i~1), 41609#(<= 10 main_~i~1), 41610#(<= 11 main_~i~1), 41611#(<= 12 main_~i~1), 41612#(<= 13 main_~i~1), 41613#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 41614#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 41615#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 41616#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 41617#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 41618#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 41619#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 41620#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 41621#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 41622#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 41623#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 41624#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 41625#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 41626#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 41627#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 41628#(<= |foo_#in~size| 12), 41593#true, 41594#false, 41595#(<= foo_~size |foo_#in~size|), 41596#(<= foo_~size (+ foo_~i~0 |foo_#in~size|)), 41597#(<= (+ foo_~size 1) (+ foo_~i~0 |foo_#in~size|)), 41598#(<= (+ foo_~size 2) (+ foo_~i~0 |foo_#in~size|)), 41599#(<= (+ foo_~size 3) (+ foo_~i~0 |foo_#in~size|))] [2018-02-02 10:41:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 25210 proven. 4377 refuted. 0 times theorem prover too weak. 29357 trivial. 0 not checked. [2018-02-02 10:41:47,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:41:47,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:41:47,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:41:47,536 INFO L87 Difference]: Start difference. First operand 1035 states and 1045 transitions. Second operand 36 states. [2018-02-02 10:41:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:48,445 INFO L93 Difference]: Finished difference Result 1059 states and 1067 transitions. [2018-02-02 10:41:48,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 10:41:48,445 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 989 [2018-02-02 10:41:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:48,447 INFO L225 Difference]: With dead ends: 1059 [2018-02-02 10:41:48,447 INFO L226 Difference]: Without dead ends: 1053 [2018-02-02 10:41:48,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1062, Invalid=4638, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 10:41:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2018-02-02 10:41:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1035. [2018-02-02 10:41:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-02-02 10:41:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1043 transitions. [2018-02-02 10:41:48,453 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1043 transitions. Word has length 989 [2018-02-02 10:41:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:48,453 INFO L432 AbstractCegarLoop]: Abstraction has 1035 states and 1043 transitions. [2018-02-02 10:41:48,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:41:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1043 transitions. [2018-02-02 10:41:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-02-02 10:41:48,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:48,458 INFO L351 BasicCegarLoop]: trace histogram [150, 136, 136, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:48,458 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:48,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1007592468, now seen corresponding path program 45 times [2018-02-02 10:41:48,459 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:48,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 59780 backedges. 12390 proven. 784 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:50,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:50,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:41:50,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:50,201 INFO L182 omatonBuilderFactory]: Interpolants [43808#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 43809#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 43810#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 43811#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 43812#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 43813#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 43814#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 43815#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 43816#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 43817#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 43818#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 43819#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0)), 43820#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (= foo_~b.offset 0)), 43821#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 13)), 43822#(and (<= foo_~i~0 14) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 43823#(and (<= foo_~i~0 15) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 43824#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 16)), 43825#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 16)), 43804#true, 43805#false, 43806#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 43807#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|)))] [2018-02-02 10:41:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 59780 backedges. 12390 proven. 784 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:50,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:41:50,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:41:50,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:41:50,203 INFO L87 Difference]: Start difference. First operand 1035 states and 1043 transitions. Second operand 22 states. [2018-02-02 10:41:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:50,548 INFO L93 Difference]: Finished difference Result 1067 states and 1076 transitions. [2018-02-02 10:41:50,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:41:50,548 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 995 [2018-02-02 10:41:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:50,550 INFO L225 Difference]: With dead ends: 1067 [2018-02-02 10:41:50,550 INFO L226 Difference]: Without dead ends: 1067 [2018-02-02 10:41:50,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=536, Invalid=946, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:41:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-02-02 10:41:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1041. [2018-02-02 10:41:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-02-02 10:41:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1050 transitions. [2018-02-02 10:41:50,555 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1050 transitions. Word has length 995 [2018-02-02 10:41:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:50,555 INFO L432 AbstractCegarLoop]: Abstraction has 1041 states and 1050 transitions. [2018-02-02 10:41:50,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:41:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1050 transitions. [2018-02-02 10:41:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2018-02-02 10:41:50,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:50,563 INFO L351 BasicCegarLoop]: trace histogram [151, 137, 137, 136, 136, 136, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:50,563 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:50,563 INFO L82 PathProgramCache]: Analyzing trace with hash -842738468, now seen corresponding path program 46 times [2018-02-02 10:41:50,564 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:50,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 60622 backedges. 13132 proven. 884 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:52,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:52,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:41:52,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:52,357 INFO L182 omatonBuilderFactory]: Interpolants [45984#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (= foo_~b.offset 0)), 45985#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 13)), 45986#(and (<= foo_~i~0 14) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 45987#(and (<= foo_~i~0 15) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 45988#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 16)), 45989#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 17) (= foo_~b.offset 0)), 45990#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (<= foo_~i~0 17) (= foo_~b.offset 0)), 45968#true, 45969#false, 45970#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 45971#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 45972#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 45973#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 45974#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 45975#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 45976#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 45977#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 45978#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 45979#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 45980#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 45981#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 45982#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 45983#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0))] [2018-02-02 10:41:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 60622 backedges. 13132 proven. 884 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:52,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:41:52,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:41:52,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:41:52,358 INFO L87 Difference]: Start difference. First operand 1041 states and 1050 transitions. Second operand 23 states. [2018-02-02 10:41:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:52,721 INFO L93 Difference]: Finished difference Result 1076 states and 1086 transitions. [2018-02-02 10:41:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:41:52,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1001 [2018-02-02 10:41:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:52,760 INFO L225 Difference]: With dead ends: 1076 [2018-02-02 10:41:52,761 INFO L226 Difference]: Without dead ends: 1076 [2018-02-02 10:41:52,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=594, Invalid=1046, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:41:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-02-02 10:41:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1047. [2018-02-02 10:41:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2018-02-02 10:41:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1057 transitions. [2018-02-02 10:41:52,766 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1057 transitions. Word has length 1001 [2018-02-02 10:41:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:52,766 INFO L432 AbstractCegarLoop]: Abstraction has 1047 states and 1057 transitions. [2018-02-02 10:41:52,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:41:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1057 transitions. [2018-02-02 10:41:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2018-02-02 10:41:52,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:52,771 INFO L351 BasicCegarLoop]: trace histogram [152, 138, 138, 137, 137, 137, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:52,771 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:52,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1039486884, now seen corresponding path program 47 times [2018-02-02 10:41:52,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:52,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 61470 backedges. 13874 proven. 990 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:54,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:54,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:41:54,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:54,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 10:41:54,649 INFO L182 omatonBuilderFactory]: Interpolants [48160#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 48161#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 48162#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 48163#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 48164#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 48165#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0)), 48166#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (= foo_~b.offset 0)), 48167#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 13)), 48168#(and (<= foo_~i~0 14) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 48169#(and (<= foo_~i~0 15) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 48170#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 16)), 48171#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 17) (= foo_~b.offset 0)), 48172#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 18) (= foo_~b.offset 0)), 48173#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (<= foo_~i~0 18) (= foo_~b.offset 0)), 48150#true, 48151#false, 48152#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 48153#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 48154#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 48155#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 48156#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 48157#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 48158#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 48159#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5))] [2018-02-02 10:41:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 61470 backedges. 13874 proven. 990 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:54,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:41:54,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:41:54,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:41:54,650 INFO L87 Difference]: Start difference. First operand 1047 states and 1057 transitions. Second operand 24 states. [2018-02-02 10:41:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:55,051 INFO L93 Difference]: Finished difference Result 1085 states and 1096 transitions. [2018-02-02 10:41:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:41:55,054 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1007 [2018-02-02 10:41:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:55,056 INFO L225 Difference]: With dead ends: 1085 [2018-02-02 10:41:55,056 INFO L226 Difference]: Without dead ends: 1085 [2018-02-02 10:41:55,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:41:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2018-02-02 10:41:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1053. [2018-02-02 10:41:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-02-02 10:41:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1064 transitions. [2018-02-02 10:41:55,061 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1064 transitions. Word has length 1007 [2018-02-02 10:41:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:55,061 INFO L432 AbstractCegarLoop]: Abstraction has 1053 states and 1064 transitions. [2018-02-02 10:41:55,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:41:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1064 transitions. [2018-02-02 10:41:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2018-02-02 10:41:55,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:55,066 INFO L351 BasicCegarLoop]: trace histogram [153, 139, 139, 138, 138, 138, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:55,066 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:55,066 INFO L82 PathProgramCache]: Analyzing trace with hash -700410772, now seen corresponding path program 48 times [2018-02-02 10:41:55,067 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:55,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 62324 backedges. 14616 proven. 1102 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:57,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:57,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:41:57,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:57,082 INFO L182 omatonBuilderFactory]: Interpolants [50368#(and (<= foo_~i~0 14) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 50369#(and (<= foo_~i~0 15) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 50370#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 16)), 50371#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 17) (= foo_~b.offset 0)), 50372#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 18) (= foo_~b.offset 0)), 50373#(and (<= foo_~i~0 19) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 50374#(and (<= foo_~i~0 19) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 50350#true, 50351#false, 50352#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 50353#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 50354#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 50355#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 50356#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 50357#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 50358#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 50359#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 50360#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 50361#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 50362#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 50363#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 50364#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 50365#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0)), 50366#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (= foo_~b.offset 0)), 50367#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 13))] [2018-02-02 10:41:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 62324 backedges. 14616 proven. 1102 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:57,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:41:57,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:41:57,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=361, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:41:57,083 INFO L87 Difference]: Start difference. First operand 1053 states and 1064 transitions. Second operand 25 states. [2018-02-02 10:41:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:41:57,506 INFO L93 Difference]: Finished difference Result 1094 states and 1106 transitions. [2018-02-02 10:41:57,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:41:57,506 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1013 [2018-02-02 10:41:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:41:57,508 INFO L225 Difference]: With dead ends: 1094 [2018-02-02 10:41:57,508 INFO L226 Difference]: Without dead ends: 1094 [2018-02-02 10:41:57,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=719, Invalid=1261, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:41:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2018-02-02 10:41:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1059. [2018-02-02 10:41:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-02-02 10:41:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1071 transitions. [2018-02-02 10:41:57,514 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1071 transitions. Word has length 1013 [2018-02-02 10:41:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:41:57,515 INFO L432 AbstractCegarLoop]: Abstraction has 1059 states and 1071 transitions. [2018-02-02 10:41:57,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:41:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1071 transitions. [2018-02-02 10:41:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1020 [2018-02-02 10:41:57,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:41:57,520 INFO L351 BasicCegarLoop]: trace histogram [154, 140, 140, 139, 139, 139, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:41:57,520 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:41:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1172775732, now seen corresponding path program 49 times [2018-02-02 10:41:57,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:41:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:41:57,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:41:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 63184 backedges. 15358 proven. 1220 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:59,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:41:59,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:41:59,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:41:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:41:59,510 INFO L182 omatonBuilderFactory]: Interpolants [52568#true, 52569#false, 52570#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 52571#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 52572#(and (= foo_~i~0 0) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 52573#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 1) (= foo_~b.offset 0)), 52574#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 2) (= foo_~b.offset 0)), 52575#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 3) (= foo_~b.offset 0)), 52576#(and (<= foo_~i~0 4) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 52577#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 5)), 52578#(and (<= foo_~i~0 6) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 52579#(and (<= foo_~i~0 7) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 52580#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 8)), 52581#(and (<= foo_~i~0 9) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 52582#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 10) (= foo_~b.offset 0)), 52583#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 11) (= foo_~b.offset 0)), 52584#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 12) (= foo_~b.offset 0)), 52585#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 13)), 52586#(and (<= foo_~i~0 14) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 52587#(and (<= foo_~i~0 15) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 52588#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 16)), 52589#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 17) (= foo_~b.offset 0)), 52590#(and (= (select |#length| foo_~b.base) 32) (<= foo_~i~0 18) (= foo_~b.offset 0)), 52591#(and (<= foo_~i~0 19) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 52592#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~i~0 20)), 52593#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 20))] [2018-02-02 10:41:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 63184 backedges. 15358 proven. 1220 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-02 10:41:59,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:41:59,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:41:59,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:41:59,511 INFO L87 Difference]: Start difference. First operand 1059 states and 1071 transitions. Second operand 26 states. [2018-02-02 10:42:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:00,025 INFO L93 Difference]: Finished difference Result 1103 states and 1116 transitions. [2018-02-02 10:42:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:42:00,026 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1019 [2018-02-02 10:42:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:00,027 INFO L225 Difference]: With dead ends: 1103 [2018-02-02 10:42:00,028 INFO L226 Difference]: Without dead ends: 1103 [2018-02-02 10:42:00,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=786, Invalid=1376, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:42:00,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-02-02 10:42:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1065. [2018-02-02 10:42:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2018-02-02 10:42:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1078 transitions. [2018-02-02 10:42:00,033 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1078 transitions. Word has length 1019 [2018-02-02 10:42:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:00,033 INFO L432 AbstractCegarLoop]: Abstraction has 1065 states and 1078 transitions. [2018-02-02 10:42:00,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:42:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1078 transitions. [2018-02-02 10:42:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2018-02-02 10:42:00,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:00,038 INFO L351 BasicCegarLoop]: trace histogram [155, 141, 141, 140, 140, 140, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:00,038 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash -372671492, now seen corresponding path program 50 times [2018-02-02 10:42:00,039 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:00,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 64050 backedges. 16100 proven. 644 refuted. 0 times theorem prover too weak. 47306 trivial. 0 not checked. [2018-02-02 10:42:01,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:01,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:42:01,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:01,906 INFO L182 omatonBuilderFactory]: Interpolants [54816#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (<= main_~i~1 9)), 54817#(and (<= main_~i~1 10) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 54818#(and (<= main_~i~1 11) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 54819#(and (= 32 (select |#length| |main_~#mask~0.base|)) (<= main_~i~1 12) (= 0 |main_~#mask~0.offset|)), 54820#(and (<= main_~i~1 13) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 54821#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (<= main_~i~1 14)), 54822#(and (= 0 |foo_#in~b.offset|) (<= |foo_#in~size| 14) (= 32 (select |#length| |foo_#in~b.base|))), 54823#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0) (<= foo_~size 14)), 54824#(and (<= foo_~i~0 15) (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 54825#(and (<= foo_~i~0 15) (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0)), 54804#true, 54805#false, 54806#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 54807#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (= main_~i~1 0)), 54808#(and (= 32 (select |#length| |main_~#mask~0.base|)) (<= main_~i~1 1) (= 0 |main_~#mask~0.offset|)), 54809#(and (<= main_~i~1 2) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 54810#(and (<= main_~i~1 3) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 54811#(and (<= main_~i~1 4) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 54812#(and (= 32 (select |#length| |main_~#mask~0.base|)) (<= main_~i~1 5) (= 0 |main_~#mask~0.offset|)), 54813#(and (<= main_~i~1 6) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 54814#(and (<= main_~i~1 7) (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 54815#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (<= main_~i~1 8))] [2018-02-02 10:42:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 64050 backedges. 16100 proven. 644 refuted. 0 times theorem prover too weak. 47306 trivial. 0 not checked. [2018-02-02 10:42:01,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:42:01,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:42:01,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:42:01,907 INFO L87 Difference]: Start difference. First operand 1065 states and 1078 transitions. Second operand 22 states. [2018-02-02 10:42:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:02,070 INFO L93 Difference]: Finished difference Result 1207 states and 1227 transitions. [2018-02-02 10:42:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:42:02,071 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1025 [2018-02-02 10:42:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:02,073 INFO L225 Difference]: With dead ends: 1207 [2018-02-02 10:42:02,073 INFO L226 Difference]: Without dead ends: 1207 [2018-02-02 10:42:02,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:42:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-02-02 10:42:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1167. [2018-02-02 10:42:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-02-02 10:42:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1181 transitions. [2018-02-02 10:42:02,082 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1181 transitions. Word has length 1025 [2018-02-02 10:42:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:02,083 INFO L432 AbstractCegarLoop]: Abstraction has 1167 states and 1181 transitions. [2018-02-02 10:42:02,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:42:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1181 transitions. [2018-02-02 10:42:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2018-02-02 10:42:02,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:02,089 INFO L351 BasicCegarLoop]: trace histogram [171, 156, 156, 155, 155, 155, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:02,089 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1580685045, now seen corresponding path program 51 times [2018-02-02 10:42:02,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:02,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 10:42:03,047 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:42:03,049 INFO L168 Benchmark]: Toolchain (without parser) took 53709.26 ms. Allocated memory was 405.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 363.4 MB in the beginning and 603.2 MB in the end (delta: -239.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 10:42:03,050 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:42:03,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 118.65 ms. Allocated memory is still 405.3 MB. Free memory was 363.4 MB in the beginning and 355.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:42:03,050 INFO L168 Benchmark]: Boogie Preprocessor took 29.75 ms. Allocated memory is still 405.3 MB. Free memory was 355.4 MB in the beginning and 352.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:42:03,050 INFO L168 Benchmark]: RCFGBuilder took 208.08 ms. Allocated memory is still 405.3 MB. Free memory was 352.7 MB in the beginning and 337.2 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:42:03,051 INFO L168 Benchmark]: TraceAbstraction took 53350.46 ms. Allocated memory was 405.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 335.9 MB in the beginning and 603.2 MB in the end (delta: -267.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 10:42:03,052 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.14 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 118.65 ms. Allocated memory is still 405.3 MB. Free memory was 363.4 MB in the beginning and 355.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.75 ms. Allocated memory is still 405.3 MB. Free memory was 355.4 MB in the beginning and 352.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 208.08 ms. Allocated memory is still 405.3 MB. Free memory was 352.7 MB in the beginning and 337.2 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53350.46 ms. Allocated memory was 405.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 335.9 MB in the beginning and 603.2 MB in the end (delta: -267.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-42-03-057.csv Completed graceful shutdown