./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9918b49e0d76e4ce36b6a6760021b33460a8ae9b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 15:52:06,740 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 15:52:06,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 15:52:06,759 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 15:52:06,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 15:52:06,762 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 15:52:06,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 15:52:06,768 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 15:52:06,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 15:52:06,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 15:52:06,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 15:52:06,775 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 15:52:06,776 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 15:52:06,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 15:52:06,785 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 15:52:06,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 15:52:06,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 15:52:06,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 15:52:06,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 15:52:06,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 15:52:06,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 15:52:06,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 15:52:06,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 15:52:06,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 15:52:06,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 15:52:06,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 15:52:06,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 15:52:06,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 15:52:06,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 15:52:06,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 15:52:06,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 15:52:06,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 15:52:06,807 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 15:52:06,807 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 15:52:06,809 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 15:52:06,809 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 15:52:06,810 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 15:52:06,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 15:52:06,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 15:52:06,836 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 15:52:06,837 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 15:52:06,837 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 15:52:06,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 15:52:06,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 15:52:06,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 15:52:06,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 15:52:06,840 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 15:52:06,840 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 15:52:06,840 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 15:52:06,840 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 15:52:06,840 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 15:52:06,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 15:52:06,841 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 15:52:06,841 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 15:52:06,842 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 15:52:06,842 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 15:52:06,842 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 15:52:06,842 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 15:52:06,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:52:06,843 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 15:52:06,845 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 15:52:06,845 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 15:52:06,845 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 15:52:06,845 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 15:52:06,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 15:52:06,846 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9918b49e0d76e4ce36b6a6760021b33460a8ae9b [2018-12-30 15:52:06,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 15:52:06,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 15:52:06,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 15:52:06,935 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 15:52:06,936 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 15:52:06,936 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-12-30 15:52:07,003 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999a573e7/83d6f60703e04deebcaab90ae439bdbd/FLAG1b2c229e5 [2018-12-30 15:52:07,466 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 15:52:07,467 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-12-30 15:52:07,474 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999a573e7/83d6f60703e04deebcaab90ae439bdbd/FLAG1b2c229e5 [2018-12-30 15:52:07,835 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999a573e7/83d6f60703e04deebcaab90ae439bdbd [2018-12-30 15:52:07,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 15:52:07,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 15:52:07,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 15:52:07,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 15:52:07,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 15:52:07,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:52:07" (1/1) ... [2018-12-30 15:52:07,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:07, skipping insertion in model container [2018-12-30 15:52:07,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:52:07" (1/1) ... [2018-12-30 15:52:07,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 15:52:07,884 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 15:52:08,068 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:52:08,072 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 15:52:08,093 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:52:08,108 INFO L195 MainTranslator]: Completed translation [2018-12-30 15:52:08,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08 WrapperNode [2018-12-30 15:52:08,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 15:52:08,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 15:52:08,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 15:52:08,111 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 15:52:08,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (1/1) ... [2018-12-30 15:52:08,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (1/1) ... [2018-12-30 15:52:08,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 15:52:08,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 15:52:08,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 15:52:08,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 15:52:08,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (1/1) ... [2018-12-30 15:52:08,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (1/1) ... [2018-12-30 15:52:08,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (1/1) ... [2018-12-30 15:52:08,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (1/1) ... [2018-12-30 15:52:08,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (1/1) ... [2018-12-30 15:52:08,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (1/1) ... [2018-12-30 15:52:08,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (1/1) ... [2018-12-30 15:52:08,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 15:52:08,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 15:52:08,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 15:52:08,172 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 15:52:08,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (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 [2018-12-30 15:52:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 15:52:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 15:52:08,596 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 15:52:08,596 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-12-30 15:52:08,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:52:08 BoogieIcfgContainer [2018-12-30 15:52:08,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 15:52:08,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 15:52:08,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 15:52:08,601 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 15:52:08,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 03:52:07" (1/3) ... [2018-12-30 15:52:08,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cdd18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:52:08, skipping insertion in model container [2018-12-30 15:52:08,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:52:08" (2/3) ... [2018-12-30 15:52:08,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cdd18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:52:08, skipping insertion in model container [2018-12-30 15:52:08,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:52:08" (3/3) ... [2018-12-30 15:52:08,605 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-12-30 15:52:08,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 15:52:08,634 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-30 15:52:08,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-30 15:52:08,727 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 15:52:08,728 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 15:52:08,728 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 15:52:08,728 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 15:52:08,728 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 15:52:08,728 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 15:52:08,729 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 15:52:08,729 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 15:52:08,729 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 15:52:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-30 15:52:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-30 15:52:08,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:08,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:08,751 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1540385985, now seen corresponding path program 1 times [2018-12-30 15:52:08,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:08,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:08,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:08,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:52:08,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:52:08,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:52:08,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:52:08,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:08,958 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-12-30 15:52:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:09,042 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2018-12-30 15:52:09,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:52:09,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-30 15:52:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:09,052 INFO L225 Difference]: With dead ends: 63 [2018-12-30 15:52:09,053 INFO L226 Difference]: Without dead ends: 34 [2018-12-30 15:52:09,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-30 15:52:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-12-30 15:52:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-30 15:52:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-12-30 15:52:09,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 7 [2018-12-30 15:52:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:09,089 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-12-30 15:52:09,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:52:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-12-30 15:52:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-30 15:52:09,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:09,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:09,091 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:09,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash 687615503, now seen corresponding path program 1 times [2018-12-30 15:52:09,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:09,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:09,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:09,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:09,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:09,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:52:09,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:52:09,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:52:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:52:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:09,134 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-12-30 15:52:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:09,168 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-30 15:52:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:52:09,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-30 15:52:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:09,170 INFO L225 Difference]: With dead ends: 37 [2018-12-30 15:52:09,170 INFO L226 Difference]: Without dead ends: 21 [2018-12-30 15:52:09,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-30 15:52:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-30 15:52:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-30 15:52:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-30 15:52:09,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 9 [2018-12-30 15:52:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:09,176 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-30 15:52:09,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:52:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-30 15:52:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 15:52:09,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:09,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:09,177 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:09,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1672373068, now seen corresponding path program 1 times [2018-12-30 15:52:09,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:09,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:09,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:09,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:52:09,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:52:09,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:52:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:52:09,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:09,220 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2018-12-30 15:52:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:09,284 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-12-30 15:52:09,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:52:09,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-30 15:52:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:09,286 INFO L225 Difference]: With dead ends: 38 [2018-12-30 15:52:09,286 INFO L226 Difference]: Without dead ends: 23 [2018-12-30 15:52:09,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-30 15:52:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-30 15:52:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-30 15:52:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-12-30 15:52:09,292 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 11 [2018-12-30 15:52:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:09,292 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-30 15:52:09,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:52:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-12-30 15:52:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-30 15:52:09,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:09,293 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:09,293 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1034091127, now seen corresponding path program 1 times [2018-12-30 15:52:09,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:09,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:09,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:09,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:09,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:09,307 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:52:09,307 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:52:09,307 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 15:52:09,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:09,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:09,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:52:09,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-12-30 15:52:09,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 15:52:09,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 15:52:09,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 15:52:09,541 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-12-30 15:52:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:09,792 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-30 15:52:09,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 15:52:09,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-30 15:52:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:09,794 INFO L225 Difference]: With dead ends: 40 [2018-12-30 15:52:09,794 INFO L226 Difference]: Without dead ends: 25 [2018-12-30 15:52:09,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:52:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-30 15:52:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-30 15:52:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-30 15:52:09,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-30 15:52:09,800 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-12-30 15:52:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:09,800 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-30 15:52:09,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 15:52:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-30 15:52:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 15:52:09,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:09,801 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:09,802 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:09,802 INFO L82 PathProgramCache]: Analyzing trace with hash 803998854, now seen corresponding path program 2 times [2018-12-30 15:52:09,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:09,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:09,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:09,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:09,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:09,810 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:52:09,811 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:52:09,811 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 [2018-12-30 15:52:09,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 15:52:09,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 15:52:09,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:09,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:10,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:52:10,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-12-30 15:52:10,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:52:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:52:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:52:10,035 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2018-12-30 15:52:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:10,310 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-12-30 15:52:10,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 15:52:10,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-30 15:52:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:10,313 INFO L225 Difference]: With dead ends: 42 [2018-12-30 15:52:10,313 INFO L226 Difference]: Without dead ends: 27 [2018-12-30 15:52:10,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:52:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-30 15:52:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-30 15:52:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-30 15:52:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-30 15:52:10,318 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2018-12-30 15:52:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:10,319 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-30 15:52:10,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:52:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-30 15:52:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 15:52:10,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:10,320 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:10,320 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:10,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:10,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1976911939, now seen corresponding path program 3 times [2018-12-30 15:52:10,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:10,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:10,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:10,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:10,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:10,344 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:52:10,344 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:52:10,344 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 15:52:10,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-30 15:52:10,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-30 15:52:10,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:10,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:52:10,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:52:10,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-12-30 15:52:10,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 15:52:10,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 15:52:10,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:52:10,541 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2018-12-30 15:52:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:10,650 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-12-30 15:52:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 15:52:10,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-30 15:52:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:10,652 INFO L225 Difference]: With dead ends: 46 [2018-12-30 15:52:10,652 INFO L226 Difference]: Without dead ends: 29 [2018-12-30 15:52:10,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 15:52:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-30 15:52:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-30 15:52:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-30 15:52:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-30 15:52:10,658 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2018-12-30 15:52:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:10,658 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-30 15:52:10,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 15:52:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-30 15:52:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 15:52:10,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:10,660 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:10,660 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:10,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1239358850, now seen corresponding path program 4 times [2018-12-30 15:52:10,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:10,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:10,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:10,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:10,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:10,670 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:52:10,671 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:52:10,671 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 [2018-12-30 15:52:10,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-30 15:52:10,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-30 15:52:10,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:10,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-30 15:52:11,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:52:11,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-12-30 15:52:11,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 15:52:11,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 15:52:11,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:52:11,114 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 8 states. [2018-12-30 15:52:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:11,419 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-12-30 15:52:11,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 15:52:11,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-30 15:52:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:11,423 INFO L225 Difference]: With dead ends: 46 [2018-12-30 15:52:11,424 INFO L226 Difference]: Without dead ends: 44 [2018-12-30 15:52:11,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-30 15:52:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-30 15:52:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2018-12-30 15:52:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-30 15:52:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-30 15:52:11,433 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-12-30 15:52:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:11,433 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-30 15:52:11,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 15:52:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-30 15:52:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 15:52:11,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:11,434 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:11,435 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:11,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:11,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1317757439, now seen corresponding path program 1 times [2018-12-30 15:52:11,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:11,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:11,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:11,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:11,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:11,446 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:52:11,446 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:52:11,447 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 [2018-12-30 15:52:11,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:52:11,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-30 15:52:11,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:52:11,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-12-30 15:52:11,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 15:52:11,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 15:52:11,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-30 15:52:11,702 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 10 states. [2018-12-30 15:52:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:12,056 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-12-30 15:52:12,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 15:52:12,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-30 15:52:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:12,060 INFO L225 Difference]: With dead ends: 50 [2018-12-30 15:52:12,060 INFO L226 Difference]: Without dead ends: 34 [2018-12-30 15:52:12,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-30 15:52:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-30 15:52:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-30 15:52:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-30 15:52:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-30 15:52:12,066 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2018-12-30 15:52:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:12,066 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-30 15:52:12,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 15:52:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-30 15:52:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 15:52:12,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:12,067 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:12,068 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash 243607739, now seen corresponding path program 5 times [2018-12-30 15:52:12,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:12,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:12,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:12,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:52:12,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:12,077 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:52:12,077 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:52:12,077 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 15:52:12,088 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-30 15:52:12,102 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-30 15:52:12,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:12,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-30 15:52:12,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:52:12,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:52:12,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:52:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:52:12,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:12,135 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-12-30 15:52:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:12,157 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-30 15:52:12,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:52:12,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 15:52:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:12,162 INFO L225 Difference]: With dead ends: 47 [2018-12-30 15:52:12,162 INFO L226 Difference]: Without dead ends: 34 [2018-12-30 15:52:12,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:52:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-30 15:52:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-12-30 15:52:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-30 15:52:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-30 15:52:12,168 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2018-12-30 15:52:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:12,168 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-30 15:52:12,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:52:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-30 15:52:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 15:52:12,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:52:12,169 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:52:12,169 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:52:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:52:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1110212667, now seen corresponding path program 6 times [2018-12-30 15:52:12,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:52:12,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:52:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:12,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:52:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:52:12,178 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:52:12,179 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:52:12,179 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 [2018-12-30 15:52:12,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-30 15:52:12,207 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-12-30 15:52:12,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:52:12,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:52:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-30 15:52:12,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:52:12,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-12-30 15:52:12,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-30 15:52:12,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-30 15:52:12,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-30 15:52:12,440 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 11 states. [2018-12-30 15:52:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:52:12,588 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-12-30 15:52:12,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 15:52:12,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-12-30 15:52:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:52:12,590 INFO L225 Difference]: With dead ends: 33 [2018-12-30 15:52:12,590 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 15:52:12,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-30 15:52:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 15:52:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 15:52:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 15:52:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 15:52:12,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-30 15:52:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:52:12,592 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 15:52:12,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-30 15:52:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 15:52:12,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 15:52:12,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 15:52:12,929 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2018-12-30 15:52:12,947 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 25) no Hoare annotation was computed. [2018-12-30 15:52:12,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 15:52:12,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 15:52:12,947 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2018-12-30 15:52:12,948 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 19 25) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~y~0)) (.cse3 (= ULTIMATE.start_gcd_test_~b 18)) (.cse4 (= ULTIMATE.start_main_~x~0 (+ (* 3 ULTIMATE.start_main_~y~0) ULTIMATE.start_gcd_test_~a))) (.cse1 (= ULTIMATE.start_main_~x~0 63)) (.cse2 (= ULTIMATE.start_main_~y~0 18))) (or (and .cse0 .cse1 .cse2 (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) ULTIMATE.start_main_~x~0)) (and .cse0 .cse1 .cse2 (= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) ULTIMATE.start_main_~x~0)) (and .cse3 .cse1 .cse2 (= ULTIMATE.start_main_~x~0 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a))) (and .cse4 (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~x~0) 72) .cse1 .cse2) (and .cse2 .cse3 .cse1 (= ULTIMATE.start_gcd_test_~a ULTIMATE.start_main_~x~0)) (and (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_main_~x~0 ULTIMATE.start_gcd_test_~a) 72) .cse4 .cse1 .cse2))) [2018-12-30 15:52:12,948 INFO L451 ceAbstractionStarter]: At program point L45(lines 30 46) the Hoare annotation is: true [2018-12-30 15:52:12,948 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-12-30 15:52:12,948 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 11 27) no Hoare annotation was computed. [2018-12-30 15:52:12,949 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-30 15:52:12,949 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 15:52:12,949 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 11 27) no Hoare annotation was computed. [2018-12-30 15:52:12,950 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-30 15:52:12,950 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-12-30 15:52:12,950 INFO L444 ceAbstractionStarter]: At program point L5-2(lines 4 9) the Hoare annotation is: (let ((.cse0 (* 3 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ .cse0 ULTIMATE.start_gcd_test_~a)) (= ULTIMATE.start_main_~x~0 63) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~y~0 18) (= ULTIMATE.start_main_~x~0 (+ |ULTIMATE.start_gcd_test_#res| .cse0)) (= 63 (+ ULTIMATE.start_main_~g~0 .cse0)))) [2018-12-30 15:52:12,950 INFO L448 ceAbstractionStarter]: For program point L5-3(lines 5 7) no Hoare annotation was computed. [2018-12-30 15:52:12,950 INFO L444 ceAbstractionStarter]: At program point L5-5(lines 4 9) the Hoare annotation is: (let ((.cse0 (* 3 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ .cse0 ULTIMATE.start_gcd_test_~a)) (= ULTIMATE.start_main_~x~0 63) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~y~0 18) (= ULTIMATE.start_main_~x~0 (+ |ULTIMATE.start_gcd_test_#res| .cse0)) (= 63 (+ ULTIMATE.start_main_~g~0 .cse0)))) [2018-12-30 15:52:12,950 INFO L448 ceAbstractionStarter]: For program point L5-6(lines 5 7) no Hoare annotation was computed. [2018-12-30 15:52:12,951 INFO L451 ceAbstractionStarter]: At program point L5-8(lines 4 9) the Hoare annotation is: true [2018-12-30 15:52:12,951 INFO L444 ceAbstractionStarter]: At program point L26(lines 10 27) the Hoare annotation is: (let ((.cse0 (* 3 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ .cse0 ULTIMATE.start_gcd_test_~a)) (= ULTIMATE.start_main_~x~0 63) (= ULTIMATE.start_main_~y~0 18) (= ULTIMATE.start_main_~x~0 (+ |ULTIMATE.start_gcd_test_#res| .cse0)))) [2018-12-30 15:52:12,951 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-12-30 15:52:12,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-30 15:52:12,951 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2018-12-30 15:52:12,951 INFO L448 ceAbstractionStarter]: For program point L6-2(line 6) no Hoare annotation was computed. [2018-12-30 15:52:12,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 03:52:12 BoogieIcfgContainer [2018-12-30 15:52:12,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 15:52:12,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 15:52:12,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 15:52:12,978 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 15:52:12,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:52:08" (3/4) ... [2018-12-30 15:52:12,984 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 15:52:12,995 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-30 15:52:12,995 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 15:52:13,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == 3 * y + a && x == 63) && y == 18) && x == \result + 3 * y [2018-12-30 15:52:13,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == 3 * y + a && x == 63) && 1 == cond) && y == 18) && x == \result + 3 * y) && 63 == g + 3 * y [2018-12-30 15:52:13,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == 3 * y + a && x == 63) && 1 == cond) && y == 18) && x == \result + 3 * y) && 63 == g + 3 * y [2018-12-30 15:52:13,055 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 15:52:13,055 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 15:52:13,056 INFO L168 Benchmark]: Toolchain (without parser) took 5216.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 948.7 MB in the beginning and 828.4 MB in the end (delta: 120.2 MB). Peak memory consumption was 250.3 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:13,058 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:52:13,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.80 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 936.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:13,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.79 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:52:13,059 INFO L168 Benchmark]: Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:13,061 INFO L168 Benchmark]: RCFGBuilder took 425.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:13,062 INFO L168 Benchmark]: TraceAbstraction took 4379.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 835.2 MB in the end (delta: 270.3 MB). Peak memory consumption was 270.3 MB. Max. memory is 11.5 GB. [2018-12-30 15:52:13,063 INFO L168 Benchmark]: Witness Printer took 77.41 ms. Allocated memory is still 1.2 GB. Free memory is still 828.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:52:13,067 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.80 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 936.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.79 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 425.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4379.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 835.2 MB in the end (delta: 270.3 MB). Peak memory consumption was 270.3 MB. Max. memory is 11.5 GB. * Witness Printer took 77.41 ms. Allocated memory is still 1.2 GB. Free memory is still 828.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: ((x == 3 * y + a && x == 63) && y == 18) && x == \result + 3 * y - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: ((((x == 3 * y + a && x == 63) && 1 == cond) && y == 18) && x == \result + 3 * y) && 63 == g + 3 * y - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((b == y && x == 63) && y == 18) && b + a == x) || (((b == y && x == 63) && y == 18) && 2 * b + a == x)) || (((b == 18 && x == 63) && y == 18) && x == 3 * b + a)) || (((x == 3 * y + a && b + x == 72) && x == 63) && y == 18)) || (((y == 18 && b == 18) && x == 63) && a == x)) || (((b + x + a == 72 && x == 3 * y + a) && x == 63) && y == 18) - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: ((((x == 3 * y + a && x == 63) && 1 == cond) && y == 18) && x == \result + 3 * y) && 63 == g + 3 * y - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 3 error locations. SAFE Result, 4.2s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 91 SDslu, 267 SDs, 0 SdLazy, 467 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 29 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 20 NumberOfFragments, 187 HoareAnnotationTreeSize, 6 FomulaSimplifications, 151 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 129 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 154 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 144 ConstructedInterpolants, 2 QuantifiedInterpolants, 16274 SizeOfPredicates, 50 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 67/152 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...