java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:17:50,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:17:50,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:17:50,904 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:17:50,904 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:17:50,905 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:17:50,906 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:17:50,907 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:17:50,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:17:50,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:17:50,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:17:50,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:17:50,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:17:50,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:17:50,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:17:50,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:17:50,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:17:50,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:17:50,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:17:50,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:17:50,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:17:50,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:17:50,923 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:17:50,924 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:17:50,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:17:50,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:17:50,926 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:17:50,927 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:17:50,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:17:50,927 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:17:50,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:17:50,928 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:17:50,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:17:50,938 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:17:50,939 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:17:50,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:17:50,939 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:17:50,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:17:50,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:17:50,939 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:17:50,940 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:17:50,940 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:17:50,940 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:17:50,940 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:17:50,940 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:17:50,940 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:17:50,941 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:17:50,941 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:17:50,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:17:50,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:17:50,941 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:17:50,941 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:17:50,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:17:50,942 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:17:50,942 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:17:50,942 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:17:50,942 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:17:50,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:17:50,984 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:17:50,987 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:17:50,988 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:17:50,989 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:17:50,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-02-04 00:17:51,110 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:17:51,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:17:51,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:17:51,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:17:51,117 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:17:51,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:17:51" (1/1) ... [2018-02-04 00:17:51,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73998beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51, skipping insertion in model container [2018-02-04 00:17:51,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:17:51" (1/1) ... [2018-02-04 00:17:51,133 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:17:51,143 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:17:51,242 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:17:51,254 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:17:51,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51 WrapperNode [2018-02-04 00:17:51,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:17:51,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:17:51,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:17:51,261 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:17:51,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51" (1/1) ... [2018-02-04 00:17:51,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51" (1/1) ... [2018-02-04 00:17:51,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51" (1/1) ... [2018-02-04 00:17:51,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51" (1/1) ... [2018-02-04 00:17:51,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51" (1/1) ... [2018-02-04 00:17:51,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51" (1/1) ... [2018-02-04 00:17:51,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51" (1/1) ... [2018-02-04 00:17:51,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:17:51,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:17:51,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:17:51,286 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:17:51,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:17:51,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:17:51,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:17:51,323 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 00:17:51,323 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:17:51,323 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 00:17:51,323 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 00:17:51,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:17:51,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:17:51,324 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:17:51,324 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 00:17:51,324 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:17:51,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:17:51,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:17:51,458 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:17:51,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:17:51 BoogieIcfgContainer [2018-02-04 00:17:51,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:17:51,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:17:51,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:17:51,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:17:51,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:17:51" (1/3) ... [2018-02-04 00:17:51,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb7109e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:17:51, skipping insertion in model container [2018-02-04 00:17:51,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:51" (2/3) ... [2018-02-04 00:17:51,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb7109e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:17:51, skipping insertion in model container [2018-02-04 00:17:51,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:17:51" (3/3) ... [2018-02-04 00:17:51,463 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-02-04 00:17:51,468 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:17:51,473 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 00:17:51,504 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:17:51,504 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:17:51,504 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:17:51,504 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:17:51,504 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:17:51,504 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:17:51,504 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:17:51,505 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:17:51,505 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:17:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 00:17:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 00:17:51,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:51,527 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:51,527 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 00:17:51,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:51,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:51,576 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:51,576 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:51,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:51,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:51,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:51,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:17:51,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:17:51,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:17:51,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:17:51,695 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 00:17:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:51,779 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 00:17:51,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:17:51,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 00:17:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:51,786 INFO L225 Difference]: With dead ends: 63 [2018-02-04 00:17:51,787 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 00:17:51,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:17:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 00:17:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 00:17:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 00:17:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 00:17:51,858 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 00:17:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:51,858 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 00:17:51,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:17:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 00:17:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 00:17:51,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:51,859 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:51,859 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:51,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 00:17:51,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:51,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:51,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:51,860 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:51,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:51,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:51,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:51,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:17:51,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:17:51,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:17:51,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:17:51,895 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-04 00:17:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:51,932 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 00:17:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:17:51,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 00:17:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:51,935 INFO L225 Difference]: With dead ends: 60 [2018-02-04 00:17:51,935 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 00:17:51,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:17:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 00:17:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-04 00:17:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 00:17:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 00:17:51,942 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-04 00:17:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:51,942 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 00:17:51,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:17:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 00:17:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:17:51,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:51,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:51,943 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:51,943 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 00:17:51,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:51,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:51,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:51,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:51,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:51,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:52,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:52,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:17:52,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:17:52,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:17:52,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:17:52,061 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-04 00:17:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:52,128 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 00:17:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:17:52,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 00:17:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:52,128 INFO L225 Difference]: With dead ends: 54 [2018-02-04 00:17:52,129 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 00:17:52,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:17:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 00:17:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 00:17:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 00:17:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-04 00:17:52,132 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-04 00:17:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:52,132 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-04 00:17:52,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:17:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-04 00:17:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:17:52,133 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:52,133 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:52,133 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 00:17:52,134 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:52,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:52,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,135 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:52,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:52,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:52,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:52,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:17:52,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:17:52,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:17:52,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:17:52,168 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-04 00:17:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:52,195 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 00:17:52,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:17:52,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 00:17:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:52,196 INFO L225 Difference]: With dead ends: 50 [2018-02-04 00:17:52,196 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 00:17:52,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:17:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 00:17:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 00:17:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 00:17:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 00:17:52,200 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-04 00:17:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:52,200 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 00:17:52,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:17:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 00:17:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 00:17:52,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:52,201 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:52,201 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 00:17:52,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:52,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:52,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,202 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:52,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:52,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:52,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:52,230 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:52,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:52,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:52,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:52,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-04 00:17:52,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:17:52,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:17:52,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:17:52,283 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-02-04 00:17:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:52,317 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-02-04 00:17:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:17:52,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 00:17:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:52,318 INFO L225 Difference]: With dead ends: 65 [2018-02-04 00:17:52,318 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 00:17:52,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:17:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 00:17:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-04 00:17:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 00:17:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-02-04 00:17:52,321 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-02-04 00:17:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:52,321 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-02-04 00:17:52,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:17:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-02-04 00:17:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:17:52,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:52,321 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:52,322 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 00:17:52,322 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:52,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:52,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,323 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:52,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:52,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:52,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:52,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:17:52,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:17:52,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:17:52,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:17:52,353 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-02-04 00:17:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:52,388 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-04 00:17:52,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:17:52,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 00:17:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:52,389 INFO L225 Difference]: With dead ends: 66 [2018-02-04 00:17:52,389 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 00:17:52,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:17:52,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 00:17:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-02-04 00:17:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 00:17:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 00:17:52,395 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2018-02-04 00:17:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:52,395 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 00:17:52,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:17:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 00:17:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:17:52,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:52,396 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:52,396 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:52,396 INFO L82 PathProgramCache]: Analyzing trace with hash -280350351, now seen corresponding path program 2 times [2018-02-04 00:17:52,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:52,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:52,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,397 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:52,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:52,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:52,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:52,465 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:52,472 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:17:52,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:17:52,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:52,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:52,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:17:52,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2018-02-04 00:17:52,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:17:52,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:17:52,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:17:52,584 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 12 states. [2018-02-04 00:17:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:52,752 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-02-04 00:17:52,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:17:52,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 00:17:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:52,754 INFO L225 Difference]: With dead ends: 88 [2018-02-04 00:17:52,754 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 00:17:52,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:17:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 00:17:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-02-04 00:17:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 00:17:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 00:17:52,759 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2018-02-04 00:17:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:52,759 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 00:17:52,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:17:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 00:17:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:17:52,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:52,760 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:52,760 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:52,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 00:17:52,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:52,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:52,761 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,761 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:52,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:52,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:52,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:52,787 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:52,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:52,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:52,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:17:52,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-02-04 00:17:52,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:17:52,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:17:52,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:17:52,865 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 7 states. [2018-02-04 00:17:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:52,963 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-02-04 00:17:52,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:17:52,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 00:17:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:52,964 INFO L225 Difference]: With dead ends: 104 [2018-02-04 00:17:52,964 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 00:17:52,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:17:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 00:17:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-02-04 00:17:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:17:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 00:17:52,970 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 31 [2018-02-04 00:17:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:52,970 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 00:17:52,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:17:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 00:17:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 00:17:52,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:52,972 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:52,972 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:52,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1033895800, now seen corresponding path program 1 times [2018-02-04 00:17:52,972 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:52,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:52,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,973 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:52,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:52,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 00:17:53,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:53,043 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:53,049 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:53,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 00:17:53,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:53,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 00:17:53,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:17:53,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:17:53,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:17:53,104 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 8 states. [2018-02-04 00:17:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:53,173 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 00:17:53,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:17:53,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 00:17:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:53,174 INFO L225 Difference]: With dead ends: 90 [2018-02-04 00:17:53,174 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 00:17:53,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 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-02-04 00:17:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 00:17:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-04 00:17:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:17:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-02-04 00:17:53,178 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2018-02-04 00:17:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:53,179 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-02-04 00:17:53,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:17:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-02-04 00:17:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:17:53,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:53,180 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:53,180 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:53,180 INFO L82 PathProgramCache]: Analyzing trace with hash -821508032, now seen corresponding path program 2 times [2018-02-04 00:17:53,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:53,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:53,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:53,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:53,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:53,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 00:17:53,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:53,248 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:53,253 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:17:53,272 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:17:53,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:53,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 00:17:53,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:53,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-04 00:17:53,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:17:53,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:17:53,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:17:53,316 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 5 states. [2018-02-04 00:17:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:53,409 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 00:17:53,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:17:53,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-04 00:17:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:53,410 INFO L225 Difference]: With dead ends: 93 [2018-02-04 00:17:53,410 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 00:17:53,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:17:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 00:17:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-02-04 00:17:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 00:17:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-04 00:17:53,415 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 52 [2018-02-04 00:17:53,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:53,415 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-04 00:17:53,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:17:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-04 00:17:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 00:17:53,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:53,417 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:53,417 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash -828115272, now seen corresponding path program 3 times [2018-02-04 00:17:53,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:53,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:53,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:53,418 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:53,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:53,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 00:17:53,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:53,515 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:53,526 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:17:53,541 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 00:17:53,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:53,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 63 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 00:17:53,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:53,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-02-04 00:17:53,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:17:53,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:17:53,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:17:53,617 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 14 states. [2018-02-04 00:17:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:53,777 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-02-04 00:17:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:17:53,777 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-04 00:17:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:53,778 INFO L225 Difference]: With dead ends: 128 [2018-02-04 00:17:53,778 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 00:17:53,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:17:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 00:17:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2018-02-04 00:17:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 00:17:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-04 00:17:53,784 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 58 [2018-02-04 00:17:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:53,784 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-04 00:17:53,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:17:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-04 00:17:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 00:17:53,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:53,786 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:53,786 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:53,786 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 1 times [2018-02-04 00:17:53,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:53,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:53,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:53,787 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:53,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:53,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 00:17:53,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:53,857 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:53,865 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:53,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 00:17:53,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:53,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-02-04 00:17:53,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:17:53,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:17:53,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:17:53,963 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 14 states. [2018-02-04 00:17:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:54,183 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-02-04 00:17:54,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:17:54,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-02-04 00:17:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:54,184 INFO L225 Difference]: With dead ends: 108 [2018-02-04 00:17:54,184 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 00:17:54,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-02-04 00:17:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 00:17:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2018-02-04 00:17:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 00:17:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-02-04 00:17:54,188 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 67 [2018-02-04 00:17:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:54,188 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-02-04 00:17:54,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:17:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-02-04 00:17:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 00:17:54,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:54,189 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:54,189 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash -85555777, now seen corresponding path program 4 times [2018-02-04 00:17:54,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:54,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:54,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:54,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:54,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:54,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-04 00:17:54,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:54,259 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:54,264 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:17:54,281 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:17:54,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:54,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-04 00:17:54,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:54,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-02-04 00:17:54,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:17:54,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:17:54,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:17:54,320 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 10 states. [2018-02-04 00:17:54,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:54,365 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-02-04 00:17:54,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:17:54,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-02-04 00:17:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:54,366 INFO L225 Difference]: With dead ends: 104 [2018-02-04 00:17:54,366 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 00:17:54,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:17:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 00:17:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-04 00:17:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 00:17:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-02-04 00:17:54,370 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 88 [2018-02-04 00:17:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:54,371 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-02-04 00:17:54,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:17:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-02-04 00:17:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 00:17:54,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:54,372 INFO L351 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:54,372 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash 414669047, now seen corresponding path program 5 times [2018-02-04 00:17:54,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:54,372 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:54,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:54,373 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:54,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:54,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 194 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-04 00:17:54,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:54,467 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:54,477 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:17:54,504 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 00:17:54,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:54,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 205 proven. 14 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-04 00:17:54,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:54,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-02-04 00:17:54,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 00:17:54,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 00:17:54,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:17:54,613 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 18 states. [2018-02-04 00:17:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:54,786 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-02-04 00:17:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:17:54,787 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-02-04 00:17:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:54,788 INFO L225 Difference]: With dead ends: 139 [2018-02-04 00:17:54,788 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 00:17:54,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2018-02-04 00:17:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 00:17:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2018-02-04 00:17:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 00:17:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-02-04 00:17:54,791 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 94 [2018-02-04 00:17:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:54,792 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-02-04 00:17:54,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 00:17:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-02-04 00:17:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 00:17:54,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:54,793 INFO L351 BasicCegarLoop]: trace histogram [16, 13, 12, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:54,793 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash 347418750, now seen corresponding path program 6 times [2018-02-04 00:17:54,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:54,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:54,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:54,794 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:54,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:54,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 00:17:54,901 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:54,901 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:54,906 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:17:54,936 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 00:17:54,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:54,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 313 proven. 119 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-02-04 00:17:55,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:55,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-02-04 00:17:55,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:17:55,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:17:55,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:17:55,054 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 21 states. [2018-02-04 00:17:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:55,402 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-02-04 00:17:55,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 00:17:55,402 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 124 [2018-02-04 00:17:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:55,403 INFO L225 Difference]: With dead ends: 145 [2018-02-04 00:17:55,403 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 00:17:55,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 00:17:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 00:17:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2018-02-04 00:17:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 00:17:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-02-04 00:17:55,406 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 124 [2018-02-04 00:17:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:55,407 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-02-04 00:17:55,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:17:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-02-04 00:17:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-02-04 00:17:55,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:55,409 INFO L351 BasicCegarLoop]: trace histogram [17, 14, 13, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:55,409 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash 714000310, now seen corresponding path program 7 times [2018-02-04 00:17:55,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:55,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:55,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:55,410 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:55,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:55,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 00:17:55,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:55,502 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:55,510 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:55,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 00:17:55,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:55,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 00:17:55,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:17:55,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:17:55,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:17:55,598 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 7 states. [2018-02-04 00:17:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:55,673 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-02-04 00:17:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:17:55,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-02-04 00:17:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:55,674 INFO L225 Difference]: With dead ends: 146 [2018-02-04 00:17:55,674 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 00:17:55,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:17:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 00:17:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-02-04 00:17:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 00:17:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-04 00:17:55,677 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 130 [2018-02-04 00:17:55,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:55,677 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-04 00:17:55,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:17:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-04 00:17:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-04 00:17:55,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:55,679 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 14, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:55,679 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1770915246, now seen corresponding path program 8 times [2018-02-04 00:17:55,679 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:55,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:55,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:55,680 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:55,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:55,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 00:17:55,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:55,813 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:55,817 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:17:55,840 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:17:55,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:55,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 411 proven. 30 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 00:17:55,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:55,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-02-04 00:17:55,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:17:55,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:17:55,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:17:55,959 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 21 states. [2018-02-04 00:17:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:56,163 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2018-02-04 00:17:56,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:17:56,164 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 136 [2018-02-04 00:17:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:56,164 INFO L225 Difference]: With dead ends: 187 [2018-02-04 00:17:56,164 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 00:17:56,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2018-02-04 00:17:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 00:17:56,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 182. [2018-02-04 00:17:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 00:17:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2018-02-04 00:17:56,168 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 136 [2018-02-04 00:17:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:56,168 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2018-02-04 00:17:56,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:17:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-02-04 00:17:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 00:17:56,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:56,169 INFO L351 BasicCegarLoop]: trace histogram [23, 19, 18, 18, 18, 18, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:56,169 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:56,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1745720749, now seen corresponding path program 9 times [2018-02-04 00:17:56,169 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:56,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:56,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:56,170 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:56,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:56,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-04 00:17:56,284 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:56,285 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:56,290 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:17:56,313 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 00:17:56,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:56,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 503 proven. 57 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-02-04 00:17:56,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:56,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 00:17:56,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:17:56,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:17:56,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:17:56,410 INFO L87 Difference]: Start difference. First operand 182 states and 185 transitions. Second operand 22 states. [2018-02-04 00:17:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:56,793 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-02-04 00:17:56,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 00:17:56,793 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 172 [2018-02-04 00:17:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:56,794 INFO L225 Difference]: With dead ends: 242 [2018-02-04 00:17:56,794 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 00:17:56,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=365, Invalid=1705, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 00:17:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 00:17:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2018-02-04 00:17:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-04 00:17:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2018-02-04 00:17:56,800 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 172 [2018-02-04 00:17:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:56,800 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2018-02-04 00:17:56,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:17:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2018-02-04 00:17:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-02-04 00:17:56,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:56,801 INFO L351 BasicCegarLoop]: trace histogram [30, 25, 24, 24, 24, 24, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:56,801 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1417597148, now seen corresponding path program 10 times [2018-02-04 00:17:56,802 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:56,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:56,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:56,803 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:56,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:56,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 1280 proven. 70 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2018-02-04 00:17:57,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:57,030 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:57,038 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:17:57,086 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:17:57,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:57,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 1280 proven. 70 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2018-02-04 00:17:57,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:57,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-02-04 00:17:57,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 00:17:57,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 00:17:57,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:17:57,220 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand 20 states. [2018-02-04 00:17:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:57,391 INFO L93 Difference]: Finished difference Result 250 states and 252 transitions. [2018-02-04 00:17:57,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:17:57,392 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 220 [2018-02-04 00:17:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:57,393 INFO L225 Difference]: With dead ends: 250 [2018-02-04 00:17:57,393 INFO L226 Difference]: Without dead ends: 244 [2018-02-04 00:17:57,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:17:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-04 00:17:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 235. [2018-02-04 00:17:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-04 00:17:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 237 transitions. [2018-02-04 00:17:57,398 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 237 transitions. Word has length 220 [2018-02-04 00:17:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:57,398 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 237 transitions. [2018-02-04 00:17:57,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 00:17:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 237 transitions. [2018-02-04 00:17:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-02-04 00:17:57,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:57,399 INFO L351 BasicCegarLoop]: trace histogram [31, 26, 25, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:57,399 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:57,399 INFO L82 PathProgramCache]: Analyzing trace with hash 11647380, now seen corresponding path program 11 times [2018-02-04 00:17:57,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:57,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:57,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:57,400 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:57,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:57,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 720 proven. 75 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 00:17:57,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:57,510 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:57,515 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:17:57,566 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-04 00:17:57,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:57,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 720 proven. 75 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 00:17:57,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:57,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-02-04 00:17:57,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:17:57,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:17:57,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:17:57,626 INFO L87 Difference]: Start difference. First operand 235 states and 237 transitions. Second operand 15 states. [2018-02-04 00:17:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:57,700 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-02-04 00:17:57,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:17:57,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 226 [2018-02-04 00:17:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:57,701 INFO L225 Difference]: With dead ends: 243 [2018-02-04 00:17:57,701 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 00:17:57,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:17:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 00:17:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 236. [2018-02-04 00:17:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 00:17:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2018-02-04 00:17:57,704 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 226 [2018-02-04 00:17:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:57,705 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2018-02-04 00:17:57,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:17:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2018-02-04 00:17:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 00:17:57,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:57,705 INFO L351 BasicCegarLoop]: trace histogram [32, 27, 26, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:57,705 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:57,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1000315148, now seen corresponding path program 12 times [2018-02-04 00:17:57,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:57,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:57,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:57,706 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:57,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:57,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 00:17:57,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:57,814 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:57,820 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:17:57,880 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-02-04 00:17:57,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:57,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 00:17:57,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:57,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-02-04 00:17:57,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:17:57,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:17:57,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:17:57,949 INFO L87 Difference]: Start difference. First operand 236 states and 238 transitions. Second operand 14 states. [2018-02-04 00:17:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:58,032 INFO L93 Difference]: Finished difference Result 261 states and 265 transitions. [2018-02-04 00:17:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:17:58,032 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 232 [2018-02-04 00:17:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:58,033 INFO L225 Difference]: With dead ends: 261 [2018-02-04 00:17:58,033 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 00:17:58,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:17:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 00:17:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 242. [2018-02-04 00:17:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 00:17:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 245 transitions. [2018-02-04 00:17:58,036 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 245 transitions. Word has length 232 [2018-02-04 00:17:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:58,036 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 245 transitions. [2018-02-04 00:17:58,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:17:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 245 transitions. [2018-02-04 00:17:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-04 00:17:58,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:58,037 INFO L351 BasicCegarLoop]: trace histogram [33, 28, 27, 27, 27, 27, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:58,037 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:58,037 INFO L82 PathProgramCache]: Analyzing trace with hash 710278788, now seen corresponding path program 13 times [2018-02-04 00:17:58,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:58,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:58,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:58,038 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:58,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:58,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-02-04 00:17:58,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:58,224 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:58,229 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:58,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1132 proven. 80 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-02-04 00:17:58,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:58,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 27 [2018-02-04 00:17:58,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 00:17:58,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 00:17:58,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:17:58,423 INFO L87 Difference]: Start difference. First operand 242 states and 245 transitions. Second operand 27 states. [2018-02-04 00:17:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:58,722 INFO L93 Difference]: Finished difference Result 310 states and 314 transitions. [2018-02-04 00:17:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:17:58,724 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 238 [2018-02-04 00:17:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:58,725 INFO L225 Difference]: With dead ends: 310 [2018-02-04 00:17:58,726 INFO L226 Difference]: Without dead ends: 310 [2018-02-04 00:17:58,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=429, Invalid=1131, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:17:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-02-04 00:17:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 302. [2018-02-04 00:17:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-04 00:17:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 306 transitions. [2018-02-04 00:17:58,731 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 306 transitions. Word has length 238 [2018-02-04 00:17:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:58,731 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 306 transitions. [2018-02-04 00:17:58,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 00:17:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 306 transitions. [2018-02-04 00:17:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-02-04 00:17:58,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:58,733 INFO L351 BasicCegarLoop]: trace histogram [40, 34, 33, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:58,733 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:58,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1500368397, now seen corresponding path program 14 times [2018-02-04 00:17:58,733 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:58,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:58,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:58,734 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:58,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:58,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-02-04 00:17:59,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:59,027 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:59,036 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:17:59,091 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:17:59,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:59,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-02-04 00:17:59,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:17:59,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-02-04 00:17:59,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:17:59,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:17:59,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:17:59,232 INFO L87 Difference]: Start difference. First operand 302 states and 306 transitions. Second operand 23 states. [2018-02-04 00:17:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:59,654 INFO L93 Difference]: Finished difference Result 314 states and 316 transitions. [2018-02-04 00:17:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:17:59,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 286 [2018-02-04 00:17:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:59,655 INFO L225 Difference]: With dead ends: 314 [2018-02-04 00:17:59,655 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 00:17:59,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2018-02-04 00:17:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 00:17:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2018-02-04 00:17:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-04 00:17:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 304 transitions. [2018-02-04 00:17:59,661 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 304 transitions. Word has length 286 [2018-02-04 00:17:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:59,662 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 304 transitions. [2018-02-04 00:17:59,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:17:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 304 transitions. [2018-02-04 00:17:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 00:17:59,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:59,663 INFO L351 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:59,663 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:17:59,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1441975659, now seen corresponding path program 15 times [2018-02-04 00:17:59,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:59,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:59,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:59,664 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:17:59,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:59,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-02-04 00:17:59,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:17:59,859 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:17:59,864 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:17:59,928 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-02-04 00:17:59,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:17:59,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:17:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-02-04 00:18:00,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:00,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-02-04 00:18:00,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:18:00,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:18:00,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:18:00,027 INFO L87 Difference]: Start difference. First operand 302 states and 304 transitions. Second operand 12 states. [2018-02-04 00:18:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:00,143 INFO L93 Difference]: Finished difference Result 317 states and 320 transitions. [2018-02-04 00:18:00,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:18:00,143 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 292 [2018-02-04 00:18:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:00,145 INFO L225 Difference]: With dead ends: 317 [2018-02-04 00:18:00,145 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 00:18:00,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:18:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 00:18:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 308. [2018-02-04 00:18:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 00:18:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 311 transitions. [2018-02-04 00:18:00,152 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 311 transitions. Word has length 292 [2018-02-04 00:18:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:00,153 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 311 transitions. [2018-02-04 00:18:00,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:18:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 311 transitions. [2018-02-04 00:18:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-02-04 00:18:00,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:00,155 INFO L351 BasicCegarLoop]: trace histogram [42, 36, 35, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:00,155 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1608658851, now seen corresponding path program 16 times [2018-02-04 00:18:00,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:00,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:00,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:00,156 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:00,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:00,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1660 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-04 00:18:00,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:00,503 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:00,509 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:18:00,555 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:18:00,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:00,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1683 proven. 114 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-04 00:18:00,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:00,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 30 [2018-02-04 00:18:00,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 00:18:00,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 00:18:00,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2018-02-04 00:18:00,751 INFO L87 Difference]: Start difference. First operand 308 states and 311 transitions. Second operand 30 states. [2018-02-04 00:18:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:01,064 INFO L93 Difference]: Finished difference Result 376 states and 380 transitions. [2018-02-04 00:18:01,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:18:01,065 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 298 [2018-02-04 00:18:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:01,066 INFO L225 Difference]: With dead ends: 376 [2018-02-04 00:18:01,066 INFO L226 Difference]: Without dead ends: 376 [2018-02-04 00:18:01,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=538, Invalid=1442, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 00:18:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-02-04 00:18:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2018-02-04 00:18:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 00:18:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 372 transitions. [2018-02-04 00:18:01,070 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 372 transitions. Word has length 298 [2018-02-04 00:18:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:01,070 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 372 transitions. [2018-02-04 00:18:01,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 00:18:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 372 transitions. [2018-02-04 00:18:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-02-04 00:18:01,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:01,071 INFO L351 BasicCegarLoop]: trace histogram [50, 43, 42, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:01,071 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:01,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1060515318, now seen corresponding path program 17 times [2018-02-04 00:18:01,072 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:01,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:01,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:01,072 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:01,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:01,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-02-04 00:18:01,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:01,337 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:01,342 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:18:01,431 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-02-04 00:18:01,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:01,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-02-04 00:18:01,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:01,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-02-04 00:18:01,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 00:18:01,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 00:18:01,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-02-04 00:18:01,565 INFO L87 Difference]: Start difference. First operand 368 states and 372 transitions. Second operand 26 states. [2018-02-04 00:18:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:01,719 INFO L93 Difference]: Finished difference Result 380 states and 382 transitions. [2018-02-04 00:18:01,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:18:01,719 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 352 [2018-02-04 00:18:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:01,721 INFO L225 Difference]: With dead ends: 380 [2018-02-04 00:18:01,721 INFO L226 Difference]: Without dead ends: 374 [2018-02-04 00:18:01,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2018-02-04 00:18:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-02-04 00:18:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2018-02-04 00:18:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 00:18:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 370 transitions. [2018-02-04 00:18:01,727 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 370 transitions. Word has length 352 [2018-02-04 00:18:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:01,728 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 370 transitions. [2018-02-04 00:18:01,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 00:18:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 370 transitions. [2018-02-04 00:18:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-02-04 00:18:01,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:01,730 INFO L351 BasicCegarLoop]: trace histogram [51, 44, 43, 43, 43, 43, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:01,730 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:01,730 INFO L82 PathProgramCache]: Analyzing trace with hash -211464126, now seen corresponding path program 18 times [2018-02-04 00:18:01,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:01,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:01,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:01,731 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:01,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:01,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-02-04 00:18:02,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:02,183 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:02,190 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:18:02,269 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-02-04 00:18:02,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:02,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1955 proven. 162 refuted. 0 times theorem prover too weak. 4333 trivial. 0 not checked. [2018-02-04 00:18:02,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:02,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2018-02-04 00:18:02,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 00:18:02,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 00:18:02,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:18:02,498 INFO L87 Difference]: Start difference. First operand 368 states and 370 transitions. Second operand 24 states. [2018-02-04 00:18:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:03,501 INFO L93 Difference]: Finished difference Result 458 states and 463 transitions. [2018-02-04 00:18:03,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 00:18:03,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 358 [2018-02-04 00:18:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:03,503 INFO L225 Difference]: With dead ends: 458 [2018-02-04 00:18:03,503 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 00:18:03,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 00:18:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 00:18:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 434. [2018-02-04 00:18:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-04 00:18:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 438 transitions. [2018-02-04 00:18:03,507 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 438 transitions. Word has length 358 [2018-02-04 00:18:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:03,508 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 438 transitions. [2018-02-04 00:18:03,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 00:18:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 438 transitions. [2018-02-04 00:18:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-02-04 00:18:03,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:03,509 INFO L351 BasicCegarLoop]: trace histogram [61, 53, 52, 52, 52, 52, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:03,509 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -894569959, now seen corresponding path program 19 times [2018-02-04 00:18:03,509 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:03,509 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:03,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:03,510 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:03,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:03,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-02-04 00:18:03,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:03,865 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:03,870 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:18:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:03,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-02-04 00:18:04,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:04,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-02-04 00:18:04,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 00:18:04,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 00:18:04,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-02-04 00:18:04,084 INFO L87 Difference]: Start difference. First operand 434 states and 438 transitions. Second operand 29 states. [2018-02-04 00:18:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:04,400 INFO L93 Difference]: Finished difference Result 456 states and 459 transitions. [2018-02-04 00:18:04,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:18:04,400 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 424 [2018-02-04 00:18:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:04,402 INFO L225 Difference]: With dead ends: 456 [2018-02-04 00:18:04,402 INFO L226 Difference]: Without dead ends: 450 [2018-02-04 00:18:04,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 00:18:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-02-04 00:18:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 440. [2018-02-04 00:18:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-04 00:18:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 443 transitions. [2018-02-04 00:18:04,409 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 443 transitions. Word has length 424 [2018-02-04 00:18:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:04,409 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 443 transitions. [2018-02-04 00:18:04,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 00:18:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 443 transitions. [2018-02-04 00:18:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-02-04 00:18:04,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:04,412 INFO L351 BasicCegarLoop]: trace histogram [62, 54, 53, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:04,413 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1459193583, now seen corresponding path program 20 times [2018-02-04 00:18:04,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:04,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:04,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:04,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:18:04,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:04,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 00:18:04,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:04,825 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:04,832 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:18:04,930 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:18:04,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:04,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 00:18:05,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:05,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-02-04 00:18:05,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:18:05,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:18:05,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:18:05,130 INFO L87 Difference]: Start difference. First operand 440 states and 443 transitions. Second operand 22 states. [2018-02-04 00:18:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:05,285 INFO L93 Difference]: Finished difference Result 468 states and 473 transitions. [2018-02-04 00:18:05,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:18:05,285 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 430 [2018-02-04 00:18:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:05,286 INFO L225 Difference]: With dead ends: 468 [2018-02-04 00:18:05,286 INFO L226 Difference]: Without dead ends: 468 [2018-02-04 00:18:05,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:18:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-04 00:18:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 446. [2018-02-04 00:18:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-04 00:18:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 450 transitions. [2018-02-04 00:18:05,292 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 450 transitions. Word has length 430 [2018-02-04 00:18:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:05,293 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 450 transitions. [2018-02-04 00:18:05,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:18:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 450 transitions. [2018-02-04 00:18:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-02-04 00:18:05,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:05,295 INFO L351 BasicCegarLoop]: trace histogram [63, 55, 54, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:05,295 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash -275511607, now seen corresponding path program 21 times [2018-02-04 00:18:05,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:05,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:05,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:05,296 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:05,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:05,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-04 00:18:05,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:05,843 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:05,850 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:18:05,965 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-02-04 00:18:05,966 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:05,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 2948 proven. 300 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 00:18:06,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:06,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 36 [2018-02-04 00:18:06,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 00:18:06,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 00:18:06,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 00:18:06,169 INFO L87 Difference]: Start difference. First operand 446 states and 450 transitions. Second operand 36 states. [2018-02-04 00:18:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:06,970 INFO L93 Difference]: Finished difference Result 550 states and 556 transitions. [2018-02-04 00:18:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 00:18:06,975 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 436 [2018-02-04 00:18:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:06,977 INFO L225 Difference]: With dead ends: 550 [2018-02-04 00:18:06,977 INFO L226 Difference]: Without dead ends: 550 [2018-02-04 00:18:06,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=898, Invalid=3524, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 00:18:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-02-04 00:18:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 530. [2018-02-04 00:18:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-04 00:18:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 536 transitions. [2018-02-04 00:18:06,985 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 536 transitions. Word has length 436 [2018-02-04 00:18:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:06,985 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 536 transitions. [2018-02-04 00:18:06,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 00:18:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 536 transitions. [2018-02-04 00:18:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-02-04 00:18:06,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:06,988 INFO L351 BasicCegarLoop]: trace histogram [74, 65, 64, 64, 64, 64, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:06,988 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:06,989 INFO L82 PathProgramCache]: Analyzing trace with hash -619007464, now seen corresponding path program 22 times [2018-02-04 00:18:06,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:06,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:06,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:06,989 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:06,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:07,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 6782 proven. 234 refuted. 0 times theorem prover too weak. 6919 trivial. 0 not checked. [2018-02-04 00:18:07,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:07,748 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:07,754 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:18:07,825 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:18:07,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:07,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 6782 proven. 234 refuted. 0 times theorem prover too weak. 6919 trivial. 0 not checked. [2018-02-04 00:18:08,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:08,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-02-04 00:18:08,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 00:18:08,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 00:18:08,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-02-04 00:18:08,117 INFO L87 Difference]: Start difference. First operand 530 states and 536 transitions. Second operand 32 states. [2018-02-04 00:18:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:08,505 INFO L93 Difference]: Finished difference Result 542 states and 546 transitions. [2018-02-04 00:18:08,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 00:18:08,505 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 508 [2018-02-04 00:18:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:08,506 INFO L225 Difference]: With dead ends: 542 [2018-02-04 00:18:08,507 INFO L226 Difference]: Without dead ends: 536 [2018-02-04 00:18:08,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=375, Invalid=1185, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:18:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-02-04 00:18:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 530. [2018-02-04 00:18:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-04 00:18:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 534 transitions. [2018-02-04 00:18:08,511 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 534 transitions. Word has length 508 [2018-02-04 00:18:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:08,511 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 534 transitions. [2018-02-04 00:18:08,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 00:18:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 534 transitions. [2018-02-04 00:18:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-02-04 00:18:08,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:08,513 INFO L351 BasicCegarLoop]: trace histogram [75, 66, 65, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:08,513 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash -387441200, now seen corresponding path program 23 times [2018-02-04 00:18:08,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:08,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:08,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:08,514 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:08,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:08,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-02-04 00:18:09,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:09,114 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:09,119 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:18:09,311 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-02-04 00:18:09,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:09,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4217 proven. 1477 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2018-02-04 00:18:09,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:09,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 43 [2018-02-04 00:18:09,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 00:18:09,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 00:18:09,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 00:18:09,832 INFO L87 Difference]: Start difference. First operand 530 states and 534 transitions. Second operand 43 states. [2018-02-04 00:18:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:10,649 INFO L93 Difference]: Finished difference Result 619 states and 624 transitions. [2018-02-04 00:18:10,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 00:18:10,649 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 514 [2018-02-04 00:18:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:10,651 INFO L225 Difference]: With dead ends: 619 [2018-02-04 00:18:10,651 INFO L226 Difference]: Without dead ends: 619 [2018-02-04 00:18:10,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=933, Invalid=3489, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 00:18:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-04 00:18:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 608. [2018-02-04 00:18:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-02-04 00:18:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 613 transitions. [2018-02-04 00:18:10,656 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 613 transitions. Word has length 514 [2018-02-04 00:18:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:10,656 INFO L432 AbstractCegarLoop]: Abstraction has 608 states and 613 transitions. [2018-02-04 00:18:10,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 00:18:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 613 transitions. [2018-02-04 00:18:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-02-04 00:18:10,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:10,659 INFO L351 BasicCegarLoop]: trace histogram [86, 76, 75, 75, 75, 75, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:10,659 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash 595794463, now seen corresponding path program 24 times [2018-02-04 00:18:10,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:10,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:10,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:10,660 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:10,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:10,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 8549 proven. 290 refuted. 0 times theorem prover too weak. 10146 trivial. 0 not checked. [2018-02-04 00:18:11,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:11,496 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:11,501 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:18:11,696 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 00:18:11,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:11,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 4718 proven. 321 refuted. 0 times theorem prover too weak. 13946 trivial. 0 not checked. [2018-02-04 00:18:11,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:11,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 40 [2018-02-04 00:18:11,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 00:18:11,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 00:18:11,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:18:11,973 INFO L87 Difference]: Start difference. First operand 608 states and 613 transitions. Second operand 40 states. [2018-02-04 00:18:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:12,999 INFO L93 Difference]: Finished difference Result 710 states and 714 transitions. [2018-02-04 00:18:12,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 00:18:12,999 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 586 [2018-02-04 00:18:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:13,001 INFO L225 Difference]: With dead ends: 710 [2018-02-04 00:18:13,001 INFO L226 Difference]: Without dead ends: 701 [2018-02-04 00:18:13,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1403, Invalid=7339, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 00:18:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-04 00:18:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 686. [2018-02-04 00:18:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-02-04 00:18:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 690 transitions. [2018-02-04 00:18:13,008 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 690 transitions. Word has length 586 [2018-02-04 00:18:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:13,008 INFO L432 AbstractCegarLoop]: Abstraction has 686 states and 690 transitions. [2018-02-04 00:18:13,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 00:18:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 690 transitions. [2018-02-04 00:18:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2018-02-04 00:18:13,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:13,011 INFO L351 BasicCegarLoop]: trace histogram [99, 88, 87, 87, 87, 87, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:13,011 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:13,011 INFO L82 PathProgramCache]: Analyzing trace with hash 369724190, now seen corresponding path program 25 times [2018-02-04 00:18:13,011 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:13,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:13,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:13,012 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:13,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:13,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 25358 backedges. 10583 proven. 352 refuted. 0 times theorem prover too weak. 14423 trivial. 0 not checked. [2018-02-04 00:18:13,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:13,908 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:13,913 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:18:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:13,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 25358 backedges. 10583 proven. 352 refuted. 0 times theorem prover too weak. 14423 trivial. 0 not checked. [2018-02-04 00:18:14,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:14,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-02-04 00:18:14,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 00:18:14,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 00:18:14,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 00:18:14,327 INFO L87 Difference]: Start difference. First operand 686 states and 690 transitions. Second operand 38 states. [2018-02-04 00:18:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:14,805 INFO L93 Difference]: Finished difference Result 718 states and 722 transitions. [2018-02-04 00:18:14,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 00:18:14,805 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 670 [2018-02-04 00:18:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:14,807 INFO L225 Difference]: With dead ends: 718 [2018-02-04 00:18:14,807 INFO L226 Difference]: Without dead ends: 712 [2018-02-04 00:18:14,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=534, Invalid=1722, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 00:18:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-02-04 00:18:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 697. [2018-02-04 00:18:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-02-04 00:18:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 701 transitions. [2018-02-04 00:18:14,815 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 701 transitions. Word has length 670 [2018-02-04 00:18:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:14,816 INFO L432 AbstractCegarLoop]: Abstraction has 697 states and 701 transitions. [2018-02-04 00:18:14,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 00:18:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 701 transitions. [2018-02-04 00:18:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-02-04 00:18:14,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:14,821 INFO L351 BasicCegarLoop]: trace histogram [100, 89, 88, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:14,821 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:14,821 INFO L82 PathProgramCache]: Analyzing trace with hash 519412310, now seen corresponding path program 26 times [2018-02-04 00:18:14,821 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:14,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:14,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:14,822 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:18:14,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:14,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 5577 proven. 363 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-02-04 00:18:15,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:15,635 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:15,640 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:18:15,728 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:18:15,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:15,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 5577 proven. 363 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-02-04 00:18:15,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:15,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-02-04 00:18:15,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 00:18:15,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 00:18:15,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-02-04 00:18:15,906 INFO L87 Difference]: Start difference. First operand 697 states and 701 transitions. Second operand 26 states. [2018-02-04 00:18:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:16,133 INFO L93 Difference]: Finished difference Result 711 states and 715 transitions. [2018-02-04 00:18:16,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:18:16,133 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 676 [2018-02-04 00:18:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:16,135 INFO L225 Difference]: With dead ends: 711 [2018-02-04 00:18:16,135 INFO L226 Difference]: Without dead ends: 711 [2018-02-04 00:18:16,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 664 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-02-04 00:18:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-02-04 00:18:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 698. [2018-02-04 00:18:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-02-04 00:18:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 702 transitions. [2018-02-04 00:18:16,143 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 702 transitions. Word has length 676 [2018-02-04 00:18:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:16,143 INFO L432 AbstractCegarLoop]: Abstraction has 698 states and 702 transitions. [2018-02-04 00:18:16,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 00:18:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 702 transitions. [2018-02-04 00:18:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-02-04 00:18:16,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:16,148 INFO L351 BasicCegarLoop]: trace histogram [101, 90, 89, 89, 89, 89, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:16,148 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash -436969394, now seen corresponding path program 27 times [2018-02-04 00:18:16,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:16,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:16,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:16,150 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:16,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:16,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-02-04 00:18:16,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:16,674 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:16,679 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:18:16,849 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-02-04 00:18:16,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:16,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-02-04 00:18:17,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:17,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-02-04 00:18:17,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:18:17,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:18:17,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:18:17,222 INFO L87 Difference]: Start difference. First operand 698 states and 702 transitions. Second operand 22 states. [2018-02-04 00:18:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:17,398 INFO L93 Difference]: Finished difference Result 729 states and 735 transitions. [2018-02-04 00:18:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:18:17,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 682 [2018-02-04 00:18:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:17,400 INFO L225 Difference]: With dead ends: 729 [2018-02-04 00:18:17,400 INFO L226 Difference]: Without dead ends: 729 [2018-02-04 00:18:17,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=321, Invalid=735, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 00:18:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-02-04 00:18:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 704. [2018-02-04 00:18:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-02-04 00:18:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 709 transitions. [2018-02-04 00:18:17,405 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 709 transitions. Word has length 682 [2018-02-04 00:18:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:17,405 INFO L432 AbstractCegarLoop]: Abstraction has 704 states and 709 transitions. [2018-02-04 00:18:17,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:18:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 709 transitions. [2018-02-04 00:18:17,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-02-04 00:18:17,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:17,408 INFO L351 BasicCegarLoop]: trace histogram [102, 91, 90, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:17,408 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:17,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1628752966, now seen corresponding path program 28 times [2018-02-04 00:18:17,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:17,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:17,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:17,409 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:17,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:17,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7025 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-04 00:18:18,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:18,267 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:18:18,275 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:18:18,352 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:18:18,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:18,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7063 proven. 374 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-04 00:18:18,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:18,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 45 [2018-02-04 00:18:18,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 00:18:18,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 00:18:18,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1514, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 00:18:18,860 INFO L87 Difference]: Start difference. First operand 704 states and 709 transitions. Second operand 45 states. [2018-02-04 00:18:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:19,602 INFO L93 Difference]: Finished difference Result 814 states and 820 transitions. [2018-02-04 00:18:19,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 00:18:19,602 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 688 [2018-02-04 00:18:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:19,604 INFO L225 Difference]: With dead ends: 814 [2018-02-04 00:18:19,604 INFO L226 Difference]: Without dead ends: 814 [2018-02-04 00:18:19,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1263, Invalid=3567, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 00:18:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2018-02-04 00:18:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 800. [2018-02-04 00:18:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-02-04 00:18:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 806 transitions. [2018-02-04 00:18:19,609 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 806 transitions. Word has length 688 [2018-02-04 00:18:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:19,610 INFO L432 AbstractCegarLoop]: Abstraction has 800 states and 806 transitions. [2018-02-04 00:18:19,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 00:18:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 806 transitions. [2018-02-04 00:18:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-02-04 00:18:19,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:19,613 INFO L351 BasicCegarLoop]: trace histogram [115, 103, 102, 102, 102, 102, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:19,613 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash 47189509, now seen corresponding path program 29 times [2018-02-04 00:18:19,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:19,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:19,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:19,614 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:19,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:19,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 14018 proven. 420 refuted. 0 times theorem prover too weak. 20098 trivial. 0 not checked. [2018-02-04 00:18:20,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:20,557 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:20,562 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:18:20,833 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2018-02-04 00:18:20,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:20,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 13824 proven. 2224 refuted. 0 times theorem prover too weak. 18488 trivial. 0 not checked. [2018-02-04 00:18:21,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:21,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 46 [2018-02-04 00:18:21,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 00:18:21,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 00:18:21,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1650, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 00:18:21,518 INFO L87 Difference]: Start difference. First operand 800 states and 806 transitions. Second operand 46 states. [2018-02-04 00:18:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:22,344 INFO L93 Difference]: Finished difference Result 818 states and 822 transitions. [2018-02-04 00:18:22,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 00:18:22,344 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 772 [2018-02-04 00:18:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:22,346 INFO L225 Difference]: With dead ends: 818 [2018-02-04 00:18:22,346 INFO L226 Difference]: Without dead ends: 812 [2018-02-04 00:18:22,346 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1183, Invalid=4219, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 00:18:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-02-04 00:18:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 800. [2018-02-04 00:18:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-02-04 00:18:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 804 transitions. [2018-02-04 00:18:22,353 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 804 transitions. Word has length 772 [2018-02-04 00:18:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:22,354 INFO L432 AbstractCegarLoop]: Abstraction has 800 states and 804 transitions. [2018-02-04 00:18:22,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 00:18:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 804 transitions. [2018-02-04 00:18:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-02-04 00:18:22,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:22,360 INFO L351 BasicCegarLoop]: trace histogram [116, 104, 103, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:22,360 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1773325315, now seen corresponding path program 30 times [2018-02-04 00:18:22,360 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:22,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:22,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:22,361 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:22,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:22,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-04 00:18:23,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:23,002 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:23,007 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:18:23,266 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 00:18:23,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:23,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7700 proven. 457 refuted. 0 times theorem prover too weak. 27018 trivial. 0 not checked. [2018-02-04 00:18:23,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:23,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2018-02-04 00:18:23,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 00:18:23,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 00:18:23,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 00:18:23,559 INFO L87 Difference]: Start difference. First operand 800 states and 804 transitions. Second operand 34 states. [2018-02-04 00:18:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:24,143 INFO L93 Difference]: Finished difference Result 922 states and 929 transitions. [2018-02-04 00:18:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 00:18:24,144 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 778 [2018-02-04 00:18:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:24,145 INFO L225 Difference]: With dead ends: 922 [2018-02-04 00:18:24,145 INFO L226 Difference]: Without dead ends: 922 [2018-02-04 00:18:24,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=812, Invalid=2970, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 00:18:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2018-02-04 00:18:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 896. [2018-02-04 00:18:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-02-04 00:18:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 902 transitions. [2018-02-04 00:18:24,152 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 902 transitions. Word has length 778 [2018-02-04 00:18:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:24,152 INFO L432 AbstractCegarLoop]: Abstraction has 896 states and 902 transitions. [2018-02-04 00:18:24,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 00:18:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 902 transitions. [2018-02-04 00:18:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-02-04 00:18:24,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:24,157 INFO L351 BasicCegarLoop]: trace histogram [131, 118, 117, 117, 117, 117, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:24,157 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1027574676, now seen corresponding path program 31 times [2018-02-04 00:18:24,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:24,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:24,157 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:24,158 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:24,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:24,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-02-04 00:18:25,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:25,362 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:25,367 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:18:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:25,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-02-04 00:18:25,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:25,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 44 [2018-02-04 00:18:25,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 00:18:25,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 00:18:25,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 00:18:25,863 INFO L87 Difference]: Start difference. First operand 896 states and 902 transitions. Second operand 44 states. [2018-02-04 00:18:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:26,299 INFO L93 Difference]: Finished difference Result 924 states and 929 transitions. [2018-02-04 00:18:26,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 00:18:26,299 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 874 [2018-02-04 00:18:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:26,301 INFO L225 Difference]: With dead ends: 924 [2018-02-04 00:18:26,301 INFO L226 Difference]: Without dead ends: 918 [2018-02-04 00:18:26,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 861 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=721, Invalid=2359, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 00:18:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2018-02-04 00:18:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 902. [2018-02-04 00:18:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-02-04 00:18:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 907 transitions. [2018-02-04 00:18:26,307 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 907 transitions. Word has length 874 [2018-02-04 00:18:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:26,308 INFO L432 AbstractCegarLoop]: Abstraction has 902 states and 907 transitions. [2018-02-04 00:18:26,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 00:18:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 907 transitions. [2018-02-04 00:18:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-02-04 00:18:26,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:26,314 INFO L351 BasicCegarLoop]: trace histogram [132, 119, 118, 118, 118, 118, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:26,314 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -894009052, now seen corresponding path program 32 times [2018-02-04 00:18:26,315 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:26,315 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:26,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:26,316 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:18:26,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:26,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-02-04 00:18:27,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:27,083 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:27,088 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:18:27,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:18:27,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:27,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-02-04 00:18:27,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:27,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-02-04 00:18:27,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 00:18:27,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 00:18:27,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-02-04 00:18:27,466 INFO L87 Difference]: Start difference. First operand 902 states and 907 transitions. Second operand 32 states. [2018-02-04 00:18:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:27,821 INFO L93 Difference]: Finished difference Result 936 states and 943 transitions. [2018-02-04 00:18:27,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:18:27,821 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 880 [2018-02-04 00:18:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:27,823 INFO L225 Difference]: With dead ends: 936 [2018-02-04 00:18:27,823 INFO L226 Difference]: Without dead ends: 936 [2018-02-04 00:18:27,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 865 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-02-04 00:18:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-02-04 00:18:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 908. [2018-02-04 00:18:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-02-04 00:18:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 914 transitions. [2018-02-04 00:18:27,828 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 914 transitions. Word has length 880 [2018-02-04 00:18:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:27,829 INFO L432 AbstractCegarLoop]: Abstraction has 908 states and 914 transitions. [2018-02-04 00:18:27,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 00:18:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 914 transitions. [2018-02-04 00:18:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2018-02-04 00:18:27,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:27,833 INFO L351 BasicCegarLoop]: trace histogram [133, 120, 119, 119, 119, 119, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:27,833 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:27,833 INFO L82 PathProgramCache]: Analyzing trace with hash 741635228, now seen corresponding path program 33 times [2018-02-04 00:18:27,833 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:27,833 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:27,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:27,834 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:27,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:27,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-04 00:18:29,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:29,163 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:29,172 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:18:29,357 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 00:18:29,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:29,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 13265 proven. 4191 refuted. 0 times theorem prover too weak. 29148 trivial. 0 not checked. [2018-02-04 00:18:29,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:29,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 24] total 50 [2018-02-04 00:18:29,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 00:18:29,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 00:18:29,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=2069, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 00:18:29,845 INFO L87 Difference]: Start difference. First operand 908 states and 914 transitions. Second operand 50 states. [2018-02-04 00:18:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:30,902 INFO L93 Difference]: Finished difference Result 1027 states and 1034 transitions. [2018-02-04 00:18:30,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 00:18:30,902 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 886 [2018-02-04 00:18:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:30,904 INFO L225 Difference]: With dead ends: 1027 [2018-02-04 00:18:30,904 INFO L226 Difference]: Without dead ends: 1027 [2018-02-04 00:18:30,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 959 GetRequests, 871 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1620, Invalid=6390, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 00:18:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-02-04 00:18:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1016. [2018-02-04 00:18:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-02-04 00:18:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1023 transitions. [2018-02-04 00:18:30,910 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1023 transitions. Word has length 886 [2018-02-04 00:18:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:30,910 INFO L432 AbstractCegarLoop]: Abstraction has 1016 states and 1023 transitions. [2018-02-04 00:18:30,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 00:18:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1023 transitions. [2018-02-04 00:18:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-02-04 00:18:30,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:30,915 INFO L351 BasicCegarLoop]: trace histogram [148, 134, 133, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:30,915 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1908977205, now seen corresponding path program 34 times [2018-02-04 00:18:30,915 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:30,916 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:30,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:30,916 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:30,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:30,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-02-04 00:18:32,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:32,443 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:32,448 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:18:32,548 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:18:32,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:32,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-02-04 00:18:32,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:32,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-02-04 00:18:33,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 00:18:33,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 00:18:33,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 00:18:33,000 INFO L87 Difference]: Start difference. First operand 1016 states and 1023 transitions. Second operand 47 states. [2018-02-04 00:18:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:33,443 INFO L93 Difference]: Finished difference Result 1037 states and 1042 transitions. [2018-02-04 00:18:33,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 00:18:33,443 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 982 [2018-02-04 00:18:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:33,445 INFO L225 Difference]: With dead ends: 1037 [2018-02-04 00:18:33,446 INFO L226 Difference]: Without dead ends: 1031 [2018-02-04 00:18:33,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1026 GetRequests, 968 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=825, Invalid=2715, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 00:18:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-02-04 00:18:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1016. [2018-02-04 00:18:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-02-04 00:18:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1021 transitions. [2018-02-04 00:18:33,454 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1021 transitions. Word has length 982 [2018-02-04 00:18:33,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:33,455 INFO L432 AbstractCegarLoop]: Abstraction has 1016 states and 1021 transitions. [2018-02-04 00:18:33,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 00:18:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1021 transitions. [2018-02-04 00:18:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-02-04 00:18:33,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:33,460 INFO L351 BasicCegarLoop]: trace histogram [149, 135, 134, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:33,460 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:33,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1435708227, now seen corresponding path program 35 times [2018-02-04 00:18:33,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:33,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:33,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:33,461 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:33,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:33,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-02-04 00:18:34,454 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:34,454 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:34,459 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:18:34,953 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-02-04 00:18:34,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:34,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-02-04 00:18:35,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:35,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-02-04 00:18:35,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 00:18:35,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 00:18:35,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 00:18:35,330 INFO L87 Difference]: Start difference. First operand 1016 states and 1021 transitions. Second operand 34 states. [2018-02-04 00:18:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:35,774 INFO L93 Difference]: Finished difference Result 1040 states and 1046 transitions. [2018-02-04 00:18:35,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:18:35,775 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 988 [2018-02-04 00:18:35,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:35,777 INFO L225 Difference]: With dead ends: 1040 [2018-02-04 00:18:35,777 INFO L226 Difference]: Without dead ends: 1040 [2018-02-04 00:18:35,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 973 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=507, Invalid=1749, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 00:18:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-02-04 00:18:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1022. [2018-02-04 00:18:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2018-02-04 00:18:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1028 transitions. [2018-02-04 00:18:35,783 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1028 transitions. Word has length 988 [2018-02-04 00:18:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:35,784 INFO L432 AbstractCegarLoop]: Abstraction has 1022 states and 1028 transitions. [2018-02-04 00:18:35,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 00:18:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1028 transitions. [2018-02-04 00:18:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-02-04 00:18:35,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:35,789 INFO L351 BasicCegarLoop]: trace histogram [150, 136, 135, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:35,789 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1833618299, now seen corresponding path program 36 times [2018-02-04 00:18:35,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:35,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:35,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:35,790 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:35,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:35,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-02-04 00:18:37,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:37,470 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:37,475 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:18:37,839 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2018-02-04 00:18:37,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:37,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12348 proven. 618 refuted. 0 times theorem prover too weak. 46679 trivial. 0 not checked. [2018-02-04 00:18:38,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:38,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 21] total 40 [2018-02-04 00:18:38,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 00:18:38,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 00:18:38,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:18:38,173 INFO L87 Difference]: Start difference. First operand 1022 states and 1028 transitions. Second operand 40 states. [2018-02-04 00:18:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:38,793 INFO L93 Difference]: Finished difference Result 1132 states and 1139 transitions. [2018-02-04 00:18:38,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 00:18:38,793 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 994 [2018-02-04 00:18:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:38,795 INFO L225 Difference]: With dead ends: 1132 [2018-02-04 00:18:38,795 INFO L226 Difference]: Without dead ends: 1132 [2018-02-04 00:18:38,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 991 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1209, Invalid=3903, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 00:18:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-02-04 00:18:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1130. [2018-02-04 00:18:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-02-04 00:18:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1137 transitions. [2018-02-04 00:18:38,802 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1137 transitions. Word has length 994 [2018-02-04 00:18:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:38,802 INFO L432 AbstractCegarLoop]: Abstraction has 1130 states and 1137 transitions. [2018-02-04 00:18:38,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 00:18:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1137 transitions. [2018-02-04 00:18:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2018-02-04 00:18:38,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:38,808 INFO L351 BasicCegarLoop]: trace histogram [166, 151, 150, 150, 150, 150, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:38,808 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash 305834914, now seen corresponding path program 37 times [2018-02-04 00:18:38,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:38,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:38,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:38,809 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:38,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:38,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-02-04 00:18:40,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:40,700 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:40,705 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:18:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:40,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-02-04 00:18:41,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:41,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-02-04 00:18:41,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 00:18:41,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 00:18:41,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 00:18:41,390 INFO L87 Difference]: Start difference. First operand 1130 states and 1137 transitions. Second operand 50 states. [2018-02-04 00:18:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:41,931 INFO L93 Difference]: Finished difference Result 1151 states and 1156 transitions. [2018-02-04 00:18:41,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 00:18:41,932 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1096 [2018-02-04 00:18:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:41,934 INFO L225 Difference]: With dead ends: 1151 [2018-02-04 00:18:41,934 INFO L226 Difference]: Without dead ends: 1145 [2018-02-04 00:18:41,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1143 GetRequests, 1081 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=936, Invalid=3096, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 00:18:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-02-04 00:18:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1130. [2018-02-04 00:18:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-02-04 00:18:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1135 transitions. [2018-02-04 00:18:41,940 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1135 transitions. Word has length 1096 [2018-02-04 00:18:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:41,940 INFO L432 AbstractCegarLoop]: Abstraction has 1130 states and 1135 transitions. [2018-02-04 00:18:41,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 00:18:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1135 transitions. [2018-02-04 00:18:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-02-04 00:18:41,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:41,946 INFO L351 BasicCegarLoop]: trace histogram [167, 152, 151, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:41,946 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:41,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1521424346, now seen corresponding path program 38 times [2018-02-04 00:18:41,947 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:41,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:41,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:41,947 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:18:41,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:42,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-02-04 00:18:43,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:43,265 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:43,269 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:18:43,399 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:18:43,399 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:43,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-02-04 00:18:43,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:43,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-02-04 00:18:43,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:18:43,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:18:43,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:18:43,764 INFO L87 Difference]: Start difference. First operand 1130 states and 1135 transitions. Second operand 19 states. [2018-02-04 00:18:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:44,266 INFO L93 Difference]: Finished difference Result 1154 states and 1160 transitions. [2018-02-04 00:18:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:18:44,266 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1102 [2018-02-04 00:18:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:44,269 INFO L225 Difference]: With dead ends: 1154 [2018-02-04 00:18:44,269 INFO L226 Difference]: Without dead ends: 1154 [2018-02-04 00:18:44,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1120 GetRequests, 1100 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:18:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-02-04 00:18:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1136. [2018-02-04 00:18:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2018-02-04 00:18:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1142 transitions. [2018-02-04 00:18:44,275 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1142 transitions. Word has length 1102 [2018-02-04 00:18:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:44,276 INFO L432 AbstractCegarLoop]: Abstraction has 1136 states and 1142 transitions. [2018-02-04 00:18:44,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:18:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1142 transitions. [2018-02-04 00:18:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-02-04 00:18:44,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:44,282 INFO L351 BasicCegarLoop]: trace histogram [168, 153, 152, 152, 152, 152, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:44,283 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:44,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1687333586, now seen corresponding path program 39 times [2018-02-04 00:18:44,283 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:44,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:44,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:44,284 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:44,284 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:44,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-02-04 00:18:46,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:46,429 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:46,433 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:18:46,703 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-02-04 00:18:46,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:46,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 21670 proven. 4847 refuted. 0 times theorem prover too weak. 48720 trivial. 0 not checked. [2018-02-04 00:18:47,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:47,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 26] total 57 [2018-02-04 00:18:47,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 00:18:47,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 00:18:47,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2696, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 00:18:47,417 INFO L87 Difference]: Start difference. First operand 1136 states and 1142 transitions. Second operand 57 states. [2018-02-04 00:18:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:48,775 INFO L93 Difference]: Finished difference Result 1255 states and 1261 transitions. [2018-02-04 00:18:48,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 00:18:48,775 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 1108 [2018-02-04 00:18:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:48,778 INFO L225 Difference]: With dead ends: 1255 [2018-02-04 00:18:48,779 INFO L226 Difference]: Without dead ends: 1255 [2018-02-04 00:18:48,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1192 GetRequests, 1090 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2308 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2136, Invalid=8576, Unknown=0, NotChecked=0, Total=10712 [2018-02-04 00:18:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2018-02-04 00:18:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1244. [2018-02-04 00:18:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-02-04 00:18:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1250 transitions. [2018-02-04 00:18:48,787 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1250 transitions. Word has length 1108 [2018-02-04 00:18:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:48,788 INFO L432 AbstractCegarLoop]: Abstraction has 1244 states and 1250 transitions. [2018-02-04 00:18:48,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 00:18:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1250 transitions. [2018-02-04 00:18:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-02-04 00:18:48,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:48,795 INFO L351 BasicCegarLoop]: trace histogram [185, 169, 168, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:48,795 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:48,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1655146865, now seen corresponding path program 40 times [2018-02-04 00:18:48,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:48,795 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:48,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:48,796 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:48,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:48,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-02-04 00:18:51,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:51,214 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:51,219 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:18:51,350 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:18:51,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:51,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-02-04 00:18:51,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:51,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-02-04 00:18:51,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 00:18:51,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 00:18:51,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 00:18:51,982 INFO L87 Difference]: Start difference. First operand 1244 states and 1250 transitions. Second operand 53 states. [2018-02-04 00:18:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:52,605 INFO L93 Difference]: Finished difference Result 1262 states and 1266 transitions. [2018-02-04 00:18:52,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 00:18:52,605 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1216 [2018-02-04 00:18:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:52,607 INFO L225 Difference]: With dead ends: 1262 [2018-02-04 00:18:52,607 INFO L226 Difference]: Without dead ends: 1256 [2018-02-04 00:18:52,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1054, Invalid=3502, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 00:18:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2018-02-04 00:18:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1244. [2018-02-04 00:18:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-02-04 00:18:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1248 transitions. [2018-02-04 00:18:52,615 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1248 transitions. Word has length 1216 [2018-02-04 00:18:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:52,616 INFO L432 AbstractCegarLoop]: Abstraction has 1244 states and 1248 transitions. [2018-02-04 00:18:52,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 00:18:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1248 transitions. [2018-02-04 00:18:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-02-04 00:18:52,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:52,625 INFO L351 BasicCegarLoop]: trace histogram [186, 170, 169, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:52,625 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1276924311, now seen corresponding path program 41 times [2018-02-04 00:18:52,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:52,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:52,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:52,626 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:52,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:52,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-04 00:18:54,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:54,211 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:54,216 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:18:55,008 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-02-04 00:18:55,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:55,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-04 00:18:55,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:55,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2018-02-04 00:18:55,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 00:18:55,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 00:18:55,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 00:18:55,488 INFO L87 Difference]: Start difference. First operand 1244 states and 1248 transitions. Second operand 33 states. [2018-02-04 00:18:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:18:55,856 INFO L93 Difference]: Finished difference Result 1265 states and 1270 transitions. [2018-02-04 00:18:55,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:18:55,856 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1222 [2018-02-04 00:18:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:18:55,858 INFO L225 Difference]: With dead ends: 1265 [2018-02-04 00:18:55,858 INFO L226 Difference]: Without dead ends: 1265 [2018-02-04 00:18:55,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1210 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 00:18:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-02-04 00:18:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1250. [2018-02-04 00:18:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2018-02-04 00:18:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1255 transitions. [2018-02-04 00:18:55,864 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1255 transitions. Word has length 1222 [2018-02-04 00:18:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:18:55,865 INFO L432 AbstractCegarLoop]: Abstraction has 1250 states and 1255 transitions. [2018-02-04 00:18:55,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 00:18:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1255 transitions. [2018-02-04 00:18:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-02-04 00:18:55,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:18:55,874 INFO L351 BasicCegarLoop]: trace histogram [187, 171, 170, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:18:55,874 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:18:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2048514593, now seen corresponding path program 42 times [2018-02-04 00:18:55,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:18:55,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:18:55,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:55,875 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:18:55,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:18:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:18:55,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:18:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-02-04 00:18:58,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:18:58,479 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:18:58,483 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:18:59,206 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-02-04 00:18:59,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:18:59,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:18:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 17583 proven. 802 refuted. 0 times theorem prover too weak. 75307 trivial. 0 not checked. [2018-02-04 00:18:59,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:18:59,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 23] total 44 [2018-02-04 00:18:59,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 00:18:59,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 00:18:59,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 00:18:59,665 INFO L87 Difference]: Start difference. First operand 1250 states and 1255 transitions. Second operand 44 states. [2018-02-04 00:19:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:00,654 INFO L93 Difference]: Finished difference Result 1372 states and 1378 transitions. [2018-02-04 00:19:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 00:19:00,655 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1228 [2018-02-04 00:19:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:00,657 INFO L225 Difference]: With dead ends: 1372 [2018-02-04 00:19:00,657 INFO L226 Difference]: Without dead ends: 1372 [2018-02-04 00:19:00,658 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1303 GetRequests, 1225 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1484, Invalid=4836, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 00:19:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2018-02-04 00:19:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1370. [2018-02-04 00:19:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2018-02-04 00:19:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1376 transitions. [2018-02-04 00:19:00,664 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1376 transitions. Word has length 1228 [2018-02-04 00:19:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:00,665 INFO L432 AbstractCegarLoop]: Abstraction has 1370 states and 1376 transitions. [2018-02-04 00:19:00,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 00:19:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1376 transitions. [2018-02-04 00:19:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2018-02-04 00:19:00,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:00,672 INFO L351 BasicCegarLoop]: trace histogram [205, 188, 187, 187, 187, 187, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:00,673 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:00,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1362556088, now seen corresponding path program 43 times [2018-02-04 00:19:00,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:00,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:00,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:00,674 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:19:00,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:00,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 113016 backedges. 36738 proven. 850 refuted. 0 times theorem prover too weak. 75428 trivial. 0 not checked. [2018-02-04 00:19:03,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:03,887 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:03,892 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:19:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:04,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 113016 backedges. 36738 proven. 850 refuted. 0 times theorem prover too weak. 75428 trivial. 0 not checked. [2018-02-04 00:19:04,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:04,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 56 [2018-02-04 00:19:04,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 00:19:04,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 00:19:04,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 00:19:04,812 INFO L87 Difference]: Start difference. First operand 1370 states and 1376 transitions. Second operand 56 states. [2018-02-04 00:19:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:05,330 INFO L93 Difference]: Finished difference Result 1388 states and 1392 transitions. [2018-02-04 00:19:05,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 00:19:05,330 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1342 [2018-02-04 00:19:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:05,333 INFO L225 Difference]: With dead ends: 1388 [2018-02-04 00:19:05,333 INFO L226 Difference]: Without dead ends: 1382 [2018-02-04 00:19:05,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1395 GetRequests, 1325 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1179, Invalid=3933, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 00:19:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2018-02-04 00:19:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1370. [2018-02-04 00:19:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2018-02-04 00:19:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1374 transitions. [2018-02-04 00:19:05,342 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1374 transitions. Word has length 1342 [2018-02-04 00:19:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:05,342 INFO L432 AbstractCegarLoop]: Abstraction has 1370 states and 1374 transitions. [2018-02-04 00:19:05,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 00:19:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1374 transitions. [2018-02-04 00:19:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2018-02-04 00:19:05,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:05,350 INFO L351 BasicCegarLoop]: trace histogram [206, 189, 188, 188, 188, 188, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:05,351 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash 811391088, now seen corresponding path program 44 times [2018-02-04 00:19:05,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:05,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:05,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:05,352 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:19:05,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:05,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-02-04 00:19:07,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:07,314 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:07,328 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:19:07,492 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:19:07,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:19:07,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-02-04 00:19:08,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:08,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2018-02-04 00:19:08,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 00:19:08,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 00:19:08,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:19:08,023 INFO L87 Difference]: Start difference. First operand 1370 states and 1374 transitions. Second operand 40 states. [2018-02-04 00:19:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:08,412 INFO L93 Difference]: Finished difference Result 1391 states and 1396 transitions. [2018-02-04 00:19:08,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:19:08,412 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1348 [2018-02-04 00:19:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:08,415 INFO L225 Difference]: With dead ends: 1391 [2018-02-04 00:19:08,415 INFO L226 Difference]: Without dead ends: 1391 [2018-02-04 00:19:08,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1329 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:19:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-02-04 00:19:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1376. [2018-02-04 00:19:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2018-02-04 00:19:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1381 transitions. [2018-02-04 00:19:08,424 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1381 transitions. Word has length 1348 [2018-02-04 00:19:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:08,424 INFO L432 AbstractCegarLoop]: Abstraction has 1376 states and 1381 transitions. [2018-02-04 00:19:08,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 00:19:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1381 transitions. [2018-02-04 00:19:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2018-02-04 00:19:08,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:08,434 INFO L351 BasicCegarLoop]: trace histogram [207, 190, 189, 189, 189, 189, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:08,434 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash 802628328, now seen corresponding path program 45 times [2018-02-04 00:19:08,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:08,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:08,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:08,435 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:19:08,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:08,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 21614 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-02-04 00:19:11,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:11,688 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:11,693 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:19:12,150 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-02-04 00:19:12,150 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:19:12,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 31211 proven. 6205 refuted. 0 times theorem prover too weak. 77924 trivial. 0 not checked. [2018-02-04 00:19:13,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:13,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 28] total 63 [2018-02-04 00:19:13,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 00:19:13,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 00:19:13,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=3297, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 00:19:13,045 INFO L87 Difference]: Start difference. First operand 1376 states and 1381 transitions. Second operand 63 states. [2018-02-04 00:19:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:14,665 INFO L93 Difference]: Finished difference Result 1513 states and 1519 transitions. [2018-02-04 00:19:14,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-02-04 00:19:14,665 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1354 [2018-02-04 00:19:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:14,668 INFO L225 Difference]: With dead ends: 1513 [2018-02-04 00:19:14,668 INFO L226 Difference]: Without dead ends: 1513 [2018-02-04 00:19:14,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1448 GetRequests, 1334 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2905 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2637, Invalid=10703, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 00:19:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2018-02-04 00:19:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1502. [2018-02-04 00:19:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2018-02-04 00:19:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1508 transitions. [2018-02-04 00:19:14,678 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1508 transitions. Word has length 1354 [2018-02-04 00:19:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:14,679 INFO L432 AbstractCegarLoop]: Abstraction has 1502 states and 1508 transitions. [2018-02-04 00:19:14,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 00:19:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1508 transitions. [2018-02-04 00:19:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1475 [2018-02-04 00:19:14,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:14,688 INFO L351 BasicCegarLoop]: trace histogram [226, 208, 207, 207, 207, 207, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:14,688 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash -773621513, now seen corresponding path program 46 times [2018-02-04 00:19:14,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:14,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:14,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:14,689 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:19:14,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:14,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 43121 proven. 954 refuted. 0 times theorem prover too weak. 93886 trivial. 0 not checked. [2018-02-04 00:19:18,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:18,396 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:18,400 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:19:18,549 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:19:18,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:19:18,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 43121 proven. 954 refuted. 0 times theorem prover too weak. 93886 trivial. 0 not checked. [2018-02-04 00:19:19,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:19,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 59 [2018-02-04 00:19:19,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 00:19:19,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 00:19:19,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 00:19:19,386 INFO L87 Difference]: Start difference. First operand 1502 states and 1508 transitions. Second operand 59 states. [2018-02-04 00:19:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:20,240 INFO L93 Difference]: Finished difference Result 1520 states and 1524 transitions. [2018-02-04 00:19:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 00:19:20,240 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 1474 [2018-02-04 00:19:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:20,243 INFO L225 Difference]: With dead ends: 1520 [2018-02-04 00:19:20,243 INFO L226 Difference]: Without dead ends: 1514 [2018-02-04 00:19:20,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1530 GetRequests, 1456 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1311, Invalid=4389, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 00:19:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-02-04 00:19:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1502. [2018-02-04 00:19:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2018-02-04 00:19:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1506 transitions. [2018-02-04 00:19:20,255 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1506 transitions. Word has length 1474 [2018-02-04 00:19:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:20,256 INFO L432 AbstractCegarLoop]: Abstraction has 1502 states and 1506 transitions. [2018-02-04 00:19:20,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 00:19:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1506 transitions. [2018-02-04 00:19:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1481 [2018-02-04 00:19:20,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:20,272 INFO L351 BasicCegarLoop]: trace histogram [227, 209, 208, 208, 208, 208, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:20,272 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1994293615, now seen corresponding path program 47 times [2018-02-04 00:19:20,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:20,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:20,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:20,273 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:19:20,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:20,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 139242 backedges. 22833 proven. 1083 refuted. 0 times theorem prover too weak. 115326 trivial. 0 not checked. [2018-02-04 00:19:22,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:22,711 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:22,716 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:19:23,986 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2018-02-04 00:19:23,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:19:24,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 139242 backedges. 22833 proven. 1083 refuted. 0 times theorem prover too weak. 115326 trivial. 0 not checked. [2018-02-04 00:19:24,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:24,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-02-04 00:19:24,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 00:19:24,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 00:19:24,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 00:19:24,657 INFO L87 Difference]: Start difference. First operand 1502 states and 1506 transitions. Second operand 43 states. [2018-02-04 00:19:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:25,066 INFO L93 Difference]: Finished difference Result 1523 states and 1528 transitions. [2018-02-04 00:19:25,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 00:19:25,066 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1480 [2018-02-04 00:19:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:25,069 INFO L225 Difference]: With dead ends: 1523 [2018-02-04 00:19:25,069 INFO L226 Difference]: Without dead ends: 1523 [2018-02-04 00:19:25,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1501 GetRequests, 1459 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 00:19:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2018-02-04 00:19:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1508. [2018-02-04 00:19:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-02-04 00:19:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1513 transitions. [2018-02-04 00:19:25,075 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1513 transitions. Word has length 1480 [2018-02-04 00:19:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:25,076 INFO L432 AbstractCegarLoop]: Abstraction has 1508 states and 1513 transitions. [2018-02-04 00:19:25,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 00:19:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1513 transitions. [2018-02-04 00:19:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1487 [2018-02-04 00:19:25,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:25,085 INFO L351 BasicCegarLoop]: trace histogram [228, 210, 209, 209, 209, 209, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:25,085 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:25,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1714433881, now seen corresponding path program 48 times [2018-02-04 00:19:25,086 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:25,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:25,086 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:25,086 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:19:25,086 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:25,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 140529 backedges. 25162 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-02-04 00:19:29,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:29,135 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:29,140 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:19:30,540 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2018-02-04 00:19:30,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:19:30,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 140529 backedges. 34640 proven. 8221 refuted. 0 times theorem prover too weak. 97668 trivial. 0 not checked. [2018-02-04 00:19:31,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:31,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 29] total 65 [2018-02-04 00:19:31,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 00:19:31,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 00:19:31,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=3509, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 00:19:31,534 INFO L87 Difference]: Start difference. First operand 1508 states and 1513 transitions. Second operand 65 states. [2018-02-04 00:19:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:33,291 INFO L93 Difference]: Finished difference Result 1651 states and 1657 transitions. [2018-02-04 00:19:33,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-02-04 00:19:33,291 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 1486 [2018-02-04 00:19:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:33,294 INFO L225 Difference]: With dead ends: 1651 [2018-02-04 00:19:33,294 INFO L226 Difference]: Without dead ends: 1651 [2018-02-04 00:19:33,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1584 GetRequests, 1466 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3125 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2820, Invalid=11460, Unknown=0, NotChecked=0, Total=14280 [2018-02-04 00:19:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2018-02-04 00:19:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1640. [2018-02-04 00:19:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2018-02-04 00:19:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1646 transitions. [2018-02-04 00:19:33,304 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1646 transitions. Word has length 1486 [2018-02-04 00:19:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:33,304 INFO L432 AbstractCegarLoop]: Abstraction has 1640 states and 1646 transitions. [2018-02-04 00:19:33,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 00:19:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1646 transitions. [2018-02-04 00:19:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1613 [2018-02-04 00:19:33,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:33,316 INFO L351 BasicCegarLoop]: trace histogram [248, 229, 228, 228, 228, 228, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:33,316 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2073091154, now seen corresponding path program 49 times [2018-02-04 00:19:33,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:33,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:33,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:33,317 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:19:33,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:33,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 166801 backedges. 50201 proven. 1064 refuted. 0 times theorem prover too weak. 115536 trivial. 0 not checked. [2018-02-04 00:19:37,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:37,978 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:37,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:19:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:38,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 166801 backedges. 50201 proven. 1064 refuted. 0 times theorem prover too weak. 115536 trivial. 0 not checked. [2018-02-04 00:19:39,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:39,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 62 [2018-02-04 00:19:39,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 00:19:39,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 00:19:39,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2881, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 00:19:39,166 INFO L87 Difference]: Start difference. First operand 1640 states and 1646 transitions. Second operand 62 states. [2018-02-04 00:19:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:39,953 INFO L93 Difference]: Finished difference Result 1658 states and 1662 transitions. [2018-02-04 00:19:39,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 00:19:39,953 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1612 [2018-02-04 00:19:39,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:39,955 INFO L225 Difference]: With dead ends: 1658 [2018-02-04 00:19:39,955 INFO L226 Difference]: Without dead ends: 1652 [2018-02-04 00:19:39,956 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1671 GetRequests, 1593 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1450, Invalid=4870, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 00:19:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2018-02-04 00:19:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1640. [2018-02-04 00:19:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2018-02-04 00:19:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1644 transitions. [2018-02-04 00:19:39,963 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1644 transitions. Word has length 1612 [2018-02-04 00:19:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:39,964 INFO L432 AbstractCegarLoop]: Abstraction has 1640 states and 1644 transitions. [2018-02-04 00:19:39,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 00:19:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1644 transitions. [2018-02-04 00:19:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1619 [2018-02-04 00:19:39,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:39,974 INFO L351 BasicCegarLoop]: trace histogram [249, 230, 229, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:39,974 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:39,975 INFO L82 PathProgramCache]: Analyzing trace with hash -758475034, now seen corresponding path program 50 times [2018-02-04 00:19:39,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:39,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:39,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:39,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:19:39,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:40,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-02-04 00:19:42,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:42,830 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:42,835 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:19:43,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:19:43,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:19:43,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-02-04 00:19:43,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:43,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-02-04 00:19:43,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 00:19:43,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 00:19:43,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 00:19:43,821 INFO L87 Difference]: Start difference. First operand 1640 states and 1644 transitions. Second operand 44 states. [2018-02-04 00:19:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:44,557 INFO L93 Difference]: Finished difference Result 1661 states and 1666 transitions. [2018-02-04 00:19:44,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:19:44,557 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1618 [2018-02-04 00:19:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:44,560 INFO L225 Difference]: With dead ends: 1661 [2018-02-04 00:19:44,561 INFO L226 Difference]: Without dead ends: 1661 [2018-02-04 00:19:44,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1640 GetRequests, 1597 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 00:19:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2018-02-04 00:19:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1646. [2018-02-04 00:19:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2018-02-04 00:19:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1651 transitions. [2018-02-04 00:19:44,568 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1651 transitions. Word has length 1618 [2018-02-04 00:19:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:44,568 INFO L432 AbstractCegarLoop]: Abstraction has 1646 states and 1651 transitions. [2018-02-04 00:19:44,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 00:19:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1651 transitions. [2018-02-04 00:19:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-02-04 00:19:44,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:44,579 INFO L351 BasicCegarLoop]: trace histogram [250, 231, 230, 230, 230, 230, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:44,579 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:44,580 INFO L82 PathProgramCache]: Analyzing trace with hash -828526370, now seen corresponding path program 51 times [2018-02-04 00:19:44,580 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:44,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:44,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:44,580 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:19:44,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:44,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29077 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-02-04 00:19:49,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:49,632 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:49,637 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:19:50,047 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 00:19:50,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:19:50,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 49274 proven. 3825 refuted. 0 times theorem prover too weak. 116526 trivial. 0 not checked. [2018-02-04 00:19:51,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:51,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 30] total 71 [2018-02-04 00:19:51,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 00:19:51,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 00:19:51,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=777, Invalid=4193, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 00:19:51,314 INFO L87 Difference]: Start difference. First operand 1646 states and 1651 transitions. Second operand 71 states. [2018-02-04 00:19:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:53,338 INFO L93 Difference]: Finished difference Result 1804 states and 1810 transitions. [2018-02-04 00:19:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-02-04 00:19:53,339 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1624 [2018-02-04 00:19:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:53,342 INFO L225 Difference]: With dead ends: 1804 [2018-02-04 00:19:53,342 INFO L226 Difference]: Without dead ends: 1804 [2018-02-04 00:19:53,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1731 GetRequests, 1600 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3849 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3427, Invalid=14129, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 00:19:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2018-02-04 00:19:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1790. [2018-02-04 00:19:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2018-02-04 00:19:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 1796 transitions. [2018-02-04 00:19:53,351 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 1796 transitions. Word has length 1624 [2018-02-04 00:19:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:53,352 INFO L432 AbstractCegarLoop]: Abstraction has 1790 states and 1796 transitions. [2018-02-04 00:19:53,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 00:19:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 1796 transitions. [2018-02-04 00:19:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1763 [2018-02-04 00:19:53,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:53,379 INFO L351 BasicCegarLoop]: trace histogram [272, 252, 251, 251, 251, 251, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:53,379 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1828222891, now seen corresponding path program 52 times [2018-02-04 00:19:53,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:53,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:53,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:53,380 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:19:53,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:53,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:19:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 201463 backedges. 30550 proven. 1323 refuted. 0 times theorem prover too weak. 169590 trivial. 0 not checked. [2018-02-04 00:19:56,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:19:56,844 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:19:56,850 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:19:57,217 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:19:57,217 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:19:57,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:19:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 201463 backedges. 30550 proven. 1323 refuted. 0 times theorem prover too weak. 169590 trivial. 0 not checked. [2018-02-04 00:19:58,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:19:58,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2018-02-04 00:19:58,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 00:19:58,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 00:19:58,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1518, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 00:19:58,056 INFO L87 Difference]: Start difference. First operand 1790 states and 1796 transitions. Second operand 46 states. [2018-02-04 00:19:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:19:58,627 INFO L93 Difference]: Finished difference Result 1811 states and 1818 transitions. [2018-02-04 00:19:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 00:19:58,628 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1762 [2018-02-04 00:19:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:19:58,630 INFO L225 Difference]: With dead ends: 1811 [2018-02-04 00:19:58,630 INFO L226 Difference]: Without dead ends: 1811 [2018-02-04 00:19:58,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1785 GetRequests, 1740 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=552, Invalid=1518, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 00:19:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-02-04 00:19:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1796. [2018-02-04 00:19:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-02-04 00:19:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 1803 transitions. [2018-02-04 00:19:58,639 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 1803 transitions. Word has length 1762 [2018-02-04 00:19:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:19:58,639 INFO L432 AbstractCegarLoop]: Abstraction has 1796 states and 1803 transitions. [2018-02-04 00:19:58,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 00:19:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 1803 transitions. [2018-02-04 00:19:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2018-02-04 00:19:58,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:19:58,652 INFO L351 BasicCegarLoop]: trace histogram [273, 253, 252, 252, 252, 252, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:19:58,652 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:19:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash 527799053, now seen corresponding path program 53 times [2018-02-04 00:19:58,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:19:58,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:19:58,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:58,653 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:19:58,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:19:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:19:58,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33377 proven. 1285 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-02-04 00:20:04,980 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:20:04,980 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:20:04,985 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:20:06,775 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-02-04 00:20:06,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:20:06,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:20:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33304 proven. 7511 refuted. 0 times theorem prover too weak. 162197 trivial. 0 not checked. [2018-02-04 00:20:08,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:20:08,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 52] total 77 [2018-02-04 00:20:08,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 00:20:08,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 00:20:08,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1177, Invalid=4675, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 00:20:08,263 INFO L87 Difference]: Start difference. First operand 1796 states and 1803 transitions. Second operand 77 states. [2018-02-04 00:20:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:09,684 INFO L93 Difference]: Finished difference Result 2106 states and 2118 transitions. [2018-02-04 00:20:09,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 00:20:09,684 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 1768 [2018-02-04 00:20:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:09,688 INFO L225 Difference]: With dead ends: 2106 [2018-02-04 00:20:09,688 INFO L226 Difference]: Without dead ends: 2106 [2018-02-04 00:20:09,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1862 GetRequests, 1740 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2942 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3229, Invalid=12023, Unknown=0, NotChecked=0, Total=15252 [2018-02-04 00:20:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2018-02-04 00:20:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2090. [2018-02-04 00:20:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2018-02-04 00:20:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2102 transitions. [2018-02-04 00:20:09,707 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2102 transitions. Word has length 1768 [2018-02-04 00:20:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:09,708 INFO L432 AbstractCegarLoop]: Abstraction has 2090 states and 2102 transitions. [2018-02-04 00:20:09,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 00:20:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2102 transitions. [2018-02-04 00:20:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1901 [2018-02-04 00:20:09,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:09,735 INFO L351 BasicCegarLoop]: trace histogram [294, 273, 272, 272, 272, 272, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:20:09,735 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:20:09,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1101666444, now seen corresponding path program 54 times [2018-02-04 00:20:09,736 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:09,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:09,737 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:09,737 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:20:09,737 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:09,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-02-04 00:20:16,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:20:16,769 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:20:16,773 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:20:17,873 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2018-02-04 00:20:17,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:20:17,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:20:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 58687 proven. 6561 refuted. 0 times theorem prover too weak. 170795 trivial. 0 not checked. [2018-02-04 00:20:19,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:20:19,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 31] total 76 [2018-02-04 00:20:19,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 00:20:19,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 00:20:19,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 00:20:19,325 INFO L87 Difference]: Start difference. First operand 2090 states and 2102 transitions. Second operand 76 states. [2018-02-04 00:20:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:22,114 INFO L93 Difference]: Finished difference Result 1963 states and 1967 transitions. [2018-02-04 00:20:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-02-04 00:20:22,114 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 1900 [2018-02-04 00:20:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:22,116 INFO L225 Difference]: With dead ends: 1963 [2018-02-04 00:20:22,116 INFO L226 Difference]: Without dead ends: 1948 [2018-02-04 00:20:22,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2071 GetRequests, 1871 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14486 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6930, Invalid=33672, Unknown=0, NotChecked=0, Total=40602 [2018-02-04 00:20:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2018-02-04 00:20:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1934. [2018-02-04 00:20:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2018-02-04 00:20:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 1938 transitions. [2018-02-04 00:20:22,130 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 1938 transitions. Word has length 1900 [2018-02-04 00:20:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:22,131 INFO L432 AbstractCegarLoop]: Abstraction has 1934 states and 1938 transitions. [2018-02-04 00:20:22,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 00:20:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 1938 transitions. [2018-02-04 00:20:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1913 [2018-02-04 00:20:22,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:22,156 INFO L351 BasicCegarLoop]: trace histogram [296, 275, 274, 274, 274, 274, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:20:22,156 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:20:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1723381956, now seen corresponding path program 55 times [2018-02-04 00:20:22,156 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:22,156 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:22,157 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:22,157 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:20:22,157 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:22,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-02-04 00:20:26,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:20:26,378 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:20:26,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:26,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:20:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-02-04 00:20:27,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:20:27,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-02-04 00:20:27,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 00:20:27,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 00:20:27,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1679, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 00:20:27,674 INFO L87 Difference]: Start difference. First operand 1934 states and 1938 transitions. Second operand 48 states. [2018-02-04 00:20:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:28,264 INFO L93 Difference]: Finished difference Result 1955 states and 1960 transitions. [2018-02-04 00:20:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 00:20:28,264 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1912 [2018-02-04 00:20:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:28,267 INFO L225 Difference]: With dead ends: 1955 [2018-02-04 00:20:28,267 INFO L226 Difference]: Without dead ends: 1955 [2018-02-04 00:20:28,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1936 GetRequests, 1889 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=577, Invalid=1679, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 00:20:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-02-04 00:20:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1940. [2018-02-04 00:20:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1940 states. [2018-02-04 00:20:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 1945 transitions. [2018-02-04 00:20:28,278 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 1945 transitions. Word has length 1912 [2018-02-04 00:20:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:28,279 INFO L432 AbstractCegarLoop]: Abstraction has 1940 states and 1945 transitions. [2018-02-04 00:20:28,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 00:20:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 1945 transitions. [2018-02-04 00:20:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2018-02-04 00:20:28,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:28,295 INFO L351 BasicCegarLoop]: trace histogram [297, 276, 275, 275, 275, 275, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:20:28,295 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:20:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash -701609804, now seen corresponding path program 56 times [2018-02-04 00:20:28,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:28,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:28,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:28,296 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:28,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:28,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 38080 proven. 1412 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-02-04 00:20:35,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:20:35,590 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:20:35,596 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:20:35,852 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:20:35,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:20:35,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:20:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 38148 proven. 1344 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-02-04 00:20:37,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:20:37,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 75 [2018-02-04 00:20:37,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 00:20:37,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 00:20:37,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1276, Invalid=4274, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 00:20:37,451 INFO L87 Difference]: Start difference. First operand 1940 states and 1945 transitions. Second operand 75 states. [2018-02-04 00:20:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:38,694 INFO L93 Difference]: Finished difference Result 2104 states and 2110 transitions. [2018-02-04 00:20:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 00:20:38,694 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 1918 [2018-02-04 00:20:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:38,697 INFO L225 Difference]: With dead ends: 2104 [2018-02-04 00:20:38,697 INFO L226 Difference]: Without dead ends: 2104 [2018-02-04 00:20:38,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2012 GetRequests, 1894 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2408 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3613, Invalid=10667, Unknown=0, NotChecked=0, Total=14280 [2018-02-04 00:20:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-02-04 00:20:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2090. [2018-02-04 00:20:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2018-02-04 00:20:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2096 transitions. [2018-02-04 00:20:38,710 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2096 transitions. Word has length 1918 [2018-02-04 00:20:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:38,710 INFO L432 AbstractCegarLoop]: Abstraction has 2090 states and 2096 transitions. [2018-02-04 00:20:38,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 00:20:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2096 transitions. [2018-02-04 00:20:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2018-02-04 00:20:38,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:38,728 INFO L351 BasicCegarLoop]: trace histogram [320, 298, 297, 297, 297, 297, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:20:38,728 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:20:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1744949341, now seen corresponding path program 57 times [2018-02-04 00:20:38,728 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:38,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:38,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:38,729 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:20:38,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:38,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 280621 backedges. 75983 proven. 1430 refuted. 0 times theorem prover too weak. 203208 trivial. 0 not checked. [2018-02-04 00:20:46,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:20:46,868 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:20:46,873 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:20:47,571 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-02-04 00:20:47,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:20:47,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:20:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 280621 backedges. 71601 proven. 4603 refuted. 0 times theorem prover too weak. 204417 trivial. 0 not checked. [2018-02-04 00:20:49,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:20:49,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 32] total 78 [2018-02-04 00:20:49,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 00:20:49,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 00:20:49,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=4813, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 00:20:49,124 INFO L87 Difference]: Start difference. First operand 2090 states and 2096 transitions. Second operand 78 states. [2018-02-04 00:20:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:51,726 INFO L93 Difference]: Finished difference Result 2110 states and 2114 transitions. [2018-02-04 00:20:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-02-04 00:20:51,726 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 2062 [2018-02-04 00:20:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:51,729 INFO L225 Difference]: With dead ends: 2110 [2018-02-04 00:20:51,729 INFO L226 Difference]: Without dead ends: 2104 [2018-02-04 00:20:51,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2220 GetRequests, 2033 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12227 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5973, Invalid=29559, Unknown=0, NotChecked=0, Total=35532 [2018-02-04 00:20:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-02-04 00:20:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2090. [2018-02-04 00:20:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2018-02-04 00:20:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2094 transitions. [2018-02-04 00:20:51,741 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2094 transitions. Word has length 2062 [2018-02-04 00:20:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:51,741 INFO L432 AbstractCegarLoop]: Abstraction has 2090 states and 2094 transitions. [2018-02-04 00:20:51,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 00:20:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2094 transitions. [2018-02-04 00:20:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2069 [2018-02-04 00:20:51,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:51,759 INFO L351 BasicCegarLoop]: trace histogram [321, 299, 298, 298, 298, 298, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:20:51,759 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 00:20:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash -7420133, now seen corresponding path program 58 times [2018-02-04 00:20:51,759 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:51,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:51,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:51,760 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:20:51,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:51,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 00:20:53,777 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 00:20:53,780 INFO L168 Benchmark]: Toolchain (without parser) took 182669.67 ms. Allocated memory was 405.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 363.4 MB in the beginning and 1.4 GB in the end (delta: -991.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-02-04 00:20:53,780 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:20:53,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.99 ms. Allocated memory is still 405.3 MB. Free memory was 363.4 MB in the beginning and 355.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:20:53,781 INFO L168 Benchmark]: Boogie Preprocessor took 24.89 ms. Allocated memory is still 405.3 MB. Free memory was 355.4 MB in the beginning and 352.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:20:53,781 INFO L168 Benchmark]: RCFGBuilder took 172.50 ms. Allocated memory is still 405.3 MB. Free memory was 352.7 MB in the beginning and 337.2 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. [2018-02-04 00:20:53,781 INFO L168 Benchmark]: TraceAbstraction took 182320.26 ms. Allocated memory was 405.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 335.9 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-02-04 00:20:53,782 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.37 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.99 ms. Allocated memory is still 405.3 MB. Free memory was 363.4 MB in the beginning and 355.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.89 ms. Allocated memory is still 405.3 MB. Free memory was 355.4 MB in the beginning and 352.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 172.50 ms. Allocated memory is still 405.3 MB. Free memory was 352.7 MB in the beginning and 337.2 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 182320.26 ms. Allocated memory was 405.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 335.9 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-20-53-787.csv Completed graceful shutdown