java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:11:15,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:11:15,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:11:15,183 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:11:15,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:11:15,184 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:11:15,185 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:11:15,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:11:15,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:11:15,187 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:11:15,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:11:15,188 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:11:15,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:11:15,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:11:15,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:11:15,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:11:15,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:11:15,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:11:15,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:11:15,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:11:15,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:11:15,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:11:15,199 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:11:15,200 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:11:15,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:11:15,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:11:15,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:11:15,202 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:11:15,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:11:15,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:11:15,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:11:15,203 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:11:15,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:11:15,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:11:15,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:11:15,213 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:11:15,214 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:11:15,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:11:15,214 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:11:15,214 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:11:15,214 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:11:15,214 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:11:15,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:11:15,215 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:11:15,215 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:11:15,215 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:11:15,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:11:15,215 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:11:15,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:11:15,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:11:15,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:11:15,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:11:15,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:11:15,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:11:15,216 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:11:15,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:11:15,217 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:11:15,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:11:15,255 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:11:15,258 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:11:15,259 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:11:15,260 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:11:15,260 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-04 04:11:15,376 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:11:15,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:11:15,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:11:15,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:11:15,383 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:11:15,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266a4d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15, skipping insertion in model container [2018-02-04 04:11:15,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,401 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:11:15,414 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:11:15,515 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:11:15,529 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:11:15,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15 WrapperNode [2018-02-04 04:11:15,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:11:15,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:11:15,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:11:15,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:11:15,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (1/1) ... [2018-02-04 04:11:15,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:11:15,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:11:15,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:11:15,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:11:15,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (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-04 04:11:15,600 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:11:15,601 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:11:15,601 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 04:11:15,601 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:11:15,601 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:11:15,601 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:11:15,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:11:15,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:11:15,601 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:11:15,602 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 04:11:15,602 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:11:15,602 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:11:15,602 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:11:15,752 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:11:15,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:11:15 BoogieIcfgContainer [2018-02-04 04:11:15,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:11:15,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:11:15,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:11:15,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:11:15,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:11:15" (1/3) ... [2018-02-04 04:11:15,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eaaeda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:11:15, skipping insertion in model container [2018-02-04 04:11:15,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:11:15" (2/3) ... [2018-02-04 04:11:15,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eaaeda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:11:15, skipping insertion in model container [2018-02-04 04:11:15,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:11:15" (3/3) ... [2018-02-04 04:11:15,758 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-02-04 04:11:15,763 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:11:15,767 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 04:11:15,798 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:11:15,799 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:11:15,799 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:11:15,799 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:11:15,799 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:11:15,799 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:11:15,799 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:11:15,799 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:11:15,800 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:11:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 04:11:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 04:11:15,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:15,821 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:15,821 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 04:11:15,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:15,827 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:15,870 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:15,871 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:15,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:15,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:15,987 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-04 04:11:15,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:15,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:11:15,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:11:16,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:11:16,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:11:16,004 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 04:11:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,077 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 04:11:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:11:16,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 04:11:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,084 INFO L225 Difference]: With dead ends: 63 [2018-02-04 04:11:16,085 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 04:11:16,086 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-04 04:11:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 04:11:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 04:11:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 04:11:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 04:11:16,157 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 04:11:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,157 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 04:11:16,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:11:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 04:11:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:11:16,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,158 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:16,158 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 04:11:16,158 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,158 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,159 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,242 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-04 04:11:16,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:16,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:11:16,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:11:16,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:11:16,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:11:16,245 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-02-04 04:11:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,378 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 04:11:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:11:16,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-04 04:11:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,381 INFO L225 Difference]: With dead ends: 91 [2018-02-04 04:11:16,381 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 04:11:16,381 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-04 04:11:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 04:11:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-02-04 04:11:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 04:11:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-02-04 04:11:16,388 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-02-04 04:11:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,389 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-02-04 04:11:16,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:11:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-02-04 04:11:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:11:16,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,389 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:16,390 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,390 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 04:11:16,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,390 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,552 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-04 04:11:16,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:16,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:11:16,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:11:16,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:11:16,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:11:16,554 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 8 states. [2018-02-04 04:11:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,722 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 04:11:16,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:11:16,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 04:11:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,725 INFO L225 Difference]: With dead ends: 75 [2018-02-04 04:11:16,725 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 04:11:16,725 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-04 04:11:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 04:11:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 04:11:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 04:11:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-04 04:11:16,731 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2018-02-04 04:11:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,732 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-04 04:11:16,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:11:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-04 04:11:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:11:16,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,733 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:16,733 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 04:11:16,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,734 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,804 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-04 04:11:16,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:16,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:11:16,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:11:16,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:11:16,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:11:16,805 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-02-04 04:11:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:16,851 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-04 04:11:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:11:16,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:11:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:16,852 INFO L225 Difference]: With dead ends: 65 [2018-02-04 04:11:16,853 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 04:11:16,853 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-04 04:11:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 04:11:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 04:11:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 04:11:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-02-04 04:11:16,860 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-02-04 04:11:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:16,861 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-02-04 04:11:16,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:11:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-02-04 04:11:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:11:16,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:16,862 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-04 04:11:16,862 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:16,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 04:11:16,862 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:16,862 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:16,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,863 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:16,962 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-04 04:11:16,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:16,963 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:16,963 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:16,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:17,006 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-04 04:11:17,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:17,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-02-04 04:11:17,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:11:17,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:11:17,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:11:17,007 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 10 states. [2018-02-04 04:11:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:17,136 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-02-04 04:11:17,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:11:17,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 04:11:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:17,138 INFO L225 Difference]: With dead ends: 105 [2018-02-04 04:11:17,138 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 04:11:17,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:11:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 04:11:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2018-02-04 04:11:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 04:11:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-04 04:11:17,144 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2018-02-04 04:11:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:17,144 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-04 04:11:17,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:11:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-04 04:11:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 04:11:17,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:17,145 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-04 04:11:17,146 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:17,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-02-04 04:11:17,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:17,146 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:17,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,147 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:17,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:17,208 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-04 04:11:17,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:17,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:11:17,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:11:17,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:11:17,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:11:17,209 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-02-04 04:11:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:17,250 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-04 04:11:17,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:11:17,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 04:11:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:17,252 INFO L225 Difference]: With dead ends: 85 [2018-02-04 04:11:17,252 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 04:11:17,252 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-04 04:11:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 04:11:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-02-04 04:11:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 04:11:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-04 04:11:17,259 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 29 [2018-02-04 04:11:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:17,259 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-04 04:11:17,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:11:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-04 04:11:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 04:11:17,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:17,260 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-04 04:11:17,260 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:17,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-04 04:11:17,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:17,260 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:17,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,261 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:17,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:17,300 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-04 04:11:17,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:17,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:17,301 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:17,324 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-04 04:11:17,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:17,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-04 04:11:17,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:11:17,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:11:17,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:11:17,326 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 5 states. [2018-02-04 04:11:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:17,386 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-04 04:11:17,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:11:17,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-04 04:11:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:17,388 INFO L225 Difference]: With dead ends: 99 [2018-02-04 04:11:17,388 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 04:11:17,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-04 04:11:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 04:11:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2018-02-04 04:11:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 04:11:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-04 04:11:17,392 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 37 [2018-02-04 04:11:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:17,393 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-04 04:11:17,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:11:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-04 04:11:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 04:11:17,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:17,394 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:17,394 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 2 times [2018-02-04 04:11:17,394 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:17,395 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:17,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,395 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:17,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 04:11:17,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:17,492 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:17,493 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:17,509 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:11:17,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:17,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:17,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:11:17,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 04:11:17,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:17,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 04:11:17,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 04:11:17,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:11:17,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 04:11:17,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:17,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 04:11:17,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 04:11:17,607 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-02-04 04:11:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 04:11:17,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:11:17,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-02-04 04:11:17,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:11:17,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:11:17,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-02-04 04:11:17,621 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 10 states. [2018-02-04 04:11:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:17,843 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-02-04 04:11:17,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:11:17,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-02-04 04:11:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:17,844 INFO L225 Difference]: With dead ends: 105 [2018-02-04 04:11:17,844 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 04:11:17,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=206, Unknown=1, NotChecked=30, Total=306 [2018-02-04 04:11:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 04:11:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-02-04 04:11:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 04:11:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 04:11:17,847 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-02-04 04:11:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:17,847 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 04:11:17,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:11:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 04:11:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 04:11:17,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:17,848 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-04 04:11:17,848 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-02-04 04:11:17,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:17,848 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:17,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,849 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:17,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:17,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:18,042 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-04 04:11:18,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:18,042 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:18,043 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:18,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:11:18,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:18,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-02-04 04:11:18,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:11:18,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:11:18,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:11:18,167 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 16 states. [2018-02-04 04:11:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:18,511 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-04 04:11:18,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:11:18,512 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-04 04:11:18,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:18,513 INFO L225 Difference]: With dead ends: 133 [2018-02-04 04:11:18,513 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 04:11:18,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:11:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 04:11:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2018-02-04 04:11:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 04:11:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-02-04 04:11:18,518 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 59 [2018-02-04 04:11:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:18,518 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-02-04 04:11:18,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:11:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-02-04 04:11:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 04:11:18,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:18,520 INFO L351 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:18,520 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash -480231808, now seen corresponding path program 2 times [2018-02-04 04:11:18,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:18,521 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:18,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,521 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:18,522 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:18,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 04:11:18,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:11:18,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:11:18,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:11:18,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:11:18,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:11:18,604 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 7 states. [2018-02-04 04:11:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:18,646 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-02-04 04:11:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:11:18,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-02-04 04:11:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:18,647 INFO L225 Difference]: With dead ends: 111 [2018-02-04 04:11:18,647 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 04:11:18,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:11:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 04:11:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-04 04:11:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 04:11:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-02-04 04:11:18,652 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 77 [2018-02-04 04:11:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:18,652 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-02-04 04:11:18,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:11:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-02-04 04:11:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 04:11:18,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:18,654 INFO L351 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:18,654 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash 49530632, now seen corresponding path program 3 times [2018-02-04 04:11:18,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:18,654 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:18,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,655 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:18,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:18,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 04:11:18,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:18,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:18,714 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:11:18,731 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 04:11:18,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:18,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:18,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:11:18,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:18,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:11:18,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:11:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 106 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 04:11:18,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:18,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-02-04 04:11:18,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:11:18,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:11:18,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:11:18,931 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 16 states. [2018-02-04 04:11:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:19,281 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-02-04 04:11:19,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:11:19,282 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 83 [2018-02-04 04:11:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:19,283 INFO L225 Difference]: With dead ends: 154 [2018-02-04 04:11:19,283 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 04:11:19,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:11:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 04:11:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-02-04 04:11:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 04:11:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-02-04 04:11:19,288 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 83 [2018-02-04 04:11:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:19,288 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-02-04 04:11:19,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:11:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-02-04 04:11:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 04:11:19,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:19,290 INFO L351 BasicCegarLoop]: trace histogram [14, 11, 11, 10, 10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:19,290 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:19,291 INFO L82 PathProgramCache]: Analyzing trace with hash 519451937, now seen corresponding path program 4 times [2018-02-04 04:11:19,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:19,291 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:19,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:19,293 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:19,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:19,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 262 proven. 47 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 04:11:19,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:19,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:19,392 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:11:19,406 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:11:19,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:19,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 305 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-04 04:11:19,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:19,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-04 04:11:19,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:11:19,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:11:19,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:11:19,462 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 12 states. [2018-02-04 04:11:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:19,546 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-02-04 04:11:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:11:19,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-02-04 04:11:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:19,547 INFO L225 Difference]: With dead ends: 151 [2018-02-04 04:11:19,547 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 04:11:19,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:11:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 04:11:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2018-02-04 04:11:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 04:11:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-04 04:11:19,549 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 113 [2018-02-04 04:11:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:19,549 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-04 04:11:19,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:11:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-04 04:11:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 04:11:19,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:19,550 INFO L351 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:19,551 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:19,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2114920591, now seen corresponding path program 5 times [2018-02-04 04:11:19,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:19,551 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:19,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:19,551 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:19,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:19,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 257 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-02-04 04:11:19,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:19,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:19,789 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:11:19,824 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 04:11:19,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:19,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 409 proven. 24 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-02-04 04:11:19,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:19,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-02-04 04:11:19,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:11:19,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:11:19,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:11:19,915 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 18 states. [2018-02-04 04:11:20,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:20,156 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2018-02-04 04:11:20,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:11:20,157 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-02-04 04:11:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:20,157 INFO L225 Difference]: With dead ends: 174 [2018-02-04 04:11:20,158 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 04:11:20,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:11:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 04:11:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 147. [2018-02-04 04:11:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 04:11:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-02-04 04:11:20,160 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 125 [2018-02-04 04:11:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:20,161 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-02-04 04:11:20,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:11:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-02-04 04:11:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 04:11:20,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:20,162 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-04 04:11:20,162 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash -936202175, now seen corresponding path program 6 times [2018-02-04 04:11:20,162 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:20,162 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:20,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:20,163 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:20,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:20,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 345 proven. 80 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-04 04:11:20,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:20,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:20,431 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:11:20,462 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 04:11:20,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:20,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 388 proven. 229 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-04 04:11:20,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:20,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 26 [2018-02-04 04:11:20,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:11:20,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:11:20,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:11:20,688 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 26 states. [2018-02-04 04:11:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:21,364 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2018-02-04 04:11:21,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:11:21,364 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 137 [2018-02-04 04:11:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:21,365 INFO L225 Difference]: With dead ends: 220 [2018-02-04 04:11:21,365 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 04:11:21,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:11:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 04:11:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 201. [2018-02-04 04:11:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 04:11:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 207 transitions. [2018-02-04 04:11:21,369 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 207 transitions. Word has length 137 [2018-02-04 04:11:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:21,369 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 207 transitions. [2018-02-04 04:11:21,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:11:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 207 transitions. [2018-02-04 04:11:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-04 04:11:21,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:21,371 INFO L351 BasicCegarLoop]: trace histogram [24, 20, 20, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:21,371 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:21,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1943695766, now seen corresponding path program 7 times [2018-02-04 04:11:21,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:21,372 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:21,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:21,372 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:21,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:21,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 905 proven. 44 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-02-04 04:11:21,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:21,529 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:21,530 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:21,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 694 proven. 52 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-02-04 04:11:21,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:21,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-02-04 04:11:21,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:11:21,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:11:21,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:11:21,680 INFO L87 Difference]: Start difference. First operand 201 states and 207 transitions. Second operand 25 states. [2018-02-04 04:11:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:22,157 INFO L93 Difference]: Finished difference Result 269 states and 274 transitions. [2018-02-04 04:11:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 04:11:22,157 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2018-02-04 04:11:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:22,159 INFO L225 Difference]: With dead ends: 269 [2018-02-04 04:11:22,159 INFO L226 Difference]: Without dead ends: 260 [2018-02-04 04:11:22,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=1684, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:11:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-04 04:11:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 249. [2018-02-04 04:11:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-04 04:11:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 254 transitions. [2018-02-04 04:11:22,165 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 254 transitions. Word has length 179 [2018-02-04 04:11:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:22,166 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 254 transitions. [2018-02-04 04:11:22,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:11:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 254 transitions. [2018-02-04 04:11:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 04:11:22,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:22,168 INFO L351 BasicCegarLoop]: trace histogram [31, 26, 26, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:22,168 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash -431804325, now seen corresponding path program 8 times [2018-02-04 04:11:22,169 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:22,169 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:22,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:22,170 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:22,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:22,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 1423 proven. 70 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-02-04 04:11:22,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:22,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:22,389 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:22,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:22,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:22,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 1423 proven. 70 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-02-04 04:11:22,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:22,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-02-04 04:11:22,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:11:22,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:11:22,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:11:22,541 INFO L87 Difference]: Start difference. First operand 249 states and 254 transitions. Second operand 20 states. [2018-02-04 04:11:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:22,706 INFO L93 Difference]: Finished difference Result 263 states and 266 transitions. [2018-02-04 04:11:22,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:11:22,706 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 227 [2018-02-04 04:11:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:22,707 INFO L225 Difference]: With dead ends: 263 [2018-02-04 04:11:22,707 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 04:11:22,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:11:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 04:11:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2018-02-04 04:11:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-04 04:11:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 252 transitions. [2018-02-04 04:11:22,711 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 252 transitions. Word has length 227 [2018-02-04 04:11:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:22,711 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 252 transitions. [2018-02-04 04:11:22,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:11:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 252 transitions. [2018-02-04 04:11:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 04:11:22,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:22,713 INFO L351 BasicCegarLoop]: trace histogram [32, 27, 27, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:22,713 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:22,713 INFO L82 PathProgramCache]: Analyzing trace with hash 944998563, now seen corresponding path program 9 times [2018-02-04 04:11:22,713 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:22,713 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:22,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:22,714 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:22,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:22,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 875 proven. 114 refuted. 0 times theorem prover too weak. 1480 trivial. 0 not checked. [2018-02-04 04:11:23,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:23,042 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:23,043 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:11:23,080 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 04:11:23,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:23,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:23,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:11:23,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:23,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:11:23,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:11:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 875 proven. 92 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2018-02-04 04:11:23,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:23,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-02-04 04:11:23,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:11:23,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:11:23,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:11:23,450 INFO L87 Difference]: Start difference. First operand 249 states and 252 transitions. Second operand 21 states. [2018-02-04 04:11:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:23,821 INFO L93 Difference]: Finished difference Result 326 states and 332 transitions. [2018-02-04 04:11:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:11:23,822 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 233 [2018-02-04 04:11:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:23,823 INFO L225 Difference]: With dead ends: 326 [2018-02-04 04:11:23,823 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 04:11:23,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 213 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:11:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 04:11:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 303. [2018-02-04 04:11:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 04:11:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 308 transitions. [2018-02-04 04:11:23,830 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 308 transitions. Word has length 233 [2018-02-04 04:11:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:23,830 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 308 transitions. [2018-02-04 04:11:23,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:11:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 308 transitions. [2018-02-04 04:11:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 04:11:23,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:23,833 INFO L351 BasicCegarLoop]: trace histogram [40, 34, 34, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:23,834 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash 733219996, now seen corresponding path program 10 times [2018-02-04 04:11:23,834 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:23,834 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:23,835 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:23,835 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:23,835 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:23,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 2257 proven. 102 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2018-02-04 04:11:24,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:24,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:24,082 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:11:24,109 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:11:24,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:24,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 2051 proven. 382 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 04:11:24,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:24,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2018-02-04 04:11:24,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 04:11:24,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 04:11:24,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:11:24,366 INFO L87 Difference]: Start difference. First operand 303 states and 308 transitions. Second operand 34 states. [2018-02-04 04:11:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:24,902 INFO L93 Difference]: Finished difference Result 325 states and 328 transitions. [2018-02-04 04:11:24,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:11:24,903 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 287 [2018-02-04 04:11:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:24,904 INFO L225 Difference]: With dead ends: 325 [2018-02-04 04:11:24,904 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 04:11:24,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=534, Invalid=3006, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:11:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 04:11:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 309. [2018-02-04 04:11:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-04 04:11:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2018-02-04 04:11:24,908 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 287 [2018-02-04 04:11:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:24,908 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 312 transitions. [2018-02-04 04:11:24,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 04:11:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 312 transitions. [2018-02-04 04:11:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-02-04 04:11:24,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:24,909 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-04 04:11:24,909 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:24,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1751572516, now seen corresponding path program 11 times [2018-02-04 04:11:24,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:24,909 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:24,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:24,910 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:24,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:24,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-02-04 04:11:25,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:25,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:25,344 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:11:25,579 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-02-04 04:11:25,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:25,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:25,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:11:25,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:25,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:11:25,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:11:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-02-04 04:11:26,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:26,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-02-04 04:11:26,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:11:26,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:11:26,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:11:26,176 INFO L87 Difference]: Start difference. First operand 309 states and 312 transitions. Second operand 24 states. [2018-02-04 04:11:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:26,527 INFO L93 Difference]: Finished difference Result 326 states and 330 transitions. [2018-02-04 04:11:26,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:11:26,528 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 293 [2018-02-04 04:11:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:26,529 INFO L225 Difference]: With dead ends: 326 [2018-02-04 04:11:26,529 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 04:11:26,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 270 SyntacticMatches, 12 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=766, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:11:26,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 04:11:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 315. [2018-02-04 04:11:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-04 04:11:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 319 transitions. [2018-02-04 04:11:26,533 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 319 transitions. Word has length 293 [2018-02-04 04:11:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:26,533 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 319 transitions. [2018-02-04 04:11:26,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:11:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 319 transitions. [2018-02-04 04:11:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-02-04 04:11:26,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:26,534 INFO L351 BasicCegarLoop]: trace histogram [42, 36, 36, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:26,534 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1671183124, now seen corresponding path program 12 times [2018-02-04 04:11:26,534 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:26,534 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:26,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:26,535 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:26,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:26,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1695 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-04 04:11:26,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:26,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:26,866 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:11:26,931 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-02-04 04:11:26,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:26,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:26,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:11:26,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:26,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:11:26,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:11:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1518 proven. 200 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-02-04 04:11:27,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:27,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2018-02-04 04:11:27,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 04:11:27,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 04:11:27,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:11:27,479 INFO L87 Difference]: Start difference. First operand 315 states and 319 transitions. Second operand 33 states. [2018-02-04 04:11:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:28,531 INFO L93 Difference]: Finished difference Result 400 states and 406 transitions. [2018-02-04 04:11:28,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:11:28,531 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 299 [2018-02-04 04:11:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:28,533 INFO L225 Difference]: With dead ends: 400 [2018-02-04 04:11:28,533 INFO L226 Difference]: Without dead ends: 400 [2018-02-04 04:11:28,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 277 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=854, Invalid=3702, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:11:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-02-04 04:11:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 381. [2018-02-04 04:11:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 04:11:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 387 transitions. [2018-02-04 04:11:28,537 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 387 transitions. Word has length 299 [2018-02-04 04:11:28,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:28,538 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 387 transitions. [2018-02-04 04:11:28,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 04:11:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 387 transitions. [2018-02-04 04:11:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-02-04 04:11:28,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:28,539 INFO L351 BasicCegarLoop]: trace histogram [51, 44, 44, 43, 43, 43, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:28,539 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:28,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1422188691, now seen corresponding path program 13 times [2018-02-04 04:11:28,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:28,539 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:28,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:28,540 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:28,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:28,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6493 backedges. 3575 proven. 140 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2018-02-04 04:11:28,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:29,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:29,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:29,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6493 backedges. 2371 proven. 154 refuted. 0 times theorem prover too weak. 3968 trivial. 0 not checked. [2018-02-04 04:11:29,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:29,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2018-02-04 04:11:29,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:11:29,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:11:29,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:11:29,602 INFO L87 Difference]: Start difference. First operand 381 states and 387 transitions. Second operand 37 states. [2018-02-04 04:11:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:30,483 INFO L93 Difference]: Finished difference Result 467 states and 472 transitions. [2018-02-04 04:11:30,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 04:11:30,483 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 359 [2018-02-04 04:11:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:30,484 INFO L225 Difference]: With dead ends: 467 [2018-02-04 04:11:30,484 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 04:11:30,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=529, Invalid=3503, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 04:11:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 04:11:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 447. [2018-02-04 04:11:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-02-04 04:11:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 452 transitions. [2018-02-04 04:11:30,495 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 452 transitions. Word has length 359 [2018-02-04 04:11:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:30,495 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 452 transitions. [2018-02-04 04:11:30,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:11:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 452 transitions. [2018-02-04 04:11:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-02-04 04:11:30,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:30,497 INFO L351 BasicCegarLoop]: trace histogram [61, 53, 53, 52, 52, 52, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:30,497 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1961864906, now seen corresponding path program 14 times [2018-02-04 04:11:30,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:30,497 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:30,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:30,498 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:30,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:30,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 4759 proven. 184 refuted. 0 times theorem prover too weak. 4445 trivial. 0 not checked. [2018-02-04 04:11:30,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:30,965 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:30,966 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:31,003 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:31,003 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:31,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:31,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:11:31,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:31,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:11:31,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:11:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 2662 proven. 218 refuted. 0 times theorem prover too weak. 6508 trivial. 0 not checked. [2018-02-04 04:11:31,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:31,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 35 [2018-02-04 04:11:31,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:11:31,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:11:31,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:11:31,700 INFO L87 Difference]: Start difference. First operand 447 states and 452 transitions. Second operand 35 states. [2018-02-04 04:11:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:33,350 INFO L93 Difference]: Finished difference Result 536 states and 540 transitions. [2018-02-04 04:11:33,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 04:11:33,352 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 425 [2018-02-04 04:11:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:33,354 INFO L225 Difference]: With dead ends: 536 [2018-02-04 04:11:33,354 INFO L226 Difference]: Without dead ends: 527 [2018-02-04 04:11:33,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 406 SyntacticMatches, 15 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4265 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1855, Invalid=8651, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 04:11:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-04 04:11:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 513. [2018-02-04 04:11:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-02-04 04:11:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 517 transitions. [2018-02-04 04:11:33,364 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 517 transitions. Word has length 425 [2018-02-04 04:11:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:33,364 INFO L432 AbstractCegarLoop]: Abstraction has 513 states and 517 transitions. [2018-02-04 04:11:33,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:11:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 517 transitions. [2018-02-04 04:11:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-02-04 04:11:33,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:33,368 INFO L351 BasicCegarLoop]: trace histogram [72, 63, 63, 62, 62, 62, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:33,368 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 439171591, now seen corresponding path program 15 times [2018-02-04 04:11:33,368 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:33,368 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:33,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:33,369 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:33,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:33,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13205 backedges. 3263 proven. 252 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-04 04:11:34,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:34,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:34,295 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:11:34,382 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 04:11:34,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:34,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:34,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:11:34,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:34,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:11:34,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:11:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13205 backedges. 3263 proven. 252 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-04 04:11:34,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:34,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 16 [2018-02-04 04:11:34,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:11:34,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:11:34,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:11:34,874 INFO L87 Difference]: Start difference. First operand 513 states and 517 transitions. Second operand 17 states. [2018-02-04 04:11:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:35,130 INFO L93 Difference]: Finished difference Result 543 states and 549 transitions. [2018-02-04 04:11:35,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:11:35,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 497 [2018-02-04 04:11:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:35,132 INFO L225 Difference]: With dead ends: 543 [2018-02-04 04:11:35,132 INFO L226 Difference]: Without dead ends: 543 [2018-02-04 04:11:35,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 475 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=449, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:11:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-04 04:11:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 519. [2018-02-04 04:11:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-04 04:11:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 524 transitions. [2018-02-04 04:11:35,137 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 524 transitions. Word has length 497 [2018-02-04 04:11:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:35,138 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 524 transitions. [2018-02-04 04:11:35,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:11:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 524 transitions. [2018-02-04 04:11:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-02-04 04:11:35,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:35,141 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-04 04:11:35,141 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1416226959, now seen corresponding path program 16 times [2018-02-04 04:11:35,141 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:35,142 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:35,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:35,142 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:35,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:35,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:36,040 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-04 04:11:36,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:36,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:36,041 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:11:36,079 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:11:36,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:36,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 6029 proven. 814 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 04:11:36,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:36,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27] total 41 [2018-02-04 04:11:36,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:11:36,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:11:36,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1402, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:11:36,572 INFO L87 Difference]: Start difference. First operand 519 states and 524 transitions. Second operand 41 states. [2018-02-04 04:11:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:37,935 INFO L93 Difference]: Finished difference Result 625 states and 632 transitions. [2018-02-04 04:11:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 04:11:37,935 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 503 [2018-02-04 04:11:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:37,936 INFO L225 Difference]: With dead ends: 625 [2018-02-04 04:11:37,936 INFO L226 Difference]: Without dead ends: 625 [2018-02-04 04:11:37,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1180, Invalid=4982, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 04:11:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-02-04 04:11:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 537. [2018-02-04 04:11:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-02-04 04:11:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 543 transitions. [2018-02-04 04:11:37,942 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 543 transitions. Word has length 503 [2018-02-04 04:11:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:37,943 INFO L432 AbstractCegarLoop]: Abstraction has 537 states and 543 transitions. [2018-02-04 04:11:37,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:11:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 543 transitions. [2018-02-04 04:11:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-02-04 04:11:37,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:37,945 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-04 04:11:37,945 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash 874224735, now seen corresponding path program 17 times [2018-02-04 04:11:37,946 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:37,946 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:37,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:37,946 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:37,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:37,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4005 proven. 374 refuted. 0 times theorem prover too weak. 10026 trivial. 0 not checked. [2018-02-04 04:11:38,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:38,737 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:38,737 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:11:39,302 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-02-04 04:11:39,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:39,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4351 proven. 1714 refuted. 0 times theorem prover too weak. 8340 trivial. 0 not checked. [2018-02-04 04:11:39,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:39,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 30] total 45 [2018-02-04 04:11:39,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 04:11:39,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 04:11:39,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:11:39,950 INFO L87 Difference]: Start difference. First operand 537 states and 543 transitions. Second operand 45 states. [2018-02-04 04:11:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:41,333 INFO L93 Difference]: Finished difference Result 756 states and 773 transitions. [2018-02-04 04:11:41,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 04:11:41,334 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 515 [2018-02-04 04:11:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:41,335 INFO L225 Difference]: With dead ends: 756 [2018-02-04 04:11:41,336 INFO L226 Difference]: Without dead ends: 756 [2018-02-04 04:11:41,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1171, Invalid=6311, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 04:11:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-04 04:11:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 738. [2018-02-04 04:11:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-02-04 04:11:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 755 transitions. [2018-02-04 04:11:41,345 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 755 transitions. Word has length 515 [2018-02-04 04:11:41,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:41,346 INFO L432 AbstractCegarLoop]: Abstraction has 738 states and 755 transitions. [2018-02-04 04:11:41,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 04:11:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 755 transitions. [2018-02-04 04:11:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-02-04 04:11:41,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:41,349 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-04 04:11:41,349 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash -19559249, now seen corresponding path program 18 times [2018-02-04 04:11:41,349 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:41,349 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:41,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:41,350 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:41,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:41,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15235 backedges. 4758 proven. 1581 refuted. 0 times theorem prover too weak. 8896 trivial. 0 not checked. [2018-02-04 04:11:41,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:41,683 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:41,683 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:11:41,737 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-02-04 04:11:41,737 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:41,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15235 backedges. 4385 proven. 40 refuted. 0 times theorem prover too weak. 10810 trivial. 0 not checked. [2018-02-04 04:11:42,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:42,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-02-04 04:11:42,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:11:42,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:11:42,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:11:42,023 INFO L87 Difference]: Start difference. First operand 738 states and 755 transitions. Second operand 18 states. [2018-02-04 04:11:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:42,132 INFO L93 Difference]: Finished difference Result 711 states and 722 transitions. [2018-02-04 04:11:42,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:11:42,133 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 527 [2018-02-04 04:11:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:42,134 INFO L225 Difference]: With dead ends: 711 [2018-02-04 04:11:42,134 INFO L226 Difference]: Without dead ends: 702 [2018-02-04 04:11:42,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:11:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-02-04 04:11:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 699. [2018-02-04 04:11:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-02-04 04:11:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 710 transitions. [2018-02-04 04:11:42,142 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 710 transitions. Word has length 527 [2018-02-04 04:11:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:42,142 INFO L432 AbstractCegarLoop]: Abstraction has 699 states and 710 transitions. [2018-02-04 04:11:42,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:11:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 710 transitions. [2018-02-04 04:11:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-02-04 04:11:42,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:42,145 INFO L351 BasicCegarLoop]: trace histogram [86, 76, 76, 75, 75, 75, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:42,145 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 660674672, now seen corresponding path program 19 times [2018-02-04 04:11:42,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:42,146 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:42,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:42,146 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:42,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:42,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 19060 backedges. 8010 proven. 817 refuted. 0 times theorem prover too weak. 10233 trivial. 0 not checked. [2018-02-04 04:11:42,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:42,785 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:42,786 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:42,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 19060 backedges. 10743 proven. 234 refuted. 0 times theorem prover too weak. 8083 trivial. 0 not checked. [2018-02-04 04:11:43,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:43,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-02-04 04:11:43,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 04:11:43,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 04:11:43,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:11:43,085 INFO L87 Difference]: Start difference. First operand 699 states and 710 transitions. Second operand 32 states. [2018-02-04 04:11:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:43,397 INFO L93 Difference]: Finished difference Result 621 states and 626 transitions. [2018-02-04 04:11:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:11:43,397 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 587 [2018-02-04 04:11:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:43,398 INFO L225 Difference]: With dead ends: 621 [2018-02-04 04:11:43,399 INFO L226 Difference]: Without dead ends: 612 [2018-02-04 04:11:43,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=375, Invalid=1185, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 04:11:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-02-04 04:11:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2018-02-04 04:11:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-02-04 04:11:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 614 transitions. [2018-02-04 04:11:43,404 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 614 transitions. Word has length 587 [2018-02-04 04:11:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:43,404 INFO L432 AbstractCegarLoop]: Abstraction has 609 states and 614 transitions. [2018-02-04 04:11:43,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 04:11:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 614 transitions. [2018-02-04 04:11:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-02-04 04:11:43,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:43,407 INFO L351 BasicCegarLoop]: trace histogram [87, 77, 77, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:43,407 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1350141368, now seen corresponding path program 20 times [2018-02-04 04:11:43,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:43,407 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:43,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:43,407 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:11:43,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:43,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 19534 backedges. 9017 proven. 290 refuted. 0 times theorem prover too weak. 10227 trivial. 0 not checked. [2018-02-04 04:11:44,485 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:44,485 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:44,486 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:11:44,519 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:11:44,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:44,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:44,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:11:44,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:44,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:11:44,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:11:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19534 backedges. 5134 proven. 334 refuted. 0 times theorem prover too weak. 14066 trivial. 0 not checked. [2018-02-04 04:11:45,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:45,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 41 [2018-02-04 04:11:45,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:11:45,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:11:45,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:11:45,911 INFO L87 Difference]: Start difference. First operand 609 states and 614 transitions. Second operand 41 states. [2018-02-04 04:11:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:47,684 INFO L93 Difference]: Finished difference Result 709 states and 714 transitions. [2018-02-04 04:11:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-02-04 04:11:47,684 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 593 [2018-02-04 04:11:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:47,686 INFO L225 Difference]: With dead ends: 709 [2018-02-04 04:11:47,686 INFO L226 Difference]: Without dead ends: 700 [2018-02-04 04:11:47,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 570 SyntacticMatches, 19 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6549 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2682, Invalid=12818, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 04:11:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-02-04 04:11:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 687. [2018-02-04 04:11:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-02-04 04:11:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 691 transitions. [2018-02-04 04:11:47,696 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 691 transitions. Word has length 593 [2018-02-04 04:11:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:47,697 INFO L432 AbstractCegarLoop]: Abstraction has 687 states and 691 transitions. [2018-02-04 04:11:47,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:11:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 691 transitions. [2018-02-04 04:11:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-02-04 04:11:47,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:47,701 INFO L351 BasicCegarLoop]: trace histogram [100, 89, 89, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:47,701 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1742682151, now seen corresponding path program 21 times [2018-02-04 04:11:47,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:47,702 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:47,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:47,703 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:47,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:47,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 14286 proven. 1218 refuted. 0 times theorem prover too weak. 10489 trivial. 0 not checked. [2018-02-04 04:11:49,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:49,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:49,028 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:11:49,090 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-02-04 04:11:49,090 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:49,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:49,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:11:49,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:11:49,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:11:49,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:11:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 6073 proven. 444 refuted. 0 times theorem prover too weak. 19476 trivial. 0 not checked. [2018-02-04 04:11:50,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:50,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 47 [2018-02-04 04:11:50,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 04:11:50,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 04:11:50,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:11:50,122 INFO L87 Difference]: Start difference. First operand 687 states and 691 transitions. Second operand 47 states. [2018-02-04 04:11:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:51,938 INFO L93 Difference]: Finished difference Result 726 states and 731 transitions. [2018-02-04 04:11:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 04:11:51,938 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 677 [2018-02-04 04:11:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:51,940 INFO L225 Difference]: With dead ends: 726 [2018-02-04 04:11:51,940 INFO L226 Difference]: Without dead ends: 720 [2018-02-04 04:11:51,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 641 SyntacticMatches, 21 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1296, Invalid=5844, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 04:11:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-02-04 04:11:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 699. [2018-02-04 04:11:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-02-04 04:11:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 703 transitions. [2018-02-04 04:11:51,948 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 703 transitions. Word has length 677 [2018-02-04 04:11:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:51,948 INFO L432 AbstractCegarLoop]: Abstraction has 699 states and 703 transitions. [2018-02-04 04:11:51,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 04:11:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 703 transitions. [2018-02-04 04:11:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-02-04 04:11:51,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:51,953 INFO L351 BasicCegarLoop]: trace histogram [102, 91, 91, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:51,953 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:51,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1048265559, now seen corresponding path program 22 times [2018-02-04 04:11:51,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:51,954 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:51,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:51,954 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:51,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:51,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 7115 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-04 04:11:52,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:52,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:52,882 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:11:52,912 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:11:52,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:52,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 10276 proven. 2109 refuted. 0 times theorem prover too weak. 14722 trivial. 0 not checked. [2018-02-04 04:11:53,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:53,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 57 [2018-02-04 04:11:53,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 04:11:53,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 04:11:53,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=2647, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 04:11:53,576 INFO L87 Difference]: Start difference. First operand 699 states and 703 transitions. Second operand 57 states. [2018-02-04 04:11:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:54,710 INFO L93 Difference]: Finished difference Result 806 states and 811 transitions. [2018-02-04 04:11:54,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 04:11:54,710 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 689 [2018-02-04 04:11:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:54,712 INFO L225 Difference]: With dead ends: 806 [2018-02-04 04:11:54,712 INFO L226 Difference]: Without dead ends: 806 [2018-02-04 04:11:54,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1559, Invalid=6997, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 04:11:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-02-04 04:11:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 795. [2018-02-04 04:11:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-02-04 04:11:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 800 transitions. [2018-02-04 04:11:54,721 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 800 transitions. Word has length 689 [2018-02-04 04:11:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:54,721 INFO L432 AbstractCegarLoop]: Abstraction has 795 states and 800 transitions. [2018-02-04 04:11:54,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 04:11:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 800 transitions. [2018-02-04 04:11:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-02-04 04:11:54,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:54,727 INFO L351 BasicCegarLoop]: trace histogram [115, 103, 103, 102, 102, 102, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:54,727 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1462874826, now seen corresponding path program 23 times [2018-02-04 04:11:54,728 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:54,728 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:54,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:54,729 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:54,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:54,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:11:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 34638 backedges. 17188 proven. 2197 refuted. 0 times theorem prover too weak. 15253 trivial. 0 not checked. [2018-02-04 04:11:55,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:11:55,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:11:55,991 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:11:56,569 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2018-02-04 04:11:56,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:11:56,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:11:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 34638 backedges. 14263 proven. 5159 refuted. 0 times theorem prover too weak. 15216 trivial. 0 not checked. [2018-02-04 04:11:57,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:11:57,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 59 [2018-02-04 04:11:57,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 04:11:57,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 04:11:57,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=2914, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:11:57,285 INFO L87 Difference]: Start difference. First operand 795 states and 800 transitions. Second operand 59 states. [2018-02-04 04:11:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:11:59,064 INFO L93 Difference]: Finished difference Result 809 states and 812 transitions. [2018-02-04 04:11:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 04:11:59,064 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 773 [2018-02-04 04:11:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:11:59,065 INFO L225 Difference]: With dead ends: 809 [2018-02-04 04:11:59,065 INFO L226 Difference]: Without dead ends: 803 [2018-02-04 04:11:59,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3847 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2257, Invalid=11315, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 04:11:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-02-04 04:11:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 795. [2018-02-04 04:11:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-02-04 04:11:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 798 transitions. [2018-02-04 04:11:59,076 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 798 transitions. Word has length 773 [2018-02-04 04:11:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:11:59,077 INFO L432 AbstractCegarLoop]: Abstraction has 795 states and 798 transitions. [2018-02-04 04:11:59,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 04:11:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 798 transitions. [2018-02-04 04:11:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-02-04 04:11:59,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:11:59,083 INFO L351 BasicCegarLoop]: trace histogram [116, 104, 104, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:11:59,083 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:11:59,084 INFO L82 PathProgramCache]: Analyzing trace with hash 861490130, now seen corresponding path program 24 times [2018-02-04 04:11:59,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:11:59,084 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:11:59,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:59,084 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:11:59,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:11:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:11:59,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 35278 backedges. 7728 proven. 520 refuted. 0 times theorem prover too weak. 27030 trivial. 0 not checked. [2018-02-04 04:12:00,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:00,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:00,181 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:12:00,425 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 04:12:00,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:00,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:00,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:12:00,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:12:00,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:12:00,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:12:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 35278 backedges. 7728 proven. 470 refuted. 0 times theorem prover too weak. 27080 trivial. 0 not checked. [2018-02-04 04:12:01,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:01,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 34 [2018-02-04 04:12:01,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:12:01,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:12:01,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=906, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:12:01,635 INFO L87 Difference]: Start difference. First operand 795 states and 798 transitions. Second operand 35 states. [2018-02-04 04:12:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:02,618 INFO L93 Difference]: Finished difference Result 914 states and 920 transitions. [2018-02-04 04:12:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 04:12:02,619 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 779 [2018-02-04 04:12:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:02,620 INFO L225 Difference]: With dead ends: 914 [2018-02-04 04:12:02,620 INFO L226 Difference]: Without dead ends: 914 [2018-02-04 04:12:02,621 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 738 SyntacticMatches, 25 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1013, Invalid=3277, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 04:12:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-02-04 04:12:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 891. [2018-02-04 04:12:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-02-04 04:12:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 896 transitions. [2018-02-04 04:12:02,627 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 896 transitions. Word has length 779 [2018-02-04 04:12:02,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:02,628 INFO L432 AbstractCegarLoop]: Abstraction has 891 states and 896 transitions. [2018-02-04 04:12:02,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:12:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 896 transitions. [2018-02-04 04:12:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2018-02-04 04:12:02,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:02,635 INFO L351 BasicCegarLoop]: trace histogram [131, 118, 118, 117, 117, 117, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:02,635 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1790043837, now seen corresponding path program 25 times [2018-02-04 04:12:02,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:02,636 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:02,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:02,637 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:02,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:02,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 20572 proven. 3250 refuted. 0 times theorem prover too weak. 21431 trivial. 0 not checked. [2018-02-04 04:12:04,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:04,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:04,115 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:12:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:04,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 20601 proven. 3221 refuted. 0 times theorem prover too weak. 21431 trivial. 0 not checked. [2018-02-04 04:12:04,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:04,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 59 [2018-02-04 04:12:04,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 04:12:04,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 04:12:04,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2814, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:12:04,922 INFO L87 Difference]: Start difference. First operand 891 states and 896 transitions. Second operand 59 states. [2018-02-04 04:12:05,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:05,852 INFO L93 Difference]: Finished difference Result 915 states and 919 transitions. [2018-02-04 04:12:05,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 04:12:05,853 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 875 [2018-02-04 04:12:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:05,855 INFO L225 Difference]: With dead ends: 915 [2018-02-04 04:12:05,855 INFO L226 Difference]: Without dead ends: 909 [2018-02-04 04:12:05,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1902, Invalid=7410, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 04:12:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-02-04 04:12:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 897. [2018-02-04 04:12:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-02-04 04:12:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 901 transitions. [2018-02-04 04:12:05,862 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 901 transitions. Word has length 875 [2018-02-04 04:12:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:05,863 INFO L432 AbstractCegarLoop]: Abstraction has 897 states and 901 transitions. [2018-02-04 04:12:05,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 04:12:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 901 transitions. [2018-02-04 04:12:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2018-02-04 04:12:05,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:05,867 INFO L351 BasicCegarLoop]: trace histogram [132, 119, 119, 118, 118, 118, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:05,867 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1944476789, now seen corresponding path program 26 times [2018-02-04 04:12:05,868 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:05,868 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:05,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:05,869 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:12:05,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:05,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 45985 backedges. 9555 proven. 602 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-02-04 04:12:07,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:07,277 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:07,277 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:12:07,322 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:12:07,322 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:07,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:07,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:12:07,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:12:07,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:12:07,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:12:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 45985 backedges. 9555 proven. 602 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-02-04 04:12:08,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:08,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2018-02-04 04:12:08,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:12:08,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:12:08,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=280, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:12:08,314 INFO L87 Difference]: Start difference. First operand 897 states and 901 transitions. Second operand 22 states. [2018-02-04 04:12:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:08,641 INFO L93 Difference]: Finished difference Result 927 states and 933 transitions. [2018-02-04 04:12:08,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:12:08,642 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 881 [2018-02-04 04:12:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:08,644 INFO L225 Difference]: With dead ends: 927 [2018-02-04 04:12:08,644 INFO L226 Difference]: Without dead ends: 927 [2018-02-04 04:12:08,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 851 SyntacticMatches, 28 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=483, Invalid=849, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:12:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-02-04 04:12:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 903. [2018-02-04 04:12:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-02-04 04:12:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 908 transitions. [2018-02-04 04:12:08,650 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 908 transitions. Word has length 881 [2018-02-04 04:12:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:08,651 INFO L432 AbstractCegarLoop]: Abstraction has 903 states and 908 transitions. [2018-02-04 04:12:08,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:12:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 908 transitions. [2018-02-04 04:12:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2018-02-04 04:12:08,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:08,655 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-04 04:12:08,655 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:08,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1515855635, now seen corresponding path program 27 times [2018-02-04 04:12:08,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:08,656 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:08,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:08,656 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:08,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:08,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 10851 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-04 04:12:09,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:09,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:09,989 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:12:10,074 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 04:12:10,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:10,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 17787 proven. 1894 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-04 04:12:10,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:10,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 70 [2018-02-04 04:12:10,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 04:12:10,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 04:12:10,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=4097, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 04:12:10,993 INFO L87 Difference]: Start difference. First operand 903 states and 908 transitions. Second operand 70 states. [2018-02-04 04:12:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:12,884 INFO L93 Difference]: Finished difference Result 1021 states and 1026 transitions. [2018-02-04 04:12:12,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 04:12:12,884 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 887 [2018-02-04 04:12:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:12,887 INFO L225 Difference]: With dead ends: 1021 [2018-02-04 04:12:12,887 INFO L226 Difference]: Without dead ends: 1021 [2018-02-04 04:12:12,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4074 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2460, Invalid=13542, Unknown=0, NotChecked=0, Total=16002 [2018-02-04 04:12:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-02-04 04:12:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1011. [2018-02-04 04:12:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-02-04 04:12:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1016 transitions. [2018-02-04 04:12:12,895 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1016 transitions. Word has length 887 [2018-02-04 04:12:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:12,896 INFO L432 AbstractCegarLoop]: Abstraction has 1011 states and 1016 transitions. [2018-02-04 04:12:12,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 04:12:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1016 transitions. [2018-02-04 04:12:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-02-04 04:12:12,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:12,901 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-04 04:12:12,901 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:12,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1557282124, now seen corresponding path program 28 times [2018-02-04 04:12:12,901 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:12,901 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:12,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:12,902 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:12,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:12,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 11648 proven. 690 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-04 04:12:14,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:14,599 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:14,600 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:12:15,081 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:12:15,081 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:15,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:15,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:12:15,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:12:15,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:12:15,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:12:15,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 04:12:15,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:12:15,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 04:12:15,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-02-04 04:12:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 25212 proven. 7364 refuted. 0 times theorem prover too weak. 26368 trivial. 0 not checked. [2018-02-04 04:12:17,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:17,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 47] total 65 [2018-02-04 04:12:17,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 04:12:17,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 04:12:17,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3812, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 04:12:17,414 INFO L87 Difference]: Start difference. First operand 1011 states and 1016 transitions. Second operand 66 states. [2018-02-04 04:12:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:21,012 INFO L93 Difference]: Finished difference Result 1030 states and 1035 transitions. [2018-02-04 04:12:21,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 04:12:21,013 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 989 [2018-02-04 04:12:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:21,015 INFO L225 Difference]: With dead ends: 1030 [2018-02-04 04:12:21,015 INFO L226 Difference]: Without dead ends: 1027 [2018-02-04 04:12:21,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 917 SyntacticMatches, 28 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4585 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1997, Invalid=15559, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 04:12:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-02-04 04:12:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1014. [2018-02-04 04:12:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 04:12:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1019 transitions. [2018-02-04 04:12:21,025 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1019 transitions. Word has length 989 [2018-02-04 04:12:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:21,026 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1019 transitions. [2018-02-04 04:12:21,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 04:12:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1019 transitions. [2018-02-04 04:12:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-02-04 04:12:21,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:21,032 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-04 04:12:21,032 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1007592468, now seen corresponding path program 29 times [2018-02-04 04:12:21,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:21,032 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:21,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:21,033 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:21,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:21,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:22,797 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-04 04:12:22,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:22,798 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:22,798 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:12:23,603 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-02-04 04:12:23,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:23,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 59780 backedges. 15400 proven. 5549 refuted. 0 times theorem prover too weak. 38831 trivial. 0 not checked. [2018-02-04 04:12:24,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:24,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 40] total 60 [2018-02-04 04:12:24,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 04:12:24,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 04:12:24,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=3055, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:12:24,701 INFO L87 Difference]: Start difference. First operand 1014 states and 1019 transitions. Second operand 60 states. [2018-02-04 04:12:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:26,628 INFO L93 Difference]: Finished difference Result 1254 states and 1262 transitions. [2018-02-04 04:12:26,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 04:12:26,629 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 995 [2018-02-04 04:12:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:26,631 INFO L225 Difference]: With dead ends: 1254 [2018-02-04 04:12:26,631 INFO L226 Difference]: Without dead ends: 1254 [2018-02-04 04:12:26,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 957 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2252, Invalid=11320, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 04:12:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2018-02-04 04:12:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1233. [2018-02-04 04:12:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-02-04 04:12:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1241 transitions. [2018-02-04 04:12:26,639 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1241 transitions. Word has length 995 [2018-02-04 04:12:26,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:26,639 INFO L432 AbstractCegarLoop]: Abstraction has 1233 states and 1241 transitions. [2018-02-04 04:12:26,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 04:12:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1241 transitions. [2018-02-04 04:12:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-02-04 04:12:26,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:26,645 INFO L351 BasicCegarLoop]: trace histogram [167, 152, 152, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:26,645 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1753664213, now seen corresponding path program 30 times [2018-02-04 04:12:26,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:26,645 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:26,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:26,646 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:26,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:26,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 29764 proven. 5578 refuted. 0 times theorem prover too weak. 39107 trivial. 0 not checked. [2018-02-04 04:12:28,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:28,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:28,871 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:12:29,215 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-02-04 04:12:29,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:29,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:29,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:12:29,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:12:29,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:12:29,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:12:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 16955 proven. 6656 refuted. 0 times theorem prover too weak. 50838 trivial. 0 not checked. [2018-02-04 04:12:31,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:31,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 27] total 64 [2018-02-04 04:12:31,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 04:12:31,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 04:12:31,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=3479, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 04:12:31,427 INFO L87 Difference]: Start difference. First operand 1233 states and 1241 transitions. Second operand 64 states. [2018-02-04 04:12:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:34,340 INFO L93 Difference]: Finished difference Result 1270 states and 1276 transitions. [2018-02-04 04:12:34,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 04:12:34,340 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1103 [2018-02-04 04:12:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:34,343 INFO L225 Difference]: With dead ends: 1270 [2018-02-04 04:12:34,343 INFO L226 Difference]: Without dead ends: 1252 [2018-02-04 04:12:34,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1230 GetRequests, 1051 SyntacticMatches, 28 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3249, Invalid=20007, Unknown=0, NotChecked=0, Total=23256 [2018-02-04 04:12:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-02-04 04:12:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1233. [2018-02-04 04:12:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-02-04 04:12:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1238 transitions. [2018-02-04 04:12:34,350 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1238 transitions. Word has length 1103 [2018-02-04 04:12:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:34,351 INFO L432 AbstractCegarLoop]: Abstraction has 1233 states and 1238 transitions. [2018-02-04 04:12:34,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 04:12:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1238 transitions. [2018-02-04 04:12:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2018-02-04 04:12:34,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:34,357 INFO L351 BasicCegarLoop]: trace histogram [185, 169, 169, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:34,357 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:34,358 INFO L82 PathProgramCache]: Analyzing trace with hash -230054690, now seen corresponding path program 31 times [2018-02-04 04:12:34,358 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:34,358 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:34,358 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:34,358 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:34,358 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:34,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 33976 proven. 6853 refuted. 0 times theorem prover too weak. 50939 trivial. 0 not checked. [2018-02-04 04:12:37,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:37,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:37,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:12:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:37,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 34005 proven. 6824 refuted. 0 times theorem prover too weak. 50939 trivial. 0 not checked. [2018-02-04 04:12:38,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:38,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 68 [2018-02-04 04:12:38,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 04:12:38,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 04:12:38,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=3774, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:12:38,073 INFO L87 Difference]: Start difference. First operand 1233 states and 1238 transitions. Second operand 68 states. [2018-02-04 04:12:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:39,147 INFO L93 Difference]: Finished difference Result 1257 states and 1261 transitions. [2018-02-04 04:12:39,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 04:12:39,148 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 1217 [2018-02-04 04:12:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:39,150 INFO L225 Difference]: With dead ends: 1257 [2018-02-04 04:12:39,150 INFO L226 Difference]: Without dead ends: 1251 [2018-02-04 04:12:39,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1301 GetRequests, 1191 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2529, Invalid=9903, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 04:12:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-02-04 04:12:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1239. [2018-02-04 04:12:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-02-04 04:12:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1243 transitions. [2018-02-04 04:12:39,157 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1243 transitions. Word has length 1217 [2018-02-04 04:12:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:39,157 INFO L432 AbstractCegarLoop]: Abstraction has 1239 states and 1243 transitions. [2018-02-04 04:12:39,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 04:12:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1243 transitions. [2018-02-04 04:12:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2018-02-04 04:12:39,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:39,164 INFO L351 BasicCegarLoop]: trace histogram [186, 170, 170, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:39,164 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:39,164 INFO L82 PathProgramCache]: Analyzing trace with hash -929947930, now seen corresponding path program 32 times [2018-02-04 04:12:39,164 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:39,164 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:39,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:39,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:12:39,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:39,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 92812 backedges. 16704 proven. 884 refuted. 0 times theorem prover too weak. 75224 trivial. 0 not checked. [2018-02-04 04:12:41,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:41,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:41,726 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:12:41,784 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:12:41,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:41,794 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:41,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:12:41,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:12:41,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:12:41,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:12:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 92812 backedges. 16704 proven. 884 refuted. 0 times theorem prover too weak. 75224 trivial. 0 not checked. [2018-02-04 04:12:43,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:43,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 24 [2018-02-04 04:12:43,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:12:43,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:12:43,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=358, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:12:43,454 INFO L87 Difference]: Start difference. First operand 1239 states and 1243 transitions. Second operand 25 states. [2018-02-04 04:12:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:43,856 INFO L93 Difference]: Finished difference Result 1269 states and 1275 transitions. [2018-02-04 04:12:43,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:12:43,856 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1223 [2018-02-04 04:12:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:43,858 INFO L225 Difference]: With dead ends: 1269 [2018-02-04 04:12:43,859 INFO L226 Difference]: Without dead ends: 1269 [2018-02-04 04:12:43,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1262 GetRequests, 1187 SyntacticMatches, 34 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=657, Invalid=1149, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 04:12:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2018-02-04 04:12:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1245. [2018-02-04 04:12:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2018-02-04 04:12:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1250 transitions. [2018-02-04 04:12:43,866 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1250 transitions. Word has length 1223 [2018-02-04 04:12:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:43,866 INFO L432 AbstractCegarLoop]: Abstraction has 1245 states and 1250 transitions. [2018-02-04 04:12:43,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:12:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1250 transitions. [2018-02-04 04:12:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2018-02-04 04:12:43,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:43,873 INFO L351 BasicCegarLoop]: trace histogram [187, 171, 171, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:43,873 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -920557010, now seen corresponding path program 33 times [2018-02-04 04:12:43,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:43,874 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:43,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:43,874 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:43,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:43,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 18585 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-02-04 04:12:46,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:46,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:46,568 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:12:46,689 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-02-04 04:12:46,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:46,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:46,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:12:46,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:12:46,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:12:46,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:12:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 28174 proven. 4327 refuted. 0 times theorem prover too weak. 61361 trivial. 0 not checked. [2018-02-04 04:12:49,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:49,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 28] total 67 [2018-02-04 04:12:49,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 04:12:49,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 04:12:49,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3806, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 04:12:49,401 INFO L87 Difference]: Start difference. First operand 1245 states and 1250 transitions. Second operand 67 states. [2018-02-04 04:12:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:52,340 INFO L93 Difference]: Finished difference Result 1385 states and 1391 transitions. [2018-02-04 04:12:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-02-04 04:12:52,340 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1229 [2018-02-04 04:12:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:52,343 INFO L225 Difference]: With dead ends: 1385 [2018-02-04 04:12:52,343 INFO L226 Difference]: Without dead ends: 1385 [2018-02-04 04:12:52,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1335 GetRequests, 1173 SyntacticMatches, 30 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5497 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3028, Invalid=14794, Unknown=0, NotChecked=0, Total=17822 [2018-02-04 04:12:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2018-02-04 04:12:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1371. [2018-02-04 04:12:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2018-02-04 04:12:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1377 transitions. [2018-02-04 04:12:52,353 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1377 transitions. Word has length 1229 [2018-02-04 04:12:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:52,353 INFO L432 AbstractCegarLoop]: Abstraction has 1371 states and 1377 transitions. [2018-02-04 04:12:52,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 04:12:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1377 transitions. [2018-02-04 04:12:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1344 [2018-02-04 04:12:52,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:52,361 INFO L351 BasicCegarLoop]: trace histogram [205, 188, 188, 187, 187, 187, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:52,361 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:52,362 INFO L82 PathProgramCache]: Analyzing trace with hash -710434185, now seen corresponding path program 34 times [2018-02-04 04:12:52,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:52,362 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:52,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:52,362 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:52,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:52,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:12:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 113203 backedges. 39648 proven. 8202 refuted. 0 times theorem prover too weak. 65353 trivial. 0 not checked. [2018-02-04 04:12:55,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:12:55,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:12:55,824 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:12:55,898 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:12:55,898 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:12:55,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:12:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 113203 backedges. 35205 proven. 2758 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-04 04:12:57,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:12:57,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43] total 82 [2018-02-04 04:12:57,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-02-04 04:12:57,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-02-04 04:12:57,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=911, Invalid=5731, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 04:12:57,111 INFO L87 Difference]: Start difference. First operand 1371 states and 1377 transitions. Second operand 82 states. [2018-02-04 04:12:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:12:59,416 INFO L93 Difference]: Finished difference Result 1513 states and 1517 transitions. [2018-02-04 04:12:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-02-04 04:12:59,416 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 1343 [2018-02-04 04:12:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:12:59,419 INFO L225 Difference]: With dead ends: 1513 [2018-02-04 04:12:59,419 INFO L226 Difference]: Without dead ends: 1504 [2018-02-04 04:12:59,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1468 GetRequests, 1305 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8972 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3880, Invalid=23180, Unknown=0, NotChecked=0, Total=27060 [2018-02-04 04:12:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2018-02-04 04:12:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1371. [2018-02-04 04:12:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2018-02-04 04:12:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1375 transitions. [2018-02-04 04:12:59,430 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1375 transitions. Word has length 1343 [2018-02-04 04:12:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:12:59,430 INFO L432 AbstractCegarLoop]: Abstraction has 1371 states and 1375 transitions. [2018-02-04 04:12:59,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-02-04 04:12:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1375 transitions. [2018-02-04 04:12:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1350 [2018-02-04 04:12:59,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:12:59,439 INFO L351 BasicCegarLoop]: trace histogram [206, 189, 189, 188, 188, 188, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:12:59,439 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:12:59,439 INFO L82 PathProgramCache]: Analyzing trace with hash -616680001, now seen corresponding path program 35 times [2018-02-04 04:12:59,439 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:12:59,439 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:12:59,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:59,440 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:12:59,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:12:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:12:59,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 114363 backedges. 19703 proven. 990 refuted. 0 times theorem prover too weak. 93670 trivial. 0 not checked. [2018-02-04 04:13:02,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:02,648 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:02,648 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:13:06,713 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-02-04 04:13:06,713 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:07,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:07,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:13:07,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:13:07,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:13:07,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:13:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 114363 backedges. 19703 proven. 990 refuted. 0 times theorem prover too weak. 93670 trivial. 0 not checked. [2018-02-04 04:13:09,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:09,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2018-02-04 04:13:09,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 04:13:09,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 04:13:09,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=1573, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:13:09,971 INFO L87 Difference]: Start difference. First operand 1371 states and 1375 transitions. Second operand 46 states. [2018-02-04 04:13:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:11,063 INFO L93 Difference]: Finished difference Result 1391 states and 1396 transitions. [2018-02-04 04:13:11,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:13:11,063 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1349 [2018-02-04 04:13:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:11,066 INFO L225 Difference]: With dead ends: 1391 [2018-02-04 04:13:11,066 INFO L226 Difference]: Without dead ends: 1391 [2018-02-04 04:13:11,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1293 SyntacticMatches, 34 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=820, Invalid=3340, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:13:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-02-04 04:13:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1377. [2018-02-04 04:13:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2018-02-04 04:13:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1382 transitions. [2018-02-04 04:13:11,074 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1382 transitions. Word has length 1349 [2018-02-04 04:13:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:11,075 INFO L432 AbstractCegarLoop]: Abstraction has 1377 states and 1382 transitions. [2018-02-04 04:13:11,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 04:13:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1382 transitions. [2018-02-04 04:13:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1356 [2018-02-04 04:13:11,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:11,083 INFO L351 BasicCegarLoop]: trace histogram [207, 190, 190, 189, 189, 189, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:11,083 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash -888325561, now seen corresponding path program 36 times [2018-02-04 04:13:11,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:11,084 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:11,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:11,084 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:11,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:11,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 115529 backedges. 21803 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-02-04 04:13:14,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:14,732 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:14,733 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:13:16,906 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-02-04 04:13:16,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:16,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:16,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:13:16,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:13:16,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:13:16,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:13:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 115529 backedges. 20641 proven. 5592 refuted. 0 times theorem prover too weak. 89296 trivial. 0 not checked. [2018-02-04 04:13:19,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:19,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 29] total 70 [2018-02-04 04:13:19,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 04:13:19,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 04:13:19,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=4037, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 04:13:19,878 INFO L87 Difference]: Start difference. First operand 1377 states and 1382 transitions. Second operand 70 states. [2018-02-04 04:13:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:21,719 INFO L93 Difference]: Finished difference Result 1508 states and 1514 transitions. [2018-02-04 04:13:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-02-04 04:13:21,719 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 1355 [2018-02-04 04:13:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:21,722 INFO L225 Difference]: With dead ends: 1508 [2018-02-04 04:13:21,722 INFO L226 Difference]: Without dead ends: 1508 [2018-02-04 04:13:21,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1454 GetRequests, 1296 SyntacticMatches, 32 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6212 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2963, Invalid=13293, Unknown=0, NotChecked=0, Total=16256 [2018-02-04 04:13:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2018-02-04 04:13:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1503. [2018-02-04 04:13:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-02-04 04:13:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1509 transitions. [2018-02-04 04:13:21,729 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1509 transitions. Word has length 1355 [2018-02-04 04:13:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:21,730 INFO L432 AbstractCegarLoop]: Abstraction has 1503 states and 1509 transitions. [2018-02-04 04:13:21,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 04:13:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1509 transitions. [2018-02-04 04:13:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1476 [2018-02-04 04:13:21,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:21,739 INFO L351 BasicCegarLoop]: trace histogram [226, 208, 208, 207, 207, 207, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:21,739 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:21,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1787536920, now seen corresponding path program 37 times [2018-02-04 04:13:21,740 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:21,740 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:21,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:21,740 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:21,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:21,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 45982 proven. 9625 refuted. 0 times theorem prover too weak. 82561 trivial. 0 not checked. [2018-02-04 04:13:25,950 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:25,950 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:25,950 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:13:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:26,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 46011 proven. 9596 refuted. 0 times theorem prover too weak. 82561 trivial. 0 not checked. [2018-02-04 04:13:27,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:27,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 74 [2018-02-04 04:13:27,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 04:13:27,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 04:13:27,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=918, Invalid=4484, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 04:13:27,257 INFO L87 Difference]: Start difference. First operand 1503 states and 1509 transitions. Second operand 74 states. [2018-02-04 04:13:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:28,336 INFO L93 Difference]: Finished difference Result 1520 states and 1524 transitions. [2018-02-04 04:13:28,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 04:13:28,337 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1475 [2018-02-04 04:13:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:28,339 INFO L225 Difference]: With dead ends: 1520 [2018-02-04 04:13:28,339 INFO L226 Difference]: Without dead ends: 1514 [2018-02-04 04:13:28,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1567 GetRequests, 1447 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4220 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3002, Invalid=11760, Unknown=0, NotChecked=0, Total=14762 [2018-02-04 04:13:28,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-02-04 04:13:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1503. [2018-02-04 04:13:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-02-04 04:13:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1507 transitions. [2018-02-04 04:13:28,346 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1507 transitions. Word has length 1475 [2018-02-04 04:13:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:28,347 INFO L432 AbstractCegarLoop]: Abstraction has 1503 states and 1507 transitions. [2018-02-04 04:13:28,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 04:13:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1507 transitions. [2018-02-04 04:13:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1482 [2018-02-04 04:13:28,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:28,356 INFO L351 BasicCegarLoop]: trace histogram [227, 209, 209, 208, 208, 208, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:28,356 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:28,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1693559968, now seen corresponding path program 38 times [2018-02-04 04:13:28,356 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:28,356 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:28,357 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:28,357 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:13:28,357 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:28,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 23040 proven. 1102 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-02-04 04:13:32,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:32,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:32,103 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:13:32,176 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:13:32,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:32,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:32,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:13:32,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:13:32,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:13:32,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:13:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 23040 proven. 1102 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-02-04 04:13:34,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:34,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 26 [2018-02-04 04:13:34,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:13:34,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:13:34,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=415, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:13:34,513 INFO L87 Difference]: Start difference. First operand 1503 states and 1507 transitions. Second operand 27 states. [2018-02-04 04:13:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:34,969 INFO L93 Difference]: Finished difference Result 1523 states and 1528 transitions. [2018-02-04 04:13:34,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 04:13:34,969 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1481 [2018-02-04 04:13:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:34,971 INFO L225 Difference]: With dead ends: 1523 [2018-02-04 04:13:34,972 INFO L226 Difference]: Without dead ends: 1523 [2018-02-04 04:13:34,972 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1524 GetRequests, 1441 SyntacticMatches, 38 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=788, Invalid=1374, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:13:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2018-02-04 04:13:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1509. [2018-02-04 04:13:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2018-02-04 04:13:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1514 transitions. [2018-02-04 04:13:34,979 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1514 transitions. Word has length 1481 [2018-02-04 04:13:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:34,980 INFO L432 AbstractCegarLoop]: Abstraction has 1509 states and 1514 transitions. [2018-02-04 04:13:34,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:13:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1514 transitions. [2018-02-04 04:13:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1488 [2018-02-04 04:13:34,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:34,989 INFO L351 BasicCegarLoop]: trace histogram [228, 210, 210, 209, 209, 209, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:34,989 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1607842712, now seen corresponding path program 39 times [2018-02-04 04:13:34,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:34,990 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:34,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:34,990 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:34,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:35,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 25371 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-02-04 04:13:39,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:39,231 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:39,231 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:13:39,350 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-02-04 04:13:39,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:39,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:39,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:13:39,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:13:39,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:13:39,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:13:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 24210 proven. 1220 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-02-04 04:13:42,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:42,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 26] total 69 [2018-02-04 04:13:42,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 04:13:42,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 04:13:42,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=3941, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 04:13:42,576 INFO L87 Difference]: Start difference. First operand 1509 states and 1514 transitions. Second operand 69 states. [2018-02-04 04:13:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:45,563 INFO L93 Difference]: Finished difference Result 1669 states and 1676 transitions. [2018-02-04 04:13:45,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-02-04 04:13:45,563 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1487 [2018-02-04 04:13:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:45,566 INFO L225 Difference]: With dead ends: 1669 [2018-02-04 04:13:45,566 INFO L226 Difference]: Without dead ends: 1669 [2018-02-04 04:13:45,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1614 GetRequests, 1429 SyntacticMatches, 35 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3986, Invalid=18966, Unknown=0, NotChecked=0, Total=22952 [2018-02-04 04:13:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2018-02-04 04:13:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1647. [2018-02-04 04:13:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2018-02-04 04:13:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 1654 transitions. [2018-02-04 04:13:45,580 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 1654 transitions. Word has length 1487 [2018-02-04 04:13:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:45,581 INFO L432 AbstractCegarLoop]: Abstraction has 1647 states and 1654 transitions. [2018-02-04 04:13:45,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 04:13:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1654 transitions. [2018-02-04 04:13:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1620 [2018-02-04 04:13:45,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:45,600 INFO L351 BasicCegarLoop]: trace histogram [249, 230, 230, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:45,600 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:45,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1063873865, now seen corresponding path program 40 times [2018-02-04 04:13:45,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:45,601 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:45,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:45,602 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:45,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:45,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:13:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 69916 proven. 3474 refuted. 0 times theorem prover too weak. 95049 trivial. 0 not checked. [2018-02-04 04:13:51,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:13:51,030 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:13:51,030 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:13:51,111 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:13:51,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:13:51,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:13:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 47426 proven. 5793 refuted. 0 times theorem prover too weak. 115220 trivial. 0 not checked. [2018-02-04 04:13:52,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:13:52,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 49] total 92 [2018-02-04 04:13:52,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-02-04 04:13:52,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-02-04 04:13:52,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1197, Invalid=7175, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 04:13:52,815 INFO L87 Difference]: Start difference. First operand 1647 states and 1654 transitions. Second operand 92 states. [2018-02-04 04:13:55,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:13:55,602 INFO L93 Difference]: Finished difference Result 1805 states and 1812 transitions. [2018-02-04 04:13:55,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 04:13:55,604 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1619 [2018-02-04 04:13:55,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:13:55,608 INFO L225 Difference]: With dead ends: 1805 [2018-02-04 04:13:55,608 INFO L226 Difference]: Without dead ends: 1799 [2018-02-04 04:13:55,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1751 GetRequests, 1575 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4888, Invalid=26618, Unknown=0, NotChecked=0, Total=31506 [2018-02-04 04:13:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-02-04 04:13:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1785. [2018-02-04 04:13:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2018-02-04 04:13:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 1791 transitions. [2018-02-04 04:13:55,636 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 1791 transitions. Word has length 1619 [2018-02-04 04:13:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:13:55,637 INFO L432 AbstractCegarLoop]: Abstraction has 1785 states and 1791 transitions. [2018-02-04 04:13:55,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-02-04 04:13:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 1791 transitions. [2018-02-04 04:13:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2018-02-04 04:13:55,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:13:55,650 INFO L351 BasicCegarLoop]: trace histogram [271, 251, 251, 250, 250, 250, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:13:55,651 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 04:13:55,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1662420850, now seen corresponding path program 41 times [2018-02-04 04:13:55,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:13:55,651 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:13:55,651 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:55,652 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:13:55,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:13:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:13:55,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:14:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 200170 backedges. 76348 proven. 6069 refuted. 0 times theorem prover too weak. 117753 trivial. 0 not checked. [2018-02-04 04:14:02,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:14:02,231 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:14:02,232 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:14:07,107 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-02-04 04:14:07,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:14:07,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-02-04 04:14:07,611 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 04:14:07,612 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:14:07,614 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:14:07,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:14:07 BoogieIcfgContainer [2018-02-04 04:14:07,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:14:07,615 INFO L168 Benchmark]: Toolchain (without parser) took 172238.74 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 359.3 MB in the beginning and 906.2 MB in the end (delta: -546.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-02-04 04:14:07,616 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:14:07,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.29 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 351.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:07,616 INFO L168 Benchmark]: Boogie Preprocessor took 26.77 ms. Allocated memory is still 402.7 MB. Free memory was 351.4 MB in the beginning and 348.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:07,617 INFO L168 Benchmark]: RCFGBuilder took 191.37 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 331.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:14:07,617 INFO L168 Benchmark]: TraceAbstraction took 171861.55 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 331.6 MB in the beginning and 906.2 MB in the end (delta: -574.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-02-04 04:14:07,620 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.12 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.29 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 351.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.77 ms. Allocated memory is still 402.7 MB. Free memory was 351.4 MB in the beginning and 348.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 191.37 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 331.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 171861.55 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 331.6 MB in the beginning and 906.2 MB in the end (delta: -574.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1758 with TraceHistMax 271, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 64 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1758 with TraceHistMax 271, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1758 with TraceHistMax 271, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 64 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 1758 with TraceHistMax 271, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 64 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1758 with TraceHistMax 271, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 64 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 1758 with TraceHistMax 271, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 64 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 171.8s OverallTime, 49 OverallIterations, 271 TraceHistogramMax, 47.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1598 SDtfs, 25331 SDslu, 18956 SDs, 0 SdLazy, 61184 SolverSat, 3951 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31028 GetRequests, 27487 SyntacticMatches, 428 SemanticMatches, 3113 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101355 ImplicationChecksByTransitivity, 50.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1785occurred in iteration=48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 48 MinimizatonAttempts, 888 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 12.2s SatisfiabilityAnalysisTime, 88.0s InterpolantComputationTime, 57317 NumberOfCodeBlocks, 53518 NumberOfCodeBlocksAsserted, 415 NumberOfCheckSat, 57227 ConstructedInterpolants, 12015 QuantifiedInterpolants, 199756520 SizeOfPredicates, 164 NumberOfNonLiveVariables, 56940 ConjunctsInSsa, 1206 ConjunctsInUnsatCore, 90 InterpolantComputations, 7 PerfectInterpolantSequences, 3456058/3588181 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-14-07-625.csv 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-TraceAbstractionBenchmarks-0-2018-02-04_04-14-07-625.csv Completed graceful shutdown