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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:50:23,832 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:50:23,834 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:50:23,847 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:50:23,847 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:50:23,848 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:50:23,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:50:23,850 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:50:23,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:50:23,852 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:50:23,853 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:50:23,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:50:23,854 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:50:23,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:50:23,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:50:23,858 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:50:23,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:50:23,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:50:23,863 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:50:23,864 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:50:23,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:50:23,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:50:23,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:50:23,868 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:50:23,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:50:23,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:50:23,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:50:23,871 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:50:23,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:50:23,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:50:23,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:50:23,872 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:50:23,882 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:50:23,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:50:23,883 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:50:23,883 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:50:23,883 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:50:23,884 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:50:23,884 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:50:23,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:50:23,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:50:23,885 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:50:23,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:50:23,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:50:23,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:50:23,886 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:50:23,886 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:50:23,886 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:50:23,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:50:23,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:50:23,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:50:23,887 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:50:23,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:50:23,887 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:50:23,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:50:23,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:50:23,888 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:50:23,888 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:50:23,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:50:23,888 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:50:23,889 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:50:23,889 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:50:23,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:50:23,889 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:50:23,890 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:50:23,890 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:50:23,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:50:23,937 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:50:23,941 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:50:23,942 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:50:23,943 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:50:23,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-29 23:50:24,046 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:50:24,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:50:24,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:50:24,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:50:24,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:50:24,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:50:24" (1/1) ... [2018-01-29 23:50:24,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1311c853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24, skipping insertion in model container [2018-01-29 23:50:24,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:50:24" (1/1) ... [2018-01-29 23:50:24,073 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:50:24,090 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:50:24,194 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:50:24,208 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:50:24,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24 WrapperNode [2018-01-29 23:50:24,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:50:24,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:50:24,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:50:24,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:50:24,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24" (1/1) ... [2018-01-29 23:50:24,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24" (1/1) ... [2018-01-29 23:50:24,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24" (1/1) ... [2018-01-29 23:50:24,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24" (1/1) ... [2018-01-29 23:50:24,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24" (1/1) ... [2018-01-29 23:50:24,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24" (1/1) ... [2018-01-29 23:50:24,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24" (1/1) ... [2018-01-29 23:50:24,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:50:24,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:50:24,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:50:24,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:50:24,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24" (1/1) ... No working directory specified, using /storage/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-01-29 23:50:24,336 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:50:24,337 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:50:24,337 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-29 23:50:24,337 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:50:24,337 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:50:24,337 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:50:24,337 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:50:24,337 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:50:24,338 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:50:24,338 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-29 23:50:24,338 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:50:24,338 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:50:24,338 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:50:24,547 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:50:24,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:50:24 BoogieIcfgContainer [2018-01-29 23:50:24,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:50:24,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:50:24,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:50:24,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:50:24,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:50:24" (1/3) ... [2018-01-29 23:50:24,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1420a147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:50:24, skipping insertion in model container [2018-01-29 23:50:24,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:24" (2/3) ... [2018-01-29 23:50:24,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1420a147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:50:24, skipping insertion in model container [2018-01-29 23:50:24,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:50:24" (3/3) ... [2018-01-29 23:50:24,555 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-29 23:50:24,561 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:50:24,566 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-29 23:50:24,609 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:50:24,609 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:50:24,609 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:50:24,610 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:50:24,610 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:50:24,610 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:50:24,610 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:50:24,610 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:50:24,611 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:50:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-29 23:50:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-29 23:50:24,632 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:24,633 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:24,634 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1628091867, now seen corresponding path program 1 times [2018-01-29 23:50:24,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:24,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:24,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:24,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:24,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:24,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:24,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:24,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:50:24,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:50:24,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:50:24,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:50:24,837 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-29 23:50:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:24,944 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2018-01-29 23:50:24,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:50:24,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-29 23:50:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:24,953 INFO L225 Difference]: With dead ends: 133 [2018-01-29 23:50:24,953 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 23:50:24,956 INFO L553 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-01-29 23:50:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 23:50:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-29 23:50:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-29 23:50:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-29 23:50:25,053 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 13 [2018-01-29 23:50:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:25,053 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-29 23:50:25,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:50:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-29 23:50:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-29 23:50:25,054 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:25,054 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:25,054 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:25,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1198271325, now seen corresponding path program 1 times [2018-01-29 23:50:25,055 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:25,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:25,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:25,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:25,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:25,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:25,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:25,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:50:25,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:50:25,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:50:25,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:50:25,193 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 7 states. [2018-01-29 23:50:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:25,421 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-01-29 23:50:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:50:25,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-29 23:50:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:25,425 INFO L225 Difference]: With dead ends: 172 [2018-01-29 23:50:25,425 INFO L226 Difference]: Without dead ends: 121 [2018-01-29 23:50:25,426 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:50:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-29 23:50:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-01-29 23:50:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-29 23:50:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-01-29 23:50:25,436 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 22 [2018-01-29 23:50:25,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:25,437 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-01-29 23:50:25,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:50:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-01-29 23:50:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:50:25,437 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:25,437 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:25,437 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1508294640, now seen corresponding path program 1 times [2018-01-29 23:50:25,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:25,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:25,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:25,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:25,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:25,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:25,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:25,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:50:25,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:50:25,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:50:25,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:50:25,499 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 5 states. [2018-01-29 23:50:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:25,546 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-01-29 23:50:25,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:50:25,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-29 23:50:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:25,547 INFO L225 Difference]: With dead ends: 88 [2018-01-29 23:50:25,548 INFO L226 Difference]: Without dead ends: 87 [2018-01-29 23:50:25,548 INFO L553 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-01-29 23:50:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-29 23:50:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-29 23:50:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 23:50:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-29 23:50:25,559 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 23 [2018-01-29 23:50:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:25,560 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-29 23:50:25,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:50:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-29 23:50:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:50:25,561 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:25,561 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:25,561 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:25,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1508294641, now seen corresponding path program 1 times [2018-01-29 23:50:25,562 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:25,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:25,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:25,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:25,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:25,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:25,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:25,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:50:25,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:50:25,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:50:25,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:50:25,679 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-29 23:50:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:25,795 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-01-29 23:50:25,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:50:25,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-29 23:50:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:25,796 INFO L225 Difference]: With dead ends: 101 [2018-01-29 23:50:25,797 INFO L226 Difference]: Without dead ends: 100 [2018-01-29 23:50:25,797 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:50:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-29 23:50:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-01-29 23:50:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-29 23:50:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-29 23:50:25,811 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 23 [2018-01-29 23:50:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:25,812 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-29 23:50:25,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:50:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-29 23:50:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 23:50:25,813 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:25,813 INFO L350 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] [2018-01-29 23:50:25,813 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1757973218, now seen corresponding path program 1 times [2018-01-29 23:50:25,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:25,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:25,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:25,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:25,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:25,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:25,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:25,878 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:25,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:25,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:25,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:25,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-29 23:50:25,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:50:25,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:50:25,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:50:25,961 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 5 states. [2018-01-29 23:50:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:26,028 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2018-01-29 23:50:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:50:26,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-29 23:50:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:26,030 INFO L225 Difference]: With dead ends: 126 [2018-01-29 23:50:26,030 INFO L226 Difference]: Without dead ends: 125 [2018-01-29 23:50:26,031 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:50:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-29 23:50:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2018-01-29 23:50:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-29 23:50:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-01-29 23:50:26,046 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 31 [2018-01-29 23:50:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:26,047 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-01-29 23:50:26,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:50:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-01-29 23:50:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:50:26,048 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:26,048 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:26,048 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1337405038, now seen corresponding path program 1 times [2018-01-29 23:50:26,049 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:26,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:26,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:26,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:26,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:26,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:26,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:26,245 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:26,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:26,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:26,300 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-01-29 23:50:26,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:26,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:50:26,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:50:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:26,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:26,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-29 23:50:26,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:50:26,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:50:26,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:50:26,355 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 8 states. [2018-01-29 23:50:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:26,543 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-01-29 23:50:26,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:50:26,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-29 23:50:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:26,544 INFO L225 Difference]: With dead ends: 125 [2018-01-29 23:50:26,544 INFO L226 Difference]: Without dead ends: 124 [2018-01-29 23:50:26,544 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:50:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-29 23:50:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2018-01-29 23:50:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-29 23:50:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2018-01-29 23:50:26,556 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 32 [2018-01-29 23:50:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:26,557 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2018-01-29 23:50:26,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:50:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2018-01-29 23:50:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 23:50:26,558 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:26,558 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:26,559 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:26,560 INFO L82 PathProgramCache]: Analyzing trace with hash 127101827, now seen corresponding path program 2 times [2018-01-29 23:50:26,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:26,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:26,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:26,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:26,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:26,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:26,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:26,740 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:26,752 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:50:26,764 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:26,773 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:26,774 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:26,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:26,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:50:26,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-01-29 23:50:26,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:50:26,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:50:26,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:50:26,885 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 18 states. [2018-01-29 23:50:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:27,055 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2018-01-29 23:50:27,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:50:27,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-01-29 23:50:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:27,057 INFO L225 Difference]: With dead ends: 193 [2018-01-29 23:50:27,057 INFO L226 Difference]: Without dead ends: 118 [2018-01-29 23:50:27,058 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:50:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-29 23:50:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2018-01-29 23:50:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-29 23:50:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-29 23:50:27,065 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 40 [2018-01-29 23:50:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:27,066 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-29 23:50:27,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:50:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-29 23:50:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-29 23:50:27,067 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:27,068 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:27,068 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash 650265267, now seen corresponding path program 1 times [2018-01-29 23:50:27,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:27,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:27,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:27,069 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:27,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:27,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:50:27,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:27,163 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:27,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:27,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:50:27,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:27,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2018-01-29 23:50:27,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:50:27,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:50:27,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:50:27,366 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 12 states. [2018-01-29 23:50:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:27,588 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2018-01-29 23:50:27,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:50:27,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-01-29 23:50:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:27,589 INFO L225 Difference]: With dead ends: 206 [2018-01-29 23:50:27,590 INFO L226 Difference]: Without dead ends: 140 [2018-01-29 23:50:27,590 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:50:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-29 23:50:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2018-01-29 23:50:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-29 23:50:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-29 23:50:27,600 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 42 [2018-01-29 23:50:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:27,600 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-29 23:50:27,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:50:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-29 23:50:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-29 23:50:27,601 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:27,601 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2018-01-29 23:50:27,601 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1935939050, now seen corresponding path program 1 times [2018-01-29 23:50:27,602 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:27,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:27,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:27,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:27,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:27,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-29 23:50:27,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:27,699 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:27,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:27,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-29 23:50:27,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:27,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-29 23:50:27,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:50:27,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:50:27,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:50:27,778 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 7 states. [2018-01-29 23:50:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:27,873 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-29 23:50:27,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:50:27,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-01-29 23:50:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:27,875 INFO L225 Difference]: With dead ends: 139 [2018-01-29 23:50:27,875 INFO L226 Difference]: Without dead ends: 138 [2018-01-29 23:50:27,876 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:50:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-29 23:50:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2018-01-29 23:50:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-29 23:50:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-01-29 23:50:27,883 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 78 [2018-01-29 23:50:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:27,883 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-01-29 23:50:27,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:50:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-01-29 23:50:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 23:50:27,885 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:27,885 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-01-29 23:50:27,885 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash 115431646, now seen corresponding path program 1 times [2018-01-29 23:50:27,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:27,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:27,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:27,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:27,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:27,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-29 23:50:28,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:28,329 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:28,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:28,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:28,381 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-01-29 23:50:28,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:28,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:50:28,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:50:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 55 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-29 23:50:28,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:28,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-01-29 23:50:28,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:50:28,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:50:28,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:50:28,621 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 22 states. [2018-01-29 23:50:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:29,409 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2018-01-29 23:50:29,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 23:50:29,409 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 79 [2018-01-29 23:50:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:29,411 INFO L225 Difference]: With dead ends: 197 [2018-01-29 23:50:29,411 INFO L226 Difference]: Without dead ends: 189 [2018-01-29 23:50:29,412 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=385, Invalid=1777, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 23:50:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-29 23:50:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 152. [2018-01-29 23:50:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-29 23:50:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-01-29 23:50:29,422 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 79 [2018-01-29 23:50:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:29,422 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-01-29 23:50:29,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:50:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-01-29 23:50:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-29 23:50:29,424 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:29,424 INFO L350 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:29,425 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:29,425 INFO L82 PathProgramCache]: Analyzing trace with hash -310174977, now seen corresponding path program 2 times [2018-01-29 23:50:29,425 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:29,425 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:29,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:29,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:29,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:29,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-29 23:50:29,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:29,546 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:29,555 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:50:29,563 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:29,573 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:29,585 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:29,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-29 23:50:29,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:29,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2018-01-29 23:50:29,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:50:29,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:50:29,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:50:29,762 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 17 states. [2018-01-29 23:50:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:30,083 INFO L93 Difference]: Finished difference Result 269 states and 283 transitions. [2018-01-29 23:50:30,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:50:30,084 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2018-01-29 23:50:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:30,085 INFO L225 Difference]: With dead ends: 269 [2018-01-29 23:50:30,086 INFO L226 Difference]: Without dead ends: 185 [2018-01-29 23:50:30,086 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:50:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-29 23:50:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2018-01-29 23:50:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-29 23:50:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2018-01-29 23:50:30,096 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 89 [2018-01-29 23:50:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:30,097 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2018-01-29 23:50:30,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:50:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-01-29 23:50:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-29 23:50:30,106 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:30,106 INFO L350 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:30,106 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1033388843, now seen corresponding path program 1 times [2018-01-29 23:50:30,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:30,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:30,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:30,108 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:30,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:30,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-29 23:50:30,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:30,231 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:30,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:30,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-29 23:50:30,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:30,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-29 23:50:30,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:50:30,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:50:30,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:50:30,321 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 9 states. [2018-01-29 23:50:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:30,394 INFO L93 Difference]: Finished difference Result 203 states and 210 transitions. [2018-01-29 23:50:30,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:50:30,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2018-01-29 23:50:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:30,396 INFO L225 Difference]: With dead ends: 203 [2018-01-29 23:50:30,396 INFO L226 Difference]: Without dead ends: 183 [2018-01-29 23:50:30,396 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:50:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-29 23:50:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-01-29 23:50:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-29 23:50:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 172 transitions. [2018-01-29 23:50:30,406 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 172 transitions. Word has length 106 [2018-01-29 23:50:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:30,406 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 172 transitions. [2018-01-29 23:50:30,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:50:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2018-01-29 23:50:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-29 23:50:30,408 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:30,408 INFO L350 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:30,408 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2126374397, now seen corresponding path program 2 times [2018-01-29 23:50:30,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:30,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:30,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:30,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:30,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:30,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 166 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-01-29 23:50:30,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:30,539 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:30,545 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:50:30,558 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:30,570 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:30,572 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:30,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 166 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-01-29 23:50:30,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:30,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-01-29 23:50:30,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:50:30,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:50:30,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:50:30,616 INFO L87 Difference]: Start difference. First operand 168 states and 172 transitions. Second operand 9 states. [2018-01-29 23:50:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:30,733 INFO L93 Difference]: Finished difference Result 204 states and 210 transitions. [2018-01-29 23:50:30,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:50:30,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-01-29 23:50:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:30,735 INFO L225 Difference]: With dead ends: 204 [2018-01-29 23:50:30,735 INFO L226 Difference]: Without dead ends: 203 [2018-01-29 23:50:30,735 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:50:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-29 23:50:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2018-01-29 23:50:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-29 23:50:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 181 transitions. [2018-01-29 23:50:30,744 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 181 transitions. Word has length 134 [2018-01-29 23:50:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:30,744 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 181 transitions. [2018-01-29 23:50:30,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:50:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 181 transitions. [2018-01-29 23:50:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-01-29 23:50:30,746 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:30,746 INFO L350 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:30,746 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:30,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1493096815, now seen corresponding path program 2 times [2018-01-29 23:50:30,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:30,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:30,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:30,747 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:30,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:30,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 181 proven. 39 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-01-29 23:50:31,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:31,019 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:31,024 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:50:31,034 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:31,048 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:31,062 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:31,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:31,081 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-01-29 23:50:31,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:31,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:50:31,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:50:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 181 proven. 39 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-01-29 23:50:31,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:31,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2018-01-29 23:50:31,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:50:31,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:50:31,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:50:31,303 INFO L87 Difference]: Start difference. First operand 176 states and 181 transitions. Second operand 13 states. [2018-01-29 23:50:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:31,551 INFO L93 Difference]: Finished difference Result 203 states and 209 transitions. [2018-01-29 23:50:31,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:50:31,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 135 [2018-01-29 23:50:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:31,552 INFO L225 Difference]: With dead ends: 203 [2018-01-29 23:50:31,552 INFO L226 Difference]: Without dead ends: 202 [2018-01-29 23:50:31,553 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:50:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-29 23:50:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 177. [2018-01-29 23:50:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-29 23:50:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 182 transitions. [2018-01-29 23:50:31,561 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 182 transitions. Word has length 135 [2018-01-29 23:50:31,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:31,561 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 182 transitions. [2018-01-29 23:50:31,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:50:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 182 transitions. [2018-01-29 23:50:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-29 23:50:31,562 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:31,563 INFO L350 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:31,563 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash -354266750, now seen corresponding path program 3 times [2018-01-29 23:50:31,563 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:31,563 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:31,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:31,564 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:31,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:31,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 247 proven. 45 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-01-29 23:50:31,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:31,778 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:31,783 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:50:31,792 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:31,796 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:31,797 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:31,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 229 proven. 27 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-01-29 23:50:31,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:31,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 26 [2018-01-29 23:50:31,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 23:50:31,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 23:50:31,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:50:31,938 INFO L87 Difference]: Start difference. First operand 177 states and 182 transitions. Second operand 27 states. [2018-01-29 23:50:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:32,423 INFO L93 Difference]: Finished difference Result 239 states and 248 transitions. [2018-01-29 23:50:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 23:50:32,423 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 143 [2018-01-29 23:50:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:32,425 INFO L225 Difference]: With dead ends: 239 [2018-01-29 23:50:32,425 INFO L226 Difference]: Without dead ends: 238 [2018-01-29 23:50:32,426 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=494, Invalid=2158, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 23:50:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-29 23:50:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 176. [2018-01-29 23:50:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-29 23:50:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 181 transitions. [2018-01-29 23:50:32,434 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 181 transitions. Word has length 143 [2018-01-29 23:50:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:32,434 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 181 transitions. [2018-01-29 23:50:32,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 23:50:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 181 transitions. [2018-01-29 23:50:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-01-29 23:50:32,435 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:32,435 INFO L350 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:32,435 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1902632690, now seen corresponding path program 3 times [2018-01-29 23:50:32,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:32,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:32,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:32,436 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:32,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:32,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 275 proven. 26 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-01-29 23:50:32,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:32,836 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:32,841 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:50:32,851 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:32,855 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:32,859 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:32,861 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:32,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:32,866 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-01-29 23:50:32,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:32,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:50:32,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:50:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 253 proven. 26 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-29 23:50:33,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:33,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-01-29 23:50:33,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:50:33,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:50:33,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:50:33,150 INFO L87 Difference]: Start difference. First operand 176 states and 181 transitions. Second operand 31 states. [2018-01-29 23:50:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:33,595 INFO L93 Difference]: Finished difference Result 238 states and 246 transitions. [2018-01-29 23:50:33,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:50:33,596 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 144 [2018-01-29 23:50:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:33,598 INFO L225 Difference]: With dead ends: 238 [2018-01-29 23:50:33,598 INFO L226 Difference]: Without dead ends: 237 [2018-01-29 23:50:33,599 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1741, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 23:50:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-29 23:50:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 215. [2018-01-29 23:50:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-29 23:50:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 221 transitions. [2018-01-29 23:50:33,612 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 221 transitions. Word has length 144 [2018-01-29 23:50:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:33,612 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 221 transitions. [2018-01-29 23:50:33,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:50:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 221 transitions. [2018-01-29 23:50:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-29 23:50:33,613 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:33,614 INFO L350 BasicCegarLoop]: trace histogram [11, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:33,614 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1502561417, now seen corresponding path program 2 times [2018-01-29 23:50:33,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:33,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:33,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:33,615 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:33,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:33,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-01-29 23:50:33,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:33,772 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:33,779 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:50:33,793 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:33,795 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:33,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:33,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:50:33,826 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-01-29 23:50:33,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:33,828 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-01-29 23:50:33,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-29 23:50:33,867 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:50:33,867 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-01-29 23:50:33,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:33,869 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-01-29 23:50:33,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-29 23:50:33,931 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:50:33,932 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-01-29 23:50:33,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:33,934 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-01-29 23:50:33,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-29 23:50:34,008 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-29 23:50:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-01-29 23:50:34,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:50:34,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-01-29 23:50:34,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:50:34,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:50:34,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2018-01-29 23:50:34,094 INFO L87 Difference]: Start difference. First operand 215 states and 221 transitions. Second operand 13 states. [2018-01-29 23:50:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:34,720 INFO L93 Difference]: Finished difference Result 257 states and 268 transitions. [2018-01-29 23:50:34,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 23:50:34,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2018-01-29 23:50:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:34,722 INFO L225 Difference]: With dead ends: 257 [2018-01-29 23:50:34,722 INFO L226 Difference]: Without dead ends: 225 [2018-01-29 23:50:34,723 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=442, Unknown=1, NotChecked=46, Total=650 [2018-01-29 23:50:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-29 23:50:34,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 215. [2018-01-29 23:50:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-29 23:50:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 220 transitions. [2018-01-29 23:50:34,735 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 220 transitions. Word has length 153 [2018-01-29 23:50:34,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:34,736 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 220 transitions. [2018-01-29 23:50:34,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:50:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 220 transitions. [2018-01-29 23:50:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-01-29 23:50:34,737 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:34,737 INFO L350 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:34,737 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:34,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1737507266, now seen corresponding path program 4 times [2018-01-29 23:50:34,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:34,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:34,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:34,738 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:34,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:34,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 365 proven. 79 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-01-29 23:50:35,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:35,136 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:35,141 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:50:35,173 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:35,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 580 proven. 33 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-01-29 23:50:35,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:35,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-01-29 23:50:35,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:50:35,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:50:35,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:50:35,419 INFO L87 Difference]: Start difference. First operand 215 states and 220 transitions. Second operand 31 states. [2018-01-29 23:50:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:37,181 INFO L93 Difference]: Finished difference Result 402 states and 415 transitions. [2018-01-29 23:50:37,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-29 23:50:37,181 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 191 [2018-01-29 23:50:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:37,183 INFO L225 Difference]: With dead ends: 402 [2018-01-29 23:50:37,183 INFO L226 Difference]: Without dead ends: 314 [2018-01-29 23:50:37,185 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2310 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1075, Invalid=6065, Unknown=0, NotChecked=0, Total=7140 [2018-01-29 23:50:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-01-29 23:50:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 272. [2018-01-29 23:50:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-29 23:50:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 277 transitions. [2018-01-29 23:50:37,207 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 277 transitions. Word has length 191 [2018-01-29 23:50:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:37,207 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 277 transitions. [2018-01-29 23:50:37,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:50:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 277 transitions. [2018-01-29 23:50:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-29 23:50:37,209 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:37,209 INFO L350 BasicCegarLoop]: trace histogram [17, 13, 13, 13, 13, 13, 13, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:37,210 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1940595211, now seen corresponding path program 1 times [2018-01-29 23:50:37,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:37,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:37,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:37,211 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:37,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:37,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2018-01-29 23:50:37,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:37,340 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:37,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:37,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 458 proven. 62 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2018-01-29 23:50:37,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:37,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 20] total 23 [2018-01-29 23:50:37,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 23:50:37,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 23:50:37,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:50:37,708 INFO L87 Difference]: Start difference. First operand 272 states and 277 transitions. Second operand 23 states. [2018-01-29 23:50:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:38,388 INFO L93 Difference]: Finished difference Result 436 states and 449 transitions. [2018-01-29 23:50:38,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-29 23:50:38,388 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 220 [2018-01-29 23:50:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:38,390 INFO L225 Difference]: With dead ends: 436 [2018-01-29 23:50:38,390 INFO L226 Difference]: Without dead ends: 359 [2018-01-29 23:50:38,391 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=420, Invalid=2232, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 23:50:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-01-29 23:50:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 295. [2018-01-29 23:50:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-01-29 23:50:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 300 transitions. [2018-01-29 23:50:38,407 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 300 transitions. Word has length 220 [2018-01-29 23:50:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:38,408 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 300 transitions. [2018-01-29 23:50:38,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 23:50:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 300 transitions. [2018-01-29 23:50:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-01-29 23:50:38,409 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:38,409 INFO L350 BasicCegarLoop]: trace histogram [18, 14, 14, 14, 14, 14, 14, 14, 14, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:38,409 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash 111205615, now seen corresponding path program 2 times [2018-01-29 23:50:38,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:38,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:38,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:38,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:38,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:38,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2018-01-29 23:50:38,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:38,646 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:38,651 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:50:38,666 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:38,701 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:38,705 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:38,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2018-01-29 23:50:38,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:38,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2018-01-29 23:50:38,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:50:38,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:50:38,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:50:38,894 INFO L87 Difference]: Start difference. First operand 295 states and 300 transitions. Second operand 17 states. [2018-01-29 23:50:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:39,054 INFO L93 Difference]: Finished difference Result 331 states and 339 transitions. [2018-01-29 23:50:39,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 23:50:39,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 236 [2018-01-29 23:50:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:39,055 INFO L225 Difference]: With dead ends: 331 [2018-01-29 23:50:39,055 INFO L226 Difference]: Without dead ends: 291 [2018-01-29 23:50:39,056 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:50:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-29 23:50:39,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 276. [2018-01-29 23:50:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-01-29 23:50:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2018-01-29 23:50:39,077 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 236 [2018-01-29 23:50:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:39,078 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2018-01-29 23:50:39,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:50:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2018-01-29 23:50:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-01-29 23:50:39,080 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:39,080 INFO L350 BasicCegarLoop]: trace histogram [23, 19, 19, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:39,081 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:39,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1686521775, now seen corresponding path program 5 times [2018-01-29 23:50:39,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:39,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:39,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:39,082 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:39,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:39,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1757 backedges. 620 proven. 70 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-01-29 23:50:39,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:39,630 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:39,634 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:50:39,651 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:39,656 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:39,663 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:39,670 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:39,677 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:39,683 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:39,689 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:39,691 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:39,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:39,699 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-01-29 23:50:39,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:39,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:50:39,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:50:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1757 backedges. 620 proven. 70 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-01-29 23:50:40,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:40,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-01-29 23:50:40,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 23:50:40,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 23:50:40,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:50:40,003 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 23 states. [2018-01-29 23:50:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:40,383 INFO L93 Difference]: Finished difference Result 337 states and 344 transitions. [2018-01-29 23:50:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:50:40,384 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 265 [2018-01-29 23:50:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:40,386 INFO L225 Difference]: With dead ends: 337 [2018-01-29 23:50:40,386 INFO L226 Difference]: Without dead ends: 336 [2018-01-29 23:50:40,386 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 249 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 23:50:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-01-29 23:50:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 278. [2018-01-29 23:50:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-01-29 23:50:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 282 transitions. [2018-01-29 23:50:40,400 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 282 transitions. Word has length 265 [2018-01-29 23:50:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:40,401 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 282 transitions. [2018-01-29 23:50:40,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 23:50:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 282 transitions. [2018-01-29 23:50:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-01-29 23:50:40,402 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:40,402 INFO L350 BasicCegarLoop]: trace histogram [24, 20, 20, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:40,402 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash -736672462, now seen corresponding path program 6 times [2018-01-29 23:50:40,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:40,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:40,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:40,403 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:40,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:40,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 784 proven. 86 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2018-01-29 23:50:41,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:41,041 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:41,048 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:50:41,064 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:50:41,069 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:50:41,075 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:50:41,082 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:50:41,089 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:50:41,098 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:50:41,107 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:50:41,110 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:41,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:41,120 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-01-29 23:50:41,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:41,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:50:41,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:50:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 1035 proven. 370 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-01-29 23:50:41,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:41,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 43 [2018-01-29 23:50:41,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-29 23:50:41,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-29 23:50:41,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1659, Unknown=0, NotChecked=0, Total=1892 [2018-01-29 23:50:41,921 INFO L87 Difference]: Start difference. First operand 278 states and 282 transitions. Second operand 44 states. [2018-01-29 23:50:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:44,237 INFO L93 Difference]: Finished difference Result 450 states and 463 transitions. [2018-01-29 23:50:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-29 23:50:44,237 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 274 [2018-01-29 23:50:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:44,240 INFO L225 Difference]: With dead ends: 450 [2018-01-29 23:50:44,240 INFO L226 Difference]: Without dead ends: 449 [2018-01-29 23:50:44,244 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3881 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2013, Invalid=9117, Unknown=0, NotChecked=0, Total=11130 [2018-01-29 23:50:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-01-29 23:50:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 365. [2018-01-29 23:50:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-01-29 23:50:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 372 transitions. [2018-01-29 23:50:44,270 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 372 transitions. Word has length 274 [2018-01-29 23:50:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:44,271 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 372 transitions. [2018-01-29 23:50:44,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-29 23:50:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 372 transitions. [2018-01-29 23:50:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-01-29 23:50:44,273 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:44,274 INFO L350 BasicCegarLoop]: trace histogram [31, 26, 26, 25, 25, 25, 25, 25, 25, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:44,274 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1047066373, now seen corresponding path program 7 times [2018-01-29 23:50:44,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:44,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:44,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:44,275 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:44,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:44,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3305 backedges. 1065 proven. 110 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2018-01-29 23:50:45,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:45,179 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:45,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:45,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:45,263 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-01-29 23:50:45,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:45,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:50:45,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:50:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3305 backedges. 1065 proven. 110 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2018-01-29 23:50:45,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:45,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-01-29 23:50:45,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 23:50:45,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 23:50:45,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:50:45,879 INFO L87 Difference]: Start difference. First operand 365 states and 372 transitions. Second operand 27 states. [2018-01-29 23:50:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:46,452 INFO L93 Difference]: Finished difference Result 468 states and 481 transitions. [2018-01-29 23:50:46,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 23:50:46,452 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 348 [2018-01-29 23:50:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:46,455 INFO L225 Difference]: With dead ends: 468 [2018-01-29 23:50:46,455 INFO L226 Difference]: Without dead ends: 467 [2018-01-29 23:50:46,455 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 328 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2018-01-29 23:50:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-01-29 23:50:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 367. [2018-01-29 23:50:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-01-29 23:50:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 374 transitions. [2018-01-29 23:50:46,471 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 374 transitions. Word has length 348 [2018-01-29 23:50:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:46,472 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 374 transitions. [2018-01-29 23:50:46,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 23:50:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 374 transitions. [2018-01-29 23:50:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-01-29 23:50:46,473 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:46,474 INFO L350 BasicCegarLoop]: trace histogram [32, 27, 27, 26, 26, 26, 26, 26, 26, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:46,474 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:46,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1693363970, now seen corresponding path program 8 times [2018-01-29 23:50:46,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:46,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:46,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:46,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:46,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:46,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3544 backedges. 1292 proven. 132 refuted. 0 times theorem prover too weak. 2120 trivial. 0 not checked. [2018-01-29 23:50:47,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:47,238 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:47,248 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:50:47,267 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:47,309 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:47,322 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:47,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:47,336 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-01-29 23:50:47,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:47,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:50:47,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:50:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3544 backedges. 1255 proven. 159 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2018-01-29 23:50:48,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:48,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-01-29 23:50:48,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-29 23:50:48,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-29 23:50:48,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 23:50:48,512 INFO L87 Difference]: Start difference. First operand 367 states and 374 transitions. Second operand 37 states. [2018-01-29 23:50:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:50,148 INFO L93 Difference]: Finished difference Result 738 states and 767 transitions. [2018-01-29 23:50:50,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-29 23:50:50,148 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 357 [2018-01-29 23:50:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:50,151 INFO L225 Difference]: With dead ends: 738 [2018-01-29 23:50:50,151 INFO L226 Difference]: Without dead ends: 737 [2018-01-29 23:50:50,153 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 333 SyntacticMatches, 9 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1036, Invalid=7894, Unknown=0, NotChecked=0, Total=8930 [2018-01-29 23:50:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-01-29 23:50:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 463. [2018-01-29 23:50:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-01-29 23:50:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 475 transitions. [2018-01-29 23:50:50,177 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 475 transitions. Word has length 357 [2018-01-29 23:50:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:50,178 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 475 transitions. [2018-01-29 23:50:50,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-29 23:50:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 475 transitions. [2018-01-29 23:50:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-01-29 23:50:50,180 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:50,180 INFO L350 BasicCegarLoop]: trace histogram [39, 33, 33, 32, 32, 32, 32, 32, 32, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:50,180 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash -412827049, now seen corresponding path program 9 times [2018-01-29 23:50:50,181 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:50,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:50,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:50,181 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:50,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:50,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5342 backedges. 1801 proven. 217 refuted. 0 times theorem prover too weak. 3324 trivial. 0 not checked. [2018-01-29 23:50:51,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:51,380 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:51,385 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:50:51,404 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:51,409 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:51,423 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:51,433 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:51,442 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:51,454 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:51,468 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:50:51,473 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:51,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:51,492 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-01-29 23:50:51,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:50:51,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:50:51,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:50:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5342 backedges. 1845 proven. 188 refuted. 0 times theorem prover too weak. 3309 trivial. 0 not checked. [2018-01-29 23:50:52,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:52,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 42 [2018-01-29 23:50:52,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-29 23:50:52,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-29 23:50:52,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1583, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 23:50:52,261 INFO L87 Difference]: Start difference. First operand 463 states and 475 transitions. Second operand 43 states. [2018-01-29 23:50:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:54,755 INFO L93 Difference]: Finished difference Result 939 states and 984 transitions. [2018-01-29 23:50:54,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-29 23:50:54,755 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 431 [2018-01-29 23:50:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:54,759 INFO L225 Difference]: With dead ends: 939 [2018-01-29 23:50:54,759 INFO L226 Difference]: Without dead ends: 938 [2018-01-29 23:50:54,761 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 399 SyntacticMatches, 11 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5321 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2039, Invalid=11767, Unknown=0, NotChecked=0, Total=13806 [2018-01-29 23:50:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-01-29 23:50:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 559. [2018-01-29 23:50:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-01-29 23:50:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 576 transitions. [2018-01-29 23:50:54,807 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 576 transitions. Word has length 431 [2018-01-29 23:50:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:54,808 INFO L432 AbstractCegarLoop]: Abstraction has 559 states and 576 transitions. [2018-01-29 23:50:54,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-29 23:50:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 576 transitions. [2018-01-29 23:50:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-01-29 23:50:54,813 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:54,813 INFO L350 BasicCegarLoop]: trace histogram [46, 39, 39, 38, 38, 38, 38, 38, 38, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:54,813 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:54,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2015714974, now seen corresponding path program 10 times [2018-01-29 23:50:54,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:54,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:54,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:54,815 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:54,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:54,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7508 backedges. 4089 proven. 1017 refuted. 0 times theorem prover too weak. 2402 trivial. 0 not checked. [2018-01-29 23:50:55,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:55,882 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:55,888 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:50:55,970 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:55,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:50:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7508 backedges. 4664 proven. 100 refuted. 0 times theorem prover too weak. 2744 trivial. 0 not checked. [2018-01-29 23:50:56,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:50:56,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 46 [2018-01-29 23:50:56,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-29 23:50:56,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-29 23:50:56,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 23:50:56,388 INFO L87 Difference]: Start difference. First operand 559 states and 576 transitions. Second operand 46 states. [2018-01-29 23:50:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:57,708 INFO L93 Difference]: Finished difference Result 1137 states and 1176 transitions. [2018-01-29 23:50:57,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-29 23:50:57,709 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 505 [2018-01-29 23:50:57,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:57,712 INFO L225 Difference]: With dead ends: 1137 [2018-01-29 23:50:57,712 INFO L226 Difference]: Without dead ends: 708 [2018-01-29 23:50:57,714 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1099, Invalid=7273, Unknown=0, NotChecked=0, Total=8372 [2018-01-29 23:50:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-01-29 23:50:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 647. [2018-01-29 23:50:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-01-29 23:50:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 663 transitions. [2018-01-29 23:50:57,766 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 663 transitions. Word has length 505 [2018-01-29 23:50:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:57,766 INFO L432 AbstractCegarLoop]: Abstraction has 647 states and 663 transitions. [2018-01-29 23:50:57,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-29 23:50:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 663 transitions. [2018-01-29 23:50:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-01-29 23:50:57,771 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:57,771 INFO L350 BasicCegarLoop]: trace histogram [48, 41, 41, 40, 40, 40, 40, 40, 40, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:57,771 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:50:57,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2003422024, now seen corresponding path program 11 times [2018-01-29 23:50:57,772 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:57,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:57,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:57,773 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:50:57,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:57,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8237 backedges. 2751 proven. 254 refuted. 0 times theorem prover too weak. 5232 trivial. 0 not checked. [2018-01-29 23:50:59,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:50:59,218 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:50:59,224 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:50:59,246 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:59,254 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:59,264 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:59,275 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:59,286 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:59,296 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:59,307 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:59,317 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:50:59,320 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:50:59,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:51:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8237 backedges. 5020 proven. 698 refuted. 0 times theorem prover too weak. 2519 trivial. 0 not checked. [2018-01-29 23:51:00,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:51:00,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 33] total 60 [2018-01-29 23:51:00,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-29 23:51:00,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-29 23:51:00,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=3263, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 23:51:00,074 INFO L87 Difference]: Start difference. First operand 647 states and 663 transitions. Second operand 60 states. [2018-01-29 23:51:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:51:03,383 INFO L93 Difference]: Finished difference Result 972 states and 999 transitions. [2018-01-29 23:51:03,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-01-29 23:51:03,383 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 523 [2018-01-29 23:51:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:51:03,386 INFO L225 Difference]: With dead ends: 972 [2018-01-29 23:51:03,386 INFO L226 Difference]: Without dead ends: 791 [2018-01-29 23:51:03,390 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9176 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3059, Invalid=21433, Unknown=0, NotChecked=0, Total=24492 [2018-01-29 23:51:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-01-29 23:51:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 748. [2018-01-29 23:51:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-01-29 23:51:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 764 transitions. [2018-01-29 23:51:03,455 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 764 transitions. Word has length 523 [2018-01-29 23:51:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:51:03,455 INFO L432 AbstractCegarLoop]: Abstraction has 748 states and 764 transitions. [2018-01-29 23:51:03,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-29 23:51:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 764 transitions. [2018-01-29 23:51:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2018-01-29 23:51:03,461 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:51:03,461 INFO L350 BasicCegarLoop]: trace histogram [58, 50, 50, 49, 49, 49, 49, 49, 49, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:51:03,461 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:51:03,462 INFO L82 PathProgramCache]: Analyzing trace with hash -555408110, now seen corresponding path program 12 times [2018-01-29 23:51:03,462 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:51:03,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:51:03,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:03,463 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:51:03,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:51:03,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:51:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12212 backedges. 3300 proven. 284 refuted. 0 times theorem prover too weak. 8628 trivial. 0 not checked. [2018-01-29 23:51:04,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:51:04,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:51:04,977 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:51:05,000 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,007 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,012 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,021 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,028 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,040 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,050 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,064 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,076 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,091 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,111 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:05,114 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:51:05,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:51:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12212 backedges. 7312 proven. 203 refuted. 0 times theorem prover too weak. 4697 trivial. 0 not checked. [2018-01-29 23:51:05,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:51:05,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 32] total 52 [2018-01-29 23:51:05,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-29 23:51:05,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-29 23:51:05,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2434, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 23:51:05,836 INFO L87 Difference]: Start difference. First operand 748 states and 764 transitions. Second operand 52 states. [2018-01-29 23:51:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:51:07,794 INFO L93 Difference]: Finished difference Result 1218 states and 1264 transitions. [2018-01-29 23:51:07,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-29 23:51:07,794 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 624 [2018-01-29 23:51:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:51:07,797 INFO L225 Difference]: With dead ends: 1218 [2018-01-29 23:51:07,797 INFO L226 Difference]: Without dead ends: 1031 [2018-01-29 23:51:07,799 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3028 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1007, Invalid=9705, Unknown=0, NotChecked=0, Total=10712 [2018-01-29 23:51:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-01-29 23:51:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 775. [2018-01-29 23:51:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-01-29 23:51:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 791 transitions. [2018-01-29 23:51:07,844 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 791 transitions. Word has length 624 [2018-01-29 23:51:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:51:07,844 INFO L432 AbstractCegarLoop]: Abstraction has 775 states and 791 transitions. [2018-01-29 23:51:07,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-29 23:51:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 791 transitions. [2018-01-29 23:51:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-01-29 23:51:07,849 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:51:07,850 INFO L350 BasicCegarLoop]: trace histogram [61, 53, 53, 52, 52, 52, 52, 52, 52, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:51:07,850 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:51:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1500438281, now seen corresponding path program 13 times [2018-01-29 23:51:07,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:51:07,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:51:07,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:07,851 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:51:07,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:51:07,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:51:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 13622 backedges. 3855 proven. 360 refuted. 0 times theorem prover too weak. 9407 trivial. 0 not checked. [2018-01-29 23:51:09,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:51:09,502 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:51:09,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:51:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:51:09,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:51:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13622 backedges. 6925 proven. 268 refuted. 0 times theorem prover too weak. 6429 trivial. 0 not checked. [2018-01-29 23:51:10,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:51:10,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 36] total 59 [2018-01-29 23:51:10,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-29 23:51:10,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-29 23:51:10,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=3090, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 23:51:10,529 INFO L87 Difference]: Start difference. First operand 775 states and 791 transitions. Second operand 59 states. [2018-01-29 23:51:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:51:12,558 INFO L93 Difference]: Finished difference Result 1231 states and 1283 transitions. [2018-01-29 23:51:12,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-29 23:51:12,559 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 651 [2018-01-29 23:51:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:51:12,562 INFO L225 Difference]: With dead ends: 1231 [2018-01-29 23:51:12,562 INFO L226 Difference]: Without dead ends: 1121 [2018-01-29 23:51:12,563 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4745 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1851, Invalid=11955, Unknown=0, NotChecked=0, Total=13806 [2018-01-29 23:51:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-01-29 23:51:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 793. [2018-01-29 23:51:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-01-29 23:51:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 809 transitions. [2018-01-29 23:51:12,630 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 809 transitions. Word has length 651 [2018-01-29 23:51:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:51:12,631 INFO L432 AbstractCegarLoop]: Abstraction has 793 states and 809 transitions. [2018-01-29 23:51:12,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-29 23:51:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 809 transitions. [2018-01-29 23:51:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-01-29 23:51:12,637 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:51:12,638 INFO L350 BasicCegarLoop]: trace histogram [63, 55, 55, 54, 54, 54, 54, 54, 54, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:51:12,638 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:51:12,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1994254033, now seen corresponding path program 14 times [2018-01-29 23:51:12,638 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:51:12,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:51:12,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:12,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:51:12,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:51:12,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:51:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 14607 backedges. 5011 proven. 2220 refuted. 0 times theorem prover too weak. 7376 trivial. 0 not checked. [2018-01-29 23:51:14,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:51:14,844 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:51:14,849 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:51:14,872 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:14,932 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:14,942 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:51:14,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:51:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14607 backedges. 4797 proven. 312 refuted. 0 times theorem prover too weak. 9498 trivial. 0 not checked. [2018-01-29 23:51:15,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:51:15,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 42] total 78 [2018-01-29 23:51:15,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-29 23:51:15,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-29 23:51:15,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=5537, Unknown=0, NotChecked=0, Total=6006 [2018-01-29 23:51:15,988 INFO L87 Difference]: Start difference. First operand 793 states and 809 transitions. Second operand 78 states. [2018-01-29 23:51:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:51:21,105 INFO L93 Difference]: Finished difference Result 1819 states and 1886 transitions. [2018-01-29 23:51:21,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-01-29 23:51:21,106 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 669 [2018-01-29 23:51:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:51:21,110 INFO L225 Difference]: With dead ends: 1819 [2018-01-29 23:51:21,111 INFO L226 Difference]: Without dead ends: 1190 [2018-01-29 23:51:21,115 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12608 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4347, Invalid=34265, Unknown=0, NotChecked=0, Total=38612 [2018-01-29 23:51:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2018-01-29 23:51:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1110. [2018-01-29 23:51:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2018-01-29 23:51:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1143 transitions. [2018-01-29 23:51:21,194 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1143 transitions. Word has length 669 [2018-01-29 23:51:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:51:21,195 INFO L432 AbstractCegarLoop]: Abstraction has 1110 states and 1143 transitions. [2018-01-29 23:51:21,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-01-29 23:51:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1143 transitions. [2018-01-29 23:51:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2018-01-29 23:51:21,202 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:51:21,202 INFO L350 BasicCegarLoop]: trace histogram [73, 64, 64, 63, 63, 63, 63, 63, 63, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:51:21,202 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:51:21,203 INFO L82 PathProgramCache]: Analyzing trace with hash 669636959, now seen corresponding path program 15 times [2018-01-29 23:51:21,203 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:51:21,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:51:21,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:21,204 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:51:21,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:51:21,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:51:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 19782 backedges. 5433 proven. 416 refuted. 0 times theorem prover too weak. 13933 trivial. 0 not checked. [2018-01-29 23:51:23,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:51:23,826 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:51:23,831 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:51:23,858 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,864 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,870 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,878 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,889 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,901 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,914 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,929 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,946 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,967 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:51:23,971 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:51:23,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:51:23,983 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-01-29 23:51:23,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:51:23,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:51:23,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:51:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 19782 backedges. 5290 proven. 416 refuted. 0 times theorem prover too weak. 14076 trivial. 0 not checked. [2018-01-29 23:51:25,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:51:25,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 60 [2018-01-29 23:51:25,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-01-29 23:51:25,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-01-29 23:51:25,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=3122, Unknown=0, NotChecked=0, Total=3660 [2018-01-29 23:51:25,581 INFO L87 Difference]: Start difference. First operand 1110 states and 1143 transitions. Second operand 61 states. [2018-01-29 23:51:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:51:26,531 INFO L93 Difference]: Finished difference Result 1228 states and 1263 transitions. [2018-01-29 23:51:26,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 23:51:26,531 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 770 [2018-01-29 23:51:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:51:26,539 INFO L225 Difference]: With dead ends: 1228 [2018-01-29 23:51:26,539 INFO L226 Difference]: Without dead ends: 1227 [2018-01-29 23:51:26,540 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 725 SyntacticMatches, 17 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4355 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1485, Invalid=7445, Unknown=0, NotChecked=0, Total=8930 [2018-01-29 23:51:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-01-29 23:51:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1211. [2018-01-29 23:51:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-01-29 23:51:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1245 transitions. [2018-01-29 23:51:26,617 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1245 transitions. Word has length 770 [2018-01-29 23:51:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:51:26,617 INFO L432 AbstractCegarLoop]: Abstraction has 1211 states and 1245 transitions. [2018-01-29 23:51:26,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-01-29 23:51:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1245 transitions. [2018-01-29 23:51:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2018-01-29 23:51:26,623 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:51:26,623 INFO L350 BasicCegarLoop]: trace histogram [83, 73, 73, 72, 72, 72, 72, 72, 72, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:51:26,624 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:51:26,624 INFO L82 PathProgramCache]: Analyzing trace with hash -862619759, now seen corresponding path program 16 times [2018-01-29 23:51:26,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:51:26,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:51:26,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:26,625 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:51:26,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:51:26,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:51:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 25742 backedges. 6098 proven. 445 refuted. 0 times theorem prover too weak. 19199 trivial. 0 not checked. [2018-01-29 23:51:29,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:51:29,046 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:51:29,051 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:51:29,174 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:51:29,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:51:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 25742 backedges. 14216 proven. 342 refuted. 0 times theorem prover too weak. 11184 trivial. 0 not checked. [2018-01-29 23:51:30,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:51:30,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 40] total 64 [2018-01-29 23:51:30,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-01-29 23:51:30,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-01-29 23:51:30,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=3722, Unknown=0, NotChecked=0, Total=4032 [2018-01-29 23:51:30,254 INFO L87 Difference]: Start difference. First operand 1211 states and 1245 transitions. Second operand 64 states. [2018-01-29 23:51:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:51:33,421 INFO L93 Difference]: Finished difference Result 1549 states and 1598 transitions. [2018-01-29 23:51:33,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-29 23:51:33,421 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 871 [2018-01-29 23:51:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:51:33,425 INFO L225 Difference]: With dead ends: 1549 [2018-01-29 23:51:33,425 INFO L226 Difference]: Without dead ends: 1326 [2018-01-29 23:51:33,426 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4969 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1477, Invalid=15293, Unknown=0, NotChecked=0, Total=16770 [2018-01-29 23:51:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-01-29 23:51:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1229. [2018-01-29 23:51:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-01-29 23:51:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1262 transitions. [2018-01-29 23:51:33,508 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1262 transitions. Word has length 871 [2018-01-29 23:51:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:51:33,509 INFO L432 AbstractCegarLoop]: Abstraction has 1229 states and 1262 transitions. [2018-01-29 23:51:33,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-01-29 23:51:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1262 transitions. [2018-01-29 23:51:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-01-29 23:51:33,514 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:51:33,514 INFO L350 BasicCegarLoop]: trace histogram [86, 76, 76, 75, 75, 75, 75, 75, 75, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:51:33,515 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:51:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2088188952, now seen corresponding path program 17 times [2018-01-29 23:51:33,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:51:33,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:51:33,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:33,516 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:51:33,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:51:33,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:51:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 27785 backedges. 10498 proven. 2462 refuted. 0 times theorem prover too weak. 14825 trivial. 0 not checked. [2018-01-29 23:51:36,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:51:36,874 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:51:36,879 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:51:36,907 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:36,910 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:36,917 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:36,927 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:36,938 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:36,952 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:36,967 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:36,982 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:36,998 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:37,015 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:37,033 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:37,051 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:37,071 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:37,092 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:51:37,095 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:51:37,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:51:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 27785 backedges. 12382 proven. 1784 refuted. 0 times theorem prover too weak. 13619 trivial. 0 not checked. [2018-01-29 23:51:38,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:51:38,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 49] total 87 [2018-01-29 23:51:38,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-01-29 23:51:38,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-01-29 23:51:38,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=6838, Unknown=0, NotChecked=0, Total=7482 [2018-01-29 23:51:38,820 INFO L87 Difference]: Start difference. First operand 1229 states and 1262 transitions. Second operand 87 states. [2018-01-29 23:51:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:51:44,282 INFO L93 Difference]: Finished difference Result 1581 states and 1628 transitions. [2018-01-29 23:51:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-01-29 23:51:44,282 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 898 [2018-01-29 23:51:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:51:44,286 INFO L225 Difference]: With dead ends: 1581 [2018-01-29 23:51:44,287 INFO L226 Difference]: Without dead ends: 1450 [2018-01-29 23:51:44,288 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 1086 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17361 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5981, Invalid=43081, Unknown=0, NotChecked=0, Total=49062 [2018-01-29 23:51:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-01-29 23:51:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1357. [2018-01-29 23:51:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2018-01-29 23:51:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1390 transitions. [2018-01-29 23:51:44,382 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1390 transitions. Word has length 898 [2018-01-29 23:51:44,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:51:44,383 INFO L432 AbstractCegarLoop]: Abstraction has 1357 states and 1390 transitions. [2018-01-29 23:51:44,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-01-29 23:51:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1390 transitions. [2018-01-29 23:51:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2018-01-29 23:51:44,393 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:51:44,394 INFO L350 BasicCegarLoop]: trace histogram [99, 88, 88, 87, 87, 87, 87, 87, 87, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:51:44,394 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:51:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1001749371, now seen corresponding path program 18 times [2018-01-29 23:51:44,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:51:44,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:51:44,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:44,395 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:51:44,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:51:44,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:51:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 37152 backedges. 12971 proven. 2850 refuted. 0 times theorem prover too weak. 21331 trivial. 0 not checked. [2018-01-29 23:51:48,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:51:48,288 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:51:48,293 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:51:48,326 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,330 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,334 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,337 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,342 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,345 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,351 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,357 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,365 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,371 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,380 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,394 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,409 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,425 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,442 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,468 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,496 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,539 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,660 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:51:48,666 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:51:48,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:51:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 37152 backedges. 17784 proven. 3325 refuted. 0 times theorem prover too weak. 16043 trivial. 0 not checked. [2018-01-29 23:51:50,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:51:50,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 53] total 89 [2018-01-29 23:51:50,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-01-29 23:51:50,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-01-29 23:51:50,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=7122, Unknown=0, NotChecked=0, Total=7832 [2018-01-29 23:51:50,617 INFO L87 Difference]: Start difference. First operand 1357 states and 1390 transitions. Second operand 89 states. [2018-01-29 23:51:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:51:57,225 INFO L93 Difference]: Finished difference Result 3322 states and 3447 transitions. [2018-01-29 23:51:57,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-01-29 23:51:57,225 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1026 [2018-01-29 23:51:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:51:57,230 INFO L225 Difference]: With dead ends: 3322 [2018-01-29 23:51:57,230 INFO L226 Difference]: Without dead ends: 1619 [2018-01-29 23:51:57,235 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18937 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6433, Invalid=49499, Unknown=0, NotChecked=0, Total=55932 [2018-01-29 23:51:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-01-29 23:51:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1466. [2018-01-29 23:51:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-01-29 23:51:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1495 transitions. [2018-01-29 23:51:57,310 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1495 transitions. Word has length 1026 [2018-01-29 23:51:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:51:57,311 INFO L432 AbstractCegarLoop]: Abstraction has 1466 states and 1495 transitions. [2018-01-29 23:51:57,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-01-29 23:51:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1495 transitions. [2018-01-29 23:51:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1045 [2018-01-29 23:51:57,318 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:51:57,318 INFO L350 BasicCegarLoop]: trace histogram [101, 90, 90, 89, 89, 89, 89, 89, 89, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:51:57,318 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:51:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1325850219, now seen corresponding path program 19 times [2018-01-29 23:51:57,319 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:51:57,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:51:57,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:57,319 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:51:57,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:51:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:51:57,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 38779 backedges. 8353 proven. 539 refuted. 0 times theorem prover too weak. 29887 trivial. 0 not checked. [2018-01-29 23:52:00,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:00,578 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:52:00,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:00,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 38779 backedges. 21621 proven. 497 refuted. 0 times theorem prover too weak. 16661 trivial. 0 not checked. [2018-01-29 23:52:02,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:02,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 46] total 72 [2018-01-29 23:52:02,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-01-29 23:52:02,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-01-29 23:52:02,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=4723, Unknown=0, NotChecked=0, Total=5112 [2018-01-29 23:52:02,193 INFO L87 Difference]: Start difference. First operand 1466 states and 1495 transitions. Second operand 72 states. [2018-01-29 23:52:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:05,169 INFO L93 Difference]: Finished difference Result 1776 states and 1812 transitions. [2018-01-29 23:52:05,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-01-29 23:52:05,169 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1044 [2018-01-29 23:52:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:05,173 INFO L225 Difference]: With dead ends: 1776 [2018-01-29 23:52:05,173 INFO L226 Difference]: Without dead ends: 1447 [2018-01-29 23:52:05,175 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 1139 GetRequests, 1001 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5583 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1804, Invalid=17656, Unknown=0, NotChecked=0, Total=19460 [2018-01-29 23:52:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2018-01-29 23:52:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1395. [2018-01-29 23:52:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1395 states. [2018-01-29 23:52:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1416 transitions. [2018-01-29 23:52:05,247 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1416 transitions. Word has length 1044 [2018-01-29 23:52:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:05,247 INFO L432 AbstractCegarLoop]: Abstraction has 1395 states and 1416 transitions. [2018-01-29 23:52:05,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-01-29 23:52:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1416 transitions. [2018-01-29 23:52:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1173 [2018-01-29 23:52:05,256 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:05,257 INFO L350 BasicCegarLoop]: trace histogram [114, 102, 102, 101, 101, 101, 101, 101, 101, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:52:05,257 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 23:52:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 156008332, now seen corresponding path program 20 times [2018-01-29 23:52:05,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:05,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:05,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:05,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:05,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:05,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 49730 backedges. 16724 proven. 3377 refuted. 0 times theorem prover too weak. 29629 trivial. 0 not checked. [2018-01-29 23:52:10,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:10,187 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:52:10,191 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:52:10,228 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:10,332 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:10,350 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:10,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 49730 backedges. 19870 proven. 618 refuted. 0 times theorem prover too weak. 29242 trivial. 0 not checked. [2018-01-29 23:52:12,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:12,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 52] total 90 [2018-01-29 23:52:12,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-01-29 23:52:12,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-01-29 23:52:12,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=7192, Unknown=0, NotChecked=0, Total=8010 [2018-01-29 23:52:12,032 INFO L87 Difference]: Start difference. First operand 1395 states and 1416 transitions. Second operand 90 states. [2018-01-29 23:52:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:17,575 INFO L93 Difference]: Finished difference Result 1776 states and 1811 transitions. [2018-01-29 23:52:17,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-01-29 23:52:17,600 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1172 [2018-01-29 23:52:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:17,604 INFO L225 Difference]: With dead ends: 1776 [2018-01-29 23:52:17,604 INFO L226 Difference]: Without dead ends: 1636 [2018-01-29 23:52:17,608 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 1352 GetRequests, 1124 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18544 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6586, Invalid=46084, Unknown=0, NotChecked=0, Total=52670 [2018-01-29 23:52:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. Received shutdown request... [2018-01-29 23:52:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1570. [2018-01-29 23:52:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2018-01-29 23:52:17,683 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:52:17,687 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:52:17,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:52:17 BoogieIcfgContainer [2018-01-29 23:52:17,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:52:17,689 INFO L168 Benchmark]: Toolchain (without parser) took 113642.26 ms. Allocated memory was 299.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 260.2 MB in the beginning and 958.8 MB in the end (delta: -698.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-29 23:52:17,690 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 299.4 MB. Free memory is still 265.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:52:17,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.69 ms. Allocated memory is still 299.4 MB. Free memory was 259.2 MB in the beginning and 251.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:52:17,690 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 299.4 MB. Free memory was 251.1 MB in the beginning and 249.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:52:17,690 INFO L168 Benchmark]: RCFGBuilder took 273.34 ms. Allocated memory is still 299.4 MB. Free memory was 249.0 MB in the beginning and 232.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:52:17,691 INFO L168 Benchmark]: TraceAbstraction took 113139.27 ms. Allocated memory was 299.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 232.0 MB in the beginning and 958.8 MB in the end (delta: -726.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-29 23:52:17,693 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.23 ms. Allocated memory is still 299.4 MB. Free memory is still 265.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 182.69 ms. Allocated memory is still 299.4 MB. Free memory was 259.2 MB in the beginning and 251.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 299.4 MB. Free memory was 251.1 MB in the beginning and 249.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 273.34 ms. Allocated memory is still 299.4 MB. Free memory was 249.0 MB in the beginning and 232.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 113139.27 ms. Allocated memory was 299.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 232.0 MB in the beginning and 958.8 MB in the end (delta: -726.8 MB). Peak memory consumption was 1.2 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 ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 113.0s OverallTime, 36 OverallIterations, 114 TraceHistogramMax, 52.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2178 SDtfs, 16565 SDslu, 30844 SDs, 0 SdLazy, 38555 SolverSat, 2819 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14320 GetRequests, 11657 SyntacticMatches, 86 SemanticMatches, 2577 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120708 ImplicationChecksByTransitivity, 56.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1466occurred in iteration=34, 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: 1.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 2560 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 48.6s InterpolantComputationTime, 24643 NumberOfCodeBlocks, 23983 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 24575 ConstructedInterpolants, 1906 QuantifiedInterpolants, 53894659 SizeOfPredicates, 586 NumberOfNonLiveVariables, 21440 ConjunctsInSsa, 817 ConjunctsInUnsatCore, 68 InterpolantComputations, 6 PerfectInterpolantSequences, 527436/552446 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-52-17-702.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-52-17-702.csv Completed graceful shutdown