java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/lcm1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:19:09,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:19:09,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:19:09,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:19:09,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:19:09,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:19:09,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:19:09,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:19:09,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:19:09,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:19:09,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:19:09,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:19:09,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:19:09,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:19:09,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:19:09,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:19:09,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:19:09,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:19:09,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:19:09,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:19:09,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:19:09,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:19:09,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:19:09,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:19:09,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:19:09,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:19:09,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:19:09,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:19:09,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:19:09,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:19:09,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:19:09,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:19:09,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:19:09,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:19:09,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:19:09,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:19:09,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:19:09,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:19:09,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:19:09,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:19:09,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:19:09,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 20:19:09,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:19:09,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:19:09,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:19:09,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:19:09,746 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:19:09,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:19:09,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:19:09,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:19:09,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:19:09,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:19:09,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:19:09,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:19:09,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:19:09,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:19:09,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:19:09,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:19:09,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:19:09,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:19:09,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:19:09,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:19:09,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:19:09,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:19:09,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:19:09,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:19:09,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:19:09,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:19:09,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:19:09,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:19:09,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:19:09,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:19:09,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:19:09,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:19:09,806 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:19:09,806 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:19:09,807 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/lcm1.c [2019-09-03 20:19:09,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef69d539/389faec65a6142ec9c95a9e391c28f87/FLAG3e61c4e1a [2019-09-03 20:19:10,301 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:19:10,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm1.c [2019-09-03 20:19:10,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef69d539/389faec65a6142ec9c95a9e391c28f87/FLAG3e61c4e1a [2019-09-03 20:19:10,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef69d539/389faec65a6142ec9c95a9e391c28f87 [2019-09-03 20:19:10,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:19:10,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:19:10,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:19:10,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:19:10,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:19:10,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:19:10" (1/1) ... [2019-09-03 20:19:10,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268f6ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10, skipping insertion in model container [2019-09-03 20:19:10,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:19:10" (1/1) ... [2019-09-03 20:19:10,710 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:19:10,731 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:19:10,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:19:10,899 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:19:10,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:19:10,932 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:19:10,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10 WrapperNode [2019-09-03 20:19:10,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:19:10,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:19:10,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:19:10,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:19:11,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10" (1/1) ... [2019-09-03 20:19:11,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10" (1/1) ... [2019-09-03 20:19:11,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10" (1/1) ... [2019-09-03 20:19:11,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10" (1/1) ... [2019-09-03 20:19:11,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10" (1/1) ... [2019-09-03 20:19:11,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10" (1/1) ... [2019-09-03 20:19:11,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10" (1/1) ... [2019-09-03 20:19:11,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:19:11,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:19:11,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:19:11,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:19:11,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-03 20:19:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:19:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:19:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:19:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:19:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:19:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:19:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:19:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:19:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:19:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:19:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:19:11,301 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:19:11,302 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 20:19:11,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:19:11 BoogieIcfgContainer [2019-09-03 20:19:11,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:19:11,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:19:11,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:19:11,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:19:11,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:19:10" (1/3) ... [2019-09-03 20:19:11,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110d3747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:19:11, skipping insertion in model container [2019-09-03 20:19:11,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:10" (2/3) ... [2019-09-03 20:19:11,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110d3747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:19:11, skipping insertion in model container [2019-09-03 20:19:11,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:19:11" (3/3) ... [2019-09-03 20:19:11,311 INFO L109 eAbstractionObserver]: Analyzing ICFG lcm1.c [2019-09-03 20:19:11,321 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:19:11,329 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:19:11,349 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:19:11,409 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:19:11,413 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:19:11,413 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:19:11,414 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:19:11,414 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:19:11,414 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:19:11,416 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:19:11,416 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:19:11,417 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:19:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-03 20:19:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:19:11,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:11,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:11,445 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:11,450 INFO L82 PathProgramCache]: Analyzing trace with hash -831554694, now seen corresponding path program 1 times [2019-09-03 20:19:11,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:11,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:11,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:11,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:11,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:11,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:19:11,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:19:11,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:19:11,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:19:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:19:11,580 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-03 20:19:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:11,603 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2019-09-03 20:19:11,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:19:11,604 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:19:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:11,616 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:19:11,618 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:19:11,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:19:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:19:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 20:19:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:19:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-09-03 20:19:11,697 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-09-03 20:19:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:11,698 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-09-03 20:19:11,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:19:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-09-03 20:19:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:19:11,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:11,701 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:11,702 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:11,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:11,705 INFO L82 PathProgramCache]: Analyzing trace with hash -871444843, now seen corresponding path program 1 times [2019-09-03 20:19:11,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:11,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:11,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:11,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:11,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:11,734 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:11,735 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:11,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:19:11,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:11,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:19:11,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:11,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:11,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:19:11,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:19:11,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:19:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:19:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:19:11,935 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 5 states. [2019-09-03 20:19:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:12,055 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-09-03 20:19:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:19:12,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 20:19:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:12,058 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:19:12,058 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:19:12,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:19:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:19:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-03 20:19:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:19:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-09-03 20:19:12,073 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 10 [2019-09-03 20:19:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:12,073 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-09-03 20:19:12,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:19:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-09-03 20:19:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:19:12,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:12,075 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:12,075 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1387131099, now seen corresponding path program 1 times [2019-09-03 20:19:12,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:12,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:12,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:12,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,084 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:12,084 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:12,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:12,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:12,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:19:12,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:12,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:12,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:19:12,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:19:12,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:19:12,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:19:12,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:19:12,212 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 6 states. [2019-09-03 20:19:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:12,363 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2019-09-03 20:19:12,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:19:12,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-03 20:19:12,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:12,366 INFO L225 Difference]: With dead ends: 56 [2019-09-03 20:19:12,366 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 20:19:12,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 20:19:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-03 20:19:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 20:19:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-09-03 20:19:12,381 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 16 [2019-09-03 20:19:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:12,381 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-09-03 20:19:12,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:19:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-09-03 20:19:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:19:12,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:12,383 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:12,383 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:12,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1615934296, now seen corresponding path program 1 times [2019-09-03 20:19:12,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:12,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:12,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:12,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,391 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:12,391 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:12,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:19:12,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:12,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:19:12,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:12,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:19:12,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:12,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-03 20:19:12,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:19:12,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:19:12,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:19:12,514 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 6 states. [2019-09-03 20:19:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:12,697 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2019-09-03 20:19:12,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:19:12,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-09-03 20:19:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:12,699 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:19:12,699 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 20:19:12,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 20:19:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-03 20:19:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 20:19:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2019-09-03 20:19:12,711 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 24 [2019-09-03 20:19:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:12,712 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2019-09-03 20:19:12,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:19:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2019-09-03 20:19:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:19:12,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:12,714 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:12,714 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1283188595, now seen corresponding path program 2 times [2019-09-03 20:19:12,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:12,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:12,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:12,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,721 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:12,721 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:12,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:12,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:19:12,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:19:12,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:19:12,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:19:12,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:12,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:19:12,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:12,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:19:12,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:19:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:19:12,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:12,874 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand 7 states. [2019-09-03 20:19:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:13,117 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2019-09-03 20:19:13,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:19:13,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-03 20:19:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:13,120 INFO L225 Difference]: With dead ends: 80 [2019-09-03 20:19:13,120 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 20:19:13,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 20:19:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-09-03 20:19:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 20:19:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2019-09-03 20:19:13,134 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 31 [2019-09-03 20:19:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:13,135 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2019-09-03 20:19:13,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:19:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2019-09-03 20:19:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:19:13,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:13,137 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:13,137 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:13,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1535457417, now seen corresponding path program 1 times [2019-09-03 20:19:13,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:13,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:13,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:19:13,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,144 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:13,144 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:13,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:13,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:13,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:19:13,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:13,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:19:13,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:13,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:19:13,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:19:13,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:19:13,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:13,294 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 7 states. [2019-09-03 20:19:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:13,514 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2019-09-03 20:19:13,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:19:13,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-09-03 20:19:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:13,516 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:19:13,517 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 20:19:13,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 20:19:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2019-09-03 20:19:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 20:19:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2019-09-03 20:19:13,541 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 38 [2019-09-03 20:19:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:13,542 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2019-09-03 20:19:13,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:19:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2019-09-03 20:19:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:19:13,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:13,550 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:13,550 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1294737992, now seen corresponding path program 3 times [2019-09-03 20:19:13,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:13,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:13,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:13,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,563 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:13,566 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:13,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:19:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:13,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:19:13,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:19:13,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:19:13,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:13,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Exception during sending of exit command (exit): Stream closed [2019-09-03 20:19:13,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:13,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:19:13,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:19:13,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:19:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:13,710 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 8 states. [2019-09-03 20:19:13,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:13,883 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2019-09-03 20:19:13,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:19:13,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-09-03 20:19:13,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:13,886 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:19:13,886 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 20:19:13,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:19:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 20:19:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2019-09-03 20:19:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 20:19:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2019-09-03 20:19:13,900 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 38 [2019-09-03 20:19:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:13,901 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2019-09-03 20:19:13,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:19:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2019-09-03 20:19:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:19:13,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:13,903 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:13,903 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1467183567, now seen corresponding path program 1 times [2019-09-03 20:19:13,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:13,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:19:13,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,909 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:13,909 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:13,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:13,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:13,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:19:13,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:14,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:19:14,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:14,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:19:14,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:19:14,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:19:14,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:14,073 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand 8 states. [2019-09-03 20:19:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:14,419 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2019-09-03 20:19:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:19:14,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-09-03 20:19:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:14,421 INFO L225 Difference]: With dead ends: 142 [2019-09-03 20:19:14,421 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 20:19:14,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:19:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 20:19:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-03 20:19:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:19:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2019-09-03 20:19:14,436 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 133 transitions. Word has length 44 [2019-09-03 20:19:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:14,436 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 133 transitions. [2019-09-03 20:19:14,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:19:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2019-09-03 20:19:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:19:14,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:14,438 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:14,438 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:14,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1996165331, now seen corresponding path program 1 times [2019-09-03 20:19:14,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:14,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:14,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:14,444 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:14,444 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:14,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:19:14,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:14,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:19:14,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:14,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:19:14,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:14,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:19:14,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:19:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:19:14,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:19:14,872 INFO L87 Difference]: Start difference. First operand 100 states and 133 transitions. Second operand 10 states. [2019-09-03 20:19:21,923 WARN L188 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-03 20:19:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:28,126 INFO L93 Difference]: Finished difference Result 217 states and 308 transitions. [2019-09-03 20:19:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:19:28,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-09-03 20:19:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:28,132 INFO L225 Difference]: With dead ends: 217 [2019-09-03 20:19:28,133 INFO L226 Difference]: Without dead ends: 159 [2019-09-03 20:19:28,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:19:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-03 20:19:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 141. [2019-09-03 20:19:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-03 20:19:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2019-09-03 20:19:28,182 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 44 [2019-09-03 20:19:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:28,184 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2019-09-03 20:19:28,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:19:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2019-09-03 20:19:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 20:19:28,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:28,189 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:28,189 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:28,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1303301358, now seen corresponding path program 1 times [2019-09-03 20:19:28,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:28,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:28,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:28,206 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:28,206 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:28,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:28,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:19:28,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:28,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-03 20:19:28,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:19:28,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:19:28,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:19:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:19:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:19:28,290 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand 6 states. [2019-09-03 20:19:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:28,365 INFO L93 Difference]: Finished difference Result 245 states and 335 transitions. [2019-09-03 20:19:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:19:28,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-09-03 20:19:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:28,366 INFO L225 Difference]: With dead ends: 245 [2019-09-03 20:19:28,366 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:19:28,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:19:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:19:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:19:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:19:28,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-09-03 20:19:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:28,369 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:19:28,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:19:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:19:28,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:19:28,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 20:19:30,740 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-09-03 20:19:30,936 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-09-03 20:19:30,961 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 20:19:30,962 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:19:30,962 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:19:30,962 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 20:19:30,962 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 20:19:30,962 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 20:19:30,962 INFO L439 ceAbstractionStarter]: At program point L35-2(lines 35 41) the Hoare annotation is: (and (<= 1 main_~a~0) (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 main_~a~0))) [2019-09-03 20:19:30,962 INFO L439 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (<= 1 main_~a~0) (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 main_~a~0))) [2019-09-03 20:19:30,963 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 30 50) no Hoare annotation was computed. [2019-09-03 20:19:30,963 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 58) no Hoare annotation was computed. [2019-09-03 20:19:30,963 INFO L439 ceAbstractionStarter]: At program point L52(line 52) the Hoare annotation is: (and (<= 1 main_~a~0) (<= main_~y~0 main_~x~0) (exists ((main_~x~0 Int)) (and (<= main_~y~0 main_~x~0) (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 main_~a~0)) (<= main_~x~0 main_~y~0))) (<= main_~x~0 main_~y~0)) [2019-09-03 20:19:30,963 INFO L439 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (and (<= 1 main_~a~0) (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 main_~a~0))) [2019-09-03 20:19:30,963 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 43 49) no Hoare annotation was computed. [2019-09-03 20:19:30,963 INFO L439 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (<= 1 main_~a~0) (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 main_~a~0))) [2019-09-03 20:19:30,963 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 35 41) no Hoare annotation was computed. [2019-09-03 20:19:30,964 INFO L443 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-09-03 20:19:30,964 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 58) no Hoare annotation was computed. [2019-09-03 20:19:30,964 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 17 58) the Hoare annotation is: true [2019-09-03 20:19:30,964 INFO L439 ceAbstractionStarter]: At program point L30-2(lines 30 50) the Hoare annotation is: (and (<= 1 main_~a~0) (<= main_~y~0 main_~x~0) (exists ((main_~x~0 Int)) (and (<= main_~y~0 main_~x~0) (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 main_~a~0)) (<= main_~x~0 main_~y~0))) (<= main_~x~0 main_~y~0)) [2019-09-03 20:19:30,964 INFO L443 ceAbstractionStarter]: For program point L43-1(lines 30 50) no Hoare annotation was computed. [2019-09-03 20:19:30,964 INFO L439 ceAbstractionStarter]: At program point L43-2(lines 30 50) the Hoare annotation is: (and (<= 1 main_~a~0) (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 main_~a~0))) [2019-09-03 20:19:30,964 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-09-03 20:19:30,965 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2019-09-03 20:19:30,965 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 12) no Hoare annotation was computed. [2019-09-03 20:19:30,965 INFO L443 ceAbstractionStarter]: For program point L10(lines 10 13) no Hoare annotation was computed. [2019-09-03 20:19:30,965 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2019-09-03 20:19:30,965 INFO L443 ceAbstractionStarter]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2019-09-03 20:19:30,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:19:30 BoogieIcfgContainer [2019-09-03 20:19:30,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:19:30,981 INFO L168 Benchmark]: Toolchain (without parser) took 20283.44 ms. Allocated memory was 131.6 MB in the beginning and 266.3 MB in the end (delta: 134.7 MB). Free memory was 87.0 MB in the beginning and 198.8 MB in the end (delta: -111.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:19:30,982 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 131.6 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:19:30,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.14 ms. Allocated memory is still 131.6 MB. Free memory was 86.6 MB in the beginning and 77.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:19:30,984 INFO L168 Benchmark]: Boogie Preprocessor took 116.10 ms. Allocated memory was 131.6 MB in the beginning and 198.7 MB in the end (delta: 67.1 MB). Free memory was 77.1 MB in the beginning and 174.5 MB in the end (delta: -97.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:19:30,984 INFO L168 Benchmark]: RCFGBuilder took 253.55 ms. Allocated memory is still 198.7 MB. Free memory was 174.5 MB in the beginning and 161.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:19:30,985 INFO L168 Benchmark]: TraceAbstraction took 19674.45 ms. Allocated memory was 198.7 MB in the beginning and 266.3 MB in the end (delta: 67.6 MB). Free memory was 161.8 MB in the beginning and 198.8 MB in the end (delta: -37.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:19:30,989 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 131.6 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 235.14 ms. Allocated memory is still 131.6 MB. Free memory was 86.6 MB in the beginning and 77.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.10 ms. Allocated memory was 131.6 MB in the beginning and 198.7 MB in the end (delta: 67.1 MB). Free memory was 77.1 MB in the beginning and 174.5 MB in the end (delta: -97.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 253.55 ms. Allocated memory is still 198.7 MB. Free memory was 174.5 MB in the beginning and 161.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19674.45 ms. Allocated memory was 198.7 MB in the beginning and 266.3 MB in the end (delta: 67.6 MB). Free memory was 161.8 MB in the beginning and 198.8 MB in the end (delta: -37.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 <= a && x * u + y * v == b * a - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 <= a && x * u + y * v == b * a - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 19.5s OverallTime, 10 OverallIterations, 7 TraceHistogramMax, 14.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 276 SDtfs, 144 SDslu, 915 SDs, 0 SdLazy, 916 SolverSat, 85 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 106 PreInvPairs, 161 NumberOfFragments, 138 HoareAnnotationTreeSize, 106 FomulaSimplifications, 2536 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 224 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 304 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 294 ConstructedInterpolants, 4 QuantifiedInterpolants, 57542 SizeOfPredicates, 23 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 283/311 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...