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-673a906-m [2019-10-02 11:35:45,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:35:45,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:35:45,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:35:45,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:35:45,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:35:45,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:35:45,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:35:45,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:35:45,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:35:45,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:35:45,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:35:45,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:35:45,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:35:45,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:35:45,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:35:45,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:35:45,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:35:45,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:35:45,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:35:45,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:35:45,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:35:45,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:35:45,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:35:45,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:35:45,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:35:45,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:35:45,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:35:45,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:35:45,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:35:45,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:35:45,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:35:45,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:35:45,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:35:45,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:35:45,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:35:45,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:35:45,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:35:45,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:35:45,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:35:45,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:35:45,610 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-10-02 11:35:45,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:35:45,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:35:45,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:35:45,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:35:45,626 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:35:45,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:35:45,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:35:45,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:35:45,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:35:45,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:35:45,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:35:45,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:35:45,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:35:45,628 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:35:45,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:35:45,629 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:35:45,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:35:45,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:35:45,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:35:45,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:35:45,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:35:45,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:35:45,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:35:45,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:35:45,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:35:45,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:35:45,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:35:45,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:35:45,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:35:45,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:35:45,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:35:45,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:35:45,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:35:45,678 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:35:45,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/lcm1.c [2019-10-02 11:35:45,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f619fdbfa/1583d650646740cda1dafd3102e161f2/FLAGd10530d51 [2019-10-02 11:35:46,252 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:35:46,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm1.c [2019-10-02 11:35:46,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f619fdbfa/1583d650646740cda1dafd3102e161f2/FLAGd10530d51 [2019-10-02 11:35:46,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f619fdbfa/1583d650646740cda1dafd3102e161f2 [2019-10-02 11:35:46,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:35:46,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:35:46,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:35:46,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:35:46,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:35:46,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:35:46" (1/1) ... [2019-10-02 11:35:46,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404140b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46, skipping insertion in model container [2019-10-02 11:35:46,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:35:46" (1/1) ... [2019-10-02 11:35:46,671 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:35:46,689 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:35:46,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:35:46,875 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:35:46,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:35:46,908 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:35:46,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46 WrapperNode [2019-10-02 11:35:46,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:35:46,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:35:46,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:35:46,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:35:47,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46" (1/1) ... [2019-10-02 11:35:47,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46" (1/1) ... [2019-10-02 11:35:47,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46" (1/1) ... [2019-10-02 11:35:47,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46" (1/1) ... [2019-10-02 11:35:47,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46" (1/1) ... [2019-10-02 11:35:47,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46" (1/1) ... [2019-10-02 11:35:47,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46" (1/1) ... [2019-10-02 11:35:47,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:35:47,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:35:47,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:35:47,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:35:47,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46" (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-10-02 11:35:47,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:35:47,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:35:47,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:35:47,093 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:35:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:35:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:35:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:35:47,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:35:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:35:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:35:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:35:47,299 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:35:47,299 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 11:35:47,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:47 BoogieIcfgContainer [2019-10-02 11:35:47,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:35:47,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:35:47,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:35:47,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:35:47,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:35:46" (1/3) ... [2019-10-02 11:35:47,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adb5b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:35:47, skipping insertion in model container [2019-10-02 11:35:47,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:35:46" (2/3) ... [2019-10-02 11:35:47,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adb5b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:35:47, skipping insertion in model container [2019-10-02 11:35:47,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:47" (3/3) ... [2019-10-02 11:35:47,334 INFO L109 eAbstractionObserver]: Analyzing ICFG lcm1.c [2019-10-02 11:35:47,361 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:35:47,373 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:35:47,405 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:35:47,438 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:35:47,439 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:35:47,439 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:35:47,439 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:35:47,439 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:35:47,439 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:35:47,439 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:35:47,440 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:35:47,440 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:35:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-02 11:35:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:35:47,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:47,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:35:47,463 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:47,468 INFO L82 PathProgramCache]: Analyzing trace with hash -831554694, now seen corresponding path program 1 times [2019-10-02 11:35:47,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:47,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:47,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:47,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:35:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:35:47,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:35:47,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:35:47,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:35:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:35:47,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:35:47,620 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-02 11:35:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:35:47,645 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2019-10-02 11:35:47,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:35:47,646 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-02 11:35:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:35:47,655 INFO L225 Difference]: With dead ends: 49 [2019-10-02 11:35:47,655 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 11:35:47,659 INFO L640 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-10-02 11:35:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 11:35:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-02 11:35:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-02 11:35:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-10-02 11:35:47,699 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-10-02 11:35:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:35:47,700 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-02 11:35:47,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:35:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-10-02 11:35:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:35:47,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:47,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:35:47,702 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash -871444843, now seen corresponding path program 1 times [2019-10-02 11:35:47,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:47,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:47,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:47,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:47,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:47,714 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:35:47,714 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:35:47,715 INFO L224 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:35:47,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:35:47,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:35:47,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:35:47,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:35:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:35:47,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:35:47,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:35:47,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:35:47,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:35:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:35:47,892 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 5 states. [2019-10-02 11:35:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:35:48,031 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-02 11:35:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:35:48,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-02 11:35:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:35:48,034 INFO L225 Difference]: With dead ends: 39 [2019-10-02 11:35:48,034 INFO L226 Difference]: Without dead ends: 37 [2019-10-02 11:35:48,035 INFO L640 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-10-02 11:35:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-02 11:35:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-10-02 11:35:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-02 11:35:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-10-02 11:35:48,053 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 10 [2019-10-02 11:35:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:35:48,054 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-10-02 11:35:48,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:35:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-10-02 11:35:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:35:48,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:48,056 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:35:48,056 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1387131099, now seen corresponding path program 1 times [2019-10-02 11:35:48,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:48,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:48,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:48,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:48,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:48,079 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:35:48,079 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:35:48,079 INFO L224 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-10-02 11:35:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:35:48,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 11:35:48,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:35:48,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:35:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:35:48,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:35:48,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:35:48,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:35:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:35:48,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:35:48,240 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 6 states. [2019-10-02 11:35:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:35:48,464 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2019-10-02 11:35:48,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:35:48,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-02 11:35:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:35:48,468 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:35:48,468 INFO L226 Difference]: Without dead ends: 48 [2019-10-02 11:35:48,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:35:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-02 11:35:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-02 11:35:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-02 11:35:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-10-02 11:35:48,484 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 16 [2019-10-02 11:35:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:35:48,484 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-10-02 11:35:48,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:35:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-10-02 11:35:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:35:48,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:48,486 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:35:48,487 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1615934296, now seen corresponding path program 1 times [2019-10-02 11:35:48,487 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:48,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:48,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:48,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:48,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:48,496 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:35:48,497 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:35:48,497 INFO L224 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-10-02 11:35:48,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:35:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:35:48,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 11:35:48,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:35:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:35:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:35:48,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:35:48,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-10-02 11:35:48,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:35:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:35:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:35:48,650 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 6 states. [2019-10-02 11:35:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:35:48,827 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2019-10-02 11:35:48,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:35:48,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-02 11:35:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:35:48,829 INFO L225 Difference]: With dead ends: 65 [2019-10-02 11:35:48,830 INFO L226 Difference]: Without dead ends: 63 [2019-10-02 11:35:48,830 INFO L640 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-10-02 11:35:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-02 11:35:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-02 11:35:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 11:35:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2019-10-02 11:35:48,855 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 24 [2019-10-02 11:35:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:35:48,856 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2019-10-02 11:35:48,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:35:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2019-10-02 11:35:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:35:48,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:48,859 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:35:48,859 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1283188595, now seen corresponding path program 2 times [2019-10-02 11:35:48,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:48,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:48,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:48,888 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:35:48,888 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:35:48,889 INFO L224 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-10-02 11:35:48,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:35:48,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:35:48,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:35:48,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 11:35:48,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:35:49,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:35:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:35:49,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:35:49,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-10-02 11:35:49,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:35:49,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:35:49,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:35:49,058 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand 7 states. [2019-10-02 11:35:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:35:49,287 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2019-10-02 11:35:49,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:35:49,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-02 11:35:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:35:49,290 INFO L225 Difference]: With dead ends: 80 [2019-10-02 11:35:49,290 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 11:35:49,290 INFO L640 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-10-02 11:35:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 11:35:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-10-02 11:35:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-02 11:35:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2019-10-02 11:35:49,303 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 31 [2019-10-02 11:35:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:35:49,304 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2019-10-02 11:35:49,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:35:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2019-10-02 11:35:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:35:49,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:49,306 INFO L411 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-10-02 11:35:49,306 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:49,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:49,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1535457417, now seen corresponding path program 1 times [2019-10-02 11:35:49,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:49,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:49,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:49,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:35:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:49,315 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:35:49,315 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:35:49,315 INFO L224 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-10-02 11:35:49,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:35:49,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 11:35:49,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:35:49,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:35:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 11:35:49,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:35:49,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-10-02 11:35:49,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:35:49,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:35:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:35:49,487 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 7 states. [2019-10-02 11:35:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:35:49,723 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2019-10-02 11:35:49,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:35:49,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-10-02 11:35:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:35:49,727 INFO L225 Difference]: With dead ends: 93 [2019-10-02 11:35:49,727 INFO L226 Difference]: Without dead ends: 91 [2019-10-02 11:35:49,728 INFO L640 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-10-02 11:35:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-02 11:35:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2019-10-02 11:35:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-02 11:35:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2019-10-02 11:35:49,742 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 38 [2019-10-02 11:35:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:35:49,743 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2019-10-02 11:35:49,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:35:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2019-10-02 11:35:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:35:49,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:49,745 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:35:49,745 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1294737992, now seen corresponding path program 3 times [2019-10-02 11:35:49,746 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:49,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:49,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:49,753 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:35:49,754 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:35:49,754 INFO L224 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:35:49,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:35:49,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 11:35:49,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:35:49,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 11:35:49,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:35:49,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:35:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 11:35:49,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:35:49,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-10-02 11:35:49,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:35:49,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:35:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:35:49,915 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 8 states. [2019-10-02 11:35:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:35:50,078 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2019-10-02 11:35:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:35:50,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-10-02 11:35:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:35:50,080 INFO L225 Difference]: With dead ends: 104 [2019-10-02 11:35:50,080 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 11:35:50,084 INFO L640 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-10-02 11:35:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 11:35:50,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2019-10-02 11:35:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-02 11:35:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2019-10-02 11:35:50,107 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 38 [2019-10-02 11:35:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:35:50,108 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2019-10-02 11:35:50,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:35:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2019-10-02 11:35:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:35:50,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:50,114 INFO L411 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-10-02 11:35:50,114 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1467183567, now seen corresponding path program 1 times [2019-10-02 11:35:50,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:50,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:50,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:35:50,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:50,130 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:35:50,130 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:35:50,131 INFO L224 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-10-02 11:35:50,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:35:50,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 11:35:50,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:35:50,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:35:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:35:50,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:35:50,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-10-02 11:35:50,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:35:50,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:35:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:35:50,299 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand 8 states. [2019-10-02 11:35:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:35:50,539 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2019-10-02 11:35:50,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:35:50,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-02 11:35:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:35:50,541 INFO L225 Difference]: With dead ends: 142 [2019-10-02 11:35:50,541 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 11:35:50,542 INFO L640 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-10-02 11:35:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 11:35:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-02 11:35:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-02 11:35:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2019-10-02 11:35:50,558 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 133 transitions. Word has length 44 [2019-10-02 11:35:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:35:50,559 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 133 transitions. [2019-10-02 11:35:50,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:35:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2019-10-02 11:35:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:35:50,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:35:50,563 INFO L411 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-10-02 11:35:50,563 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:35:50,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:35:50,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1996165331, now seen corresponding path program 1 times [2019-10-02 11:35:50,564 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:35:50,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:35:50,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:50,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:50,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:35:50,574 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:35:50,575 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:35:50,575 INFO L224 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:35:50,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:35:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:35:50,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:35:50,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:35:50,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:35:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:35:50,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:35:50,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-10-02 11:35:50,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:35:50,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:35:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:35:50,975 INFO L87 Difference]: Start difference. First operand 100 states and 133 transitions. Second operand 10 states. [2019-10-02 11:35:58,156 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-02 11:36:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:08,788 INFO L93 Difference]: Finished difference Result 217 states and 308 transitions. [2019-10-02 11:36:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:36:08,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-02 11:36:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:08,797 INFO L225 Difference]: With dead ends: 217 [2019-10-02 11:36:08,797 INFO L226 Difference]: Without dead ends: 159 [2019-10-02 11:36:08,799 INFO L640 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-10-02 11:36:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-02 11:36:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 141. [2019-10-02 11:36:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-02 11:36:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2019-10-02 11:36:08,838 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 44 [2019-10-02 11:36:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:08,840 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2019-10-02 11:36:08,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:36:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2019-10-02 11:36:08,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 11:36:08,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:08,845 INFO L411 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-10-02 11:36:08,846 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:08,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:08,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1303301358, now seen corresponding path program 1 times [2019-10-02 11:36:08,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:08,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:08,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:08,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:08,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:08,861 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:08,861 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:08,861 INFO L224 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) [2019-10-02 11:36:08,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:36:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:36:08,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:36:08,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:08,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 11:36:08,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:36:08,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:36:08,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:36:08,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:36:08,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:36:08,956 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand 6 states. [2019-10-02 11:36:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:09,022 INFO L93 Difference]: Finished difference Result 245 states and 335 transitions. [2019-10-02 11:36:09,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:36:09,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-02 11:36:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:09,022 INFO L225 Difference]: With dead ends: 245 [2019-10-02 11:36:09,023 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:36:09,025 INFO L640 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-10-02 11:36:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:36:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:36:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:36:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:36:09,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-10-02 11:36:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:09,026 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:36:09,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:36:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:36:09,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:36:09,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:36:11,247 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-10-02 11:36:11,402 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:36:11,402 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:36:11,402 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:36:11,402 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:36:11,402 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:36:11,402 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:36:11,403 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-10-02 11:36:11,403 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-10-02 11:36:11,403 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 30 50) no Hoare annotation was computed. [2019-10-02 11:36:11,403 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 58) no Hoare annotation was computed. [2019-10-02 11:36:11,403 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-10-02 11:36:11,403 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-10-02 11:36:11,404 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 43 49) no Hoare annotation was computed. [2019-10-02 11:36:11,404 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-10-02 11:36:11,404 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 35 41) no Hoare annotation was computed. [2019-10-02 11:36:11,404 INFO L443 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-10-02 11:36:11,404 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 58) no Hoare annotation was computed. [2019-10-02 11:36:11,404 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 17 58) the Hoare annotation is: true [2019-10-02 11:36:11,405 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-10-02 11:36:11,405 INFO L443 ceAbstractionStarter]: For program point L43-1(lines 30 50) no Hoare annotation was computed. [2019-10-02 11:36:11,405 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-10-02 11:36:11,405 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2019-10-02 11:36:11,405 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 12) no Hoare annotation was computed. [2019-10-02 11:36:11,405 INFO L443 ceAbstractionStarter]: For program point L10(lines 10 13) no Hoare annotation was computed. [2019-10-02 11:36:11,405 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2019-10-02 11:36:11,406 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-10-02 11:36:11,406 INFO L443 ceAbstractionStarter]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2019-10-02 11:36:11,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:36:11 BoogieIcfgContainer [2019-10-02 11:36:11,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:36:11,422 INFO L168 Benchmark]: Toolchain (without parser) took 24765.71 ms. Allocated memory was 135.8 MB in the beginning and 256.9 MB in the end (delta: 121.1 MB). Free memory was 88.6 MB in the beginning and 159.2 MB in the end (delta: -70.6 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:36:11,423 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.8 MB. Free memory was 106.6 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:36:11,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.38 ms. Allocated memory is still 135.8 MB. Free memory was 88.4 MB in the beginning and 78.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:36:11,425 INFO L168 Benchmark]: Boogie Preprocessor took 116.93 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 78.3 MB in the beginning and 177.0 MB in the end (delta: -98.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:36:11,426 INFO L168 Benchmark]: RCFGBuilder took 286.71 ms. Allocated memory is still 200.3 MB. Free memory was 177.0 MB in the beginning and 164.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:36:11,427 INFO L168 Benchmark]: TraceAbstraction took 24105.56 ms. Allocated memory was 200.3 MB in the beginning and 256.9 MB in the end (delta: 56.6 MB). Free memory was 163.8 MB in the beginning and 159.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:36:11,431 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.23 ms. Allocated memory is still 135.8 MB. Free memory was 106.6 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 251.38 ms. Allocated memory is still 135.8 MB. Free memory was 88.4 MB in the beginning and 78.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.93 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 78.3 MB in the beginning and 177.0 MB in the end (delta: -98.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 286.71 ms. Allocated memory is still 200.3 MB. Free memory was 177.0 MB in the beginning and 164.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24105.56 ms. Allocated memory was 200.3 MB in the beginning and 256.9 MB in the end (delta: 56.6 MB). Free memory was 163.8 MB in the beginning and 159.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 61.2 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, 23.9s OverallTime, 10 OverallIterations, 7 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 276 SDtfs, 144 SDslu, 915 SDs, 0 SdLazy, 914 SolverSat, 85 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.7s 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.1s 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.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s 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...