./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/heapsort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/loop-invgen/heapsort_true-unreach-call_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 4fc86a08ff37d05adddb13279399a852f6ece83c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:20:50,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:20:50,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:20:50,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:20:50,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:20:50,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:20:50,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:20:50,694 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:20:50,697 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:20:50,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:20:50,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:20:50,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:20:50,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:20:50,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:20:50,703 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:20:50,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:20:50,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:20:50,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:20:50,708 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:20:50,710 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:20:50,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:20:50,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:20:50,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:20:50,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:20:50,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:20:50,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:20:50,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:20:50,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:20:50,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:20:50,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:20:50,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:20:50,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:20:50,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:20:50,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:20:50,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:20:50,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:20:50,723 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:20:50,738 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:20:50,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:20:50,739 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:20:50,739 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:20:50,740 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:20:50,740 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:20:50,740 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:20:50,740 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:20:50,741 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:20:50,741 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:20:50,741 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:20:50,741 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:20:50,741 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:20:50,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:20:50,742 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:20:50,742 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:20:50,742 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:20:50,742 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:20:50,742 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:20:50,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:20:50,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:20:50,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:20:50,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:20:50,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:20:50,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:20:50,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:20:50,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:20:50,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:20:50,744 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:20:50,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:20:50,744 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 -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2018-11-28 18:20:50,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:20:50,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:20:50,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:20:50,813 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:20:50,814 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:20:50,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-28 18:20:50,881 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd17b0b6/27ed7d065f264c609ea942c2d52848ee/FLAGe9377f871 [2018-11-28 18:20:51,380 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:20:51,381 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-28 18:20:51,388 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd17b0b6/27ed7d065f264c609ea942c2d52848ee/FLAGe9377f871 [2018-11-28 18:20:51,747 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd17b0b6/27ed7d065f264c609ea942c2d52848ee [2018-11-28 18:20:51,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:20:51,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:20:51,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:20:51,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:20:51,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:20:51,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:51" (1/1) ... [2018-11-28 18:20:51,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0b64ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:51, skipping insertion in model container [2018-11-28 18:20:51,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:51" (1/1) ... [2018-11-28 18:20:51,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:20:51,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:20:51,988 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:20:51,993 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:20:52,029 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:20:52,054 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:20:52,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52 WrapperNode [2018-11-28 18:20:52,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:20:52,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:20:52,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:20:52,056 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:20:52,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2018-11-28 18:20:52,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2018-11-28 18:20:52,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:20:52,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:20:52,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:20:52,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:20:52,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2018-11-28 18:20:52,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2018-11-28 18:20:52,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2018-11-28 18:20:52,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2018-11-28 18:20:52,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2018-11-28 18:20:52,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2018-11-28 18:20:52,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2018-11-28 18:20:52,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:20:52,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:20:52,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:20:52,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:20:52,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (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-11-28 18:20:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:20:52,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:20:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:20:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:20:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:20:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:20:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 18:20:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 18:20:52,715 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:20:52,715 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 18:20:52,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:52 BoogieIcfgContainer [2018-11-28 18:20:52,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:20:52,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:20:52,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:20:52,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:20:52,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:20:51" (1/3) ... [2018-11-28 18:20:52,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253d1d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:52, skipping insertion in model container [2018-11-28 18:20:52,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (2/3) ... [2018-11-28 18:20:52,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253d1d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:52, skipping insertion in model container [2018-11-28 18:20:52,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:52" (3/3) ... [2018-11-28 18:20:52,726 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-28 18:20:52,736 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:20:52,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:20:52,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:20:52,792 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:20:52,793 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:20:52,793 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:20:52,793 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:20:52,794 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:20:52,794 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:20:52,794 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:20:52,795 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:20:52,795 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:20:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-28 18:20:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:20:52,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:52,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:52,828 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:52,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:52,834 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2018-11-28 18:20:52,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:52,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:52,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:52,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:52,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:53,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:53,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:20:53,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:20:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:20:53,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:20:53,103 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2018-11-28 18:20:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:53,341 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-11-28 18:20:53,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:20:53,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:20:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:53,355 INFO L225 Difference]: With dead ends: 83 [2018-11-28 18:20:53,356 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 18:20:53,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:20:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 18:20:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 18:20:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 18:20:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2018-11-28 18:20:53,417 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2018-11-28 18:20:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:53,417 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2018-11-28 18:20:53,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:20:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2018-11-28 18:20:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:20:53,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:53,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:53,419 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:53,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2018-11-28 18:20:53,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:53,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:53,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:53,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:53,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:20:53,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:20:53,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:20:53,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:20:53,498 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2018-11-28 18:20:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:53,827 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2018-11-28 18:20:53,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:20:53,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:20:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:53,829 INFO L225 Difference]: With dead ends: 49 [2018-11-28 18:20:53,829 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 18:20:53,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:20:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 18:20:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-28 18:20:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 18:20:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2018-11-28 18:20:53,844 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2018-11-28 18:20:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:53,844 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2018-11-28 18:20:53,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:20:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2018-11-28 18:20:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:20:53,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:53,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:53,847 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:53,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2018-11-28 18:20:53,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:53,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:53,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:53,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:53,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:20:53,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:20:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:20:53,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:20:53,964 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2018-11-28 18:20:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:54,492 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2018-11-28 18:20:54,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:20:54,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 18:20:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:54,498 INFO L225 Difference]: With dead ends: 79 [2018-11-28 18:20:54,498 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 18:20:54,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:20:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 18:20:54,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-11-28 18:20:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 18:20:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2018-11-28 18:20:54,541 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2018-11-28 18:20:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:54,544 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2018-11-28 18:20:54,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:20:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2018-11-28 18:20:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:20:54,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:54,548 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:54,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:54,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2018-11-28 18:20:54,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:54,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:54,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:54,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:54,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:54,870 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:54,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:54,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:20:55,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:55,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2018-11-28 18:20:55,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:20:55,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:20:55,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:20:55,275 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 12 states. [2018-11-28 18:20:55,587 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-11-28 18:20:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:58,008 INFO L93 Difference]: Finished difference Result 262 states and 419 transitions. [2018-11-28 18:20:58,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 18:20:58,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-28 18:20:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:58,015 INFO L225 Difference]: With dead ends: 262 [2018-11-28 18:20:58,015 INFO L226 Difference]: Without dead ends: 197 [2018-11-28 18:20:58,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:20:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-28 18:20:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 141. [2018-11-28 18:20:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-28 18:20:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 225 transitions. [2018-11-28 18:20:58,066 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 225 transitions. Word has length 19 [2018-11-28 18:20:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:58,067 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 225 transitions. [2018-11-28 18:20:58,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:20:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 225 transitions. [2018-11-28 18:20:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:20:58,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:58,068 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:58,069 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:58,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2018-11-28 18:20:58,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:58,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:58,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:58,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:58,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:58,189 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:58,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:58,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:58,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:58,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-11-28 18:20:58,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:20:58,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:20:58,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:20:58,266 INFO L87 Difference]: Start difference. First operand 141 states and 225 transitions. Second operand 10 states. [2018-11-28 18:20:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:59,316 INFO L93 Difference]: Finished difference Result 244 states and 396 transitions. [2018-11-28 18:20:59,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:20:59,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-28 18:20:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:59,326 INFO L225 Difference]: With dead ends: 244 [2018-11-28 18:20:59,327 INFO L226 Difference]: Without dead ends: 242 [2018-11-28 18:20:59,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:20:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-28 18:20:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 145. [2018-11-28 18:20:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-28 18:20:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 228 transitions. [2018-11-28 18:20:59,375 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 228 transitions. Word has length 19 [2018-11-28 18:20:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:59,376 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 228 transitions. [2018-11-28 18:20:59,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:20:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 228 transitions. [2018-11-28 18:20:59,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:20:59,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:59,378 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:59,378 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:59,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2018-11-28 18:20:59,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:59,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:59,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:59,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:59,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:59,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:20:59,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:20:59,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:20:59,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:20:59,430 INFO L87 Difference]: Start difference. First operand 145 states and 228 transitions. Second operand 3 states. [2018-11-28 18:20:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:59,504 INFO L93 Difference]: Finished difference Result 187 states and 283 transitions. [2018-11-28 18:20:59,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:20:59,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 18:20:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:59,507 INFO L225 Difference]: With dead ends: 187 [2018-11-28 18:20:59,508 INFO L226 Difference]: Without dead ends: 140 [2018-11-28 18:20:59,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 18:20:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-28 18:20:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2018-11-28 18:20:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 18:20:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 178 transitions. [2018-11-28 18:20:59,551 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 178 transitions. Word has length 19 [2018-11-28 18:20:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:59,552 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 178 transitions. [2018-11-28 18:20:59,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:20:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 178 transitions. [2018-11-28 18:20:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:20:59,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:59,554 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:59,555 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:59,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2018-11-28 18:20:59,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:59,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:59,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:59,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:59,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:21:00,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:00,075 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:00,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:00,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:21:00,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:21:00,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 18:21:00,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:21:00,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:21:00,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:21:00,508 INFO L87 Difference]: Start difference. First operand 118 states and 178 transitions. Second operand 9 states. [2018-11-28 18:21:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:02,059 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2018-11-28 18:21:02,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:21:02,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-28 18:21:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:02,061 INFO L225 Difference]: With dead ends: 159 [2018-11-28 18:21:02,061 INFO L226 Difference]: Without dead ends: 157 [2018-11-28 18:21:02,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:21:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-28 18:21:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2018-11-28 18:21:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-28 18:21:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 227 transitions. [2018-11-28 18:21:02,098 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 227 transitions. Word has length 26 [2018-11-28 18:21:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:02,099 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 227 transitions. [2018-11-28 18:21:02,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:21:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 227 transitions. [2018-11-28 18:21:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:21:02,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:02,101 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:02,101 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:02,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2018-11-28 18:21:02,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:02,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:02,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:21:02,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:02,253 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:02,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:02,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:21:02,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:21:02,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2018-11-28 18:21:02,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 18:21:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 18:21:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:21:02,689 INFO L87 Difference]: Start difference. First operand 147 states and 227 transitions. Second operand 14 states. [2018-11-28 18:21:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:04,380 INFO L93 Difference]: Finished difference Result 268 states and 415 transitions. [2018-11-28 18:21:04,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:21:04,381 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-28 18:21:04,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:04,384 INFO L225 Difference]: With dead ends: 268 [2018-11-28 18:21:04,384 INFO L226 Difference]: Without dead ends: 266 [2018-11-28 18:21:04,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:21:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-28 18:21:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 227. [2018-11-28 18:21:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-28 18:21:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 357 transitions. [2018-11-28 18:21:04,430 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 357 transitions. Word has length 31 [2018-11-28 18:21:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:04,431 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 357 transitions. [2018-11-28 18:21:04,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 18:21:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 357 transitions. [2018-11-28 18:21:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:21:04,433 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:04,433 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:04,433 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:04,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1955682911, now seen corresponding path program 1 times [2018-11-28 18:21:04,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:04,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:04,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:04,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:21:04,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:04,675 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:04,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:04,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 18:21:04,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:21:04,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2018-11-28 18:21:04,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 18:21:04,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 18:21:04,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:21:04,849 INFO L87 Difference]: Start difference. First operand 227 states and 357 transitions. Second operand 13 states. [2018-11-28 18:21:05,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:05,855 INFO L93 Difference]: Finished difference Result 265 states and 402 transitions. [2018-11-28 18:21:05,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:21:05,858 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-28 18:21:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:05,860 INFO L225 Difference]: With dead ends: 265 [2018-11-28 18:21:05,861 INFO L226 Difference]: Without dead ends: 263 [2018-11-28 18:21:05,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:21:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-28 18:21:05,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 241. [2018-11-28 18:21:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-28 18:21:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 370 transitions. [2018-11-28 18:21:05,914 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 370 transitions. Word has length 31 [2018-11-28 18:21:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:05,914 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 370 transitions. [2018-11-28 18:21:05,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 18:21:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 370 transitions. [2018-11-28 18:21:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 18:21:05,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:05,916 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:05,916 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:05,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233346, now seen corresponding path program 1 times [2018-11-28 18:21:05,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:05,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:05,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 18:21:06,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:06,066 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:06,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:06,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 18:21:06,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:21:06,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-11-28 18:21:06,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:21:06,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:21:06,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:21:06,159 INFO L87 Difference]: Start difference. First operand 241 states and 370 transitions. Second operand 10 states. [2018-11-28 18:21:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:06,538 INFO L93 Difference]: Finished difference Result 248 states and 376 transitions. [2018-11-28 18:21:06,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:21:06,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-28 18:21:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:06,542 INFO L225 Difference]: With dead ends: 248 [2018-11-28 18:21:06,542 INFO L226 Difference]: Without dead ends: 246 [2018-11-28 18:21:06,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:21:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-28 18:21:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-11-28 18:21:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-28 18:21:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 373 transitions. [2018-11-28 18:21:06,595 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 373 transitions. Word has length 41 [2018-11-28 18:21:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:06,595 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 373 transitions. [2018-11-28 18:21:06,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:21:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 373 transitions. [2018-11-28 18:21:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 18:21:06,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:06,597 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:06,598 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:06,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:06,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1768387788, now seen corresponding path program 1 times [2018-11-28 18:21:06,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:06,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:06,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:06,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:06,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-28 18:21:06,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:06,732 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:06,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:06,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-28 18:21:06,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:21:06,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-28 18:21:06,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:21:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:21:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:21:06,859 INFO L87 Difference]: Start difference. First operand 245 states and 373 transitions. Second operand 12 states. [2018-11-28 18:21:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:08,498 INFO L93 Difference]: Finished difference Result 401 states and 599 transitions. [2018-11-28 18:21:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 18:21:08,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-28 18:21:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:08,500 INFO L225 Difference]: With dead ends: 401 [2018-11-28 18:21:08,500 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 18:21:08,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:21:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 18:21:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2018-11-28 18:21:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 18:21:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2018-11-28 18:21:08,526 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 53 [2018-11-28 18:21:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:08,527 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2018-11-28 18:21:08,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:21:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2018-11-28 18:21:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 18:21:08,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:08,528 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:08,528 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:08,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1118864811, now seen corresponding path program 1 times [2018-11-28 18:21:08,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:08,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:08,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:08,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:08,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-28 18:21:08,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:08,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:08,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:08,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-28 18:21:09,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:21:09,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-11-28 18:21:09,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:21:09,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:21:09,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:21:09,006 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand 9 states. [2018-11-28 18:21:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:09,422 INFO L93 Difference]: Finished difference Result 237 states and 343 transitions. [2018-11-28 18:21:09,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:21:09,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-11-28 18:21:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:09,425 INFO L225 Difference]: With dead ends: 237 [2018-11-28 18:21:09,425 INFO L226 Difference]: Without dead ends: 156 [2018-11-28 18:21:09,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:21:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-28 18:21:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 136. [2018-11-28 18:21:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 18:21:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2018-11-28 18:21:09,461 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 66 [2018-11-28 18:21:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:09,461 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2018-11-28 18:21:09,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:21:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2018-11-28 18:21:09,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 18:21:09,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:09,463 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:09,463 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:09,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2023812105, now seen corresponding path program 1 times [2018-11-28 18:21:09,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:09,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:09,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 25 proven. 45 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-28 18:21:09,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:09,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:09,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:09,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-28 18:21:10,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:21:10,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-28 18:21:10,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 18:21:10,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 18:21:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:21:10,035 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand 16 states. [2018-11-28 18:21:11,914 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-28 18:21:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:16,126 INFO L93 Difference]: Finished difference Result 272 states and 411 transitions. [2018-11-28 18:21:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 18:21:16,127 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2018-11-28 18:21:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:16,130 INFO L225 Difference]: With dead ends: 272 [2018-11-28 18:21:16,130 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 18:21:16,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=503, Invalid=1947, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 18:21:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 18:21:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2018-11-28 18:21:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 18:21:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2018-11-28 18:21:16,150 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 88 [2018-11-28 18:21:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:16,151 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2018-11-28 18:21:16,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 18:21:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2018-11-28 18:21:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-28 18:21:16,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:16,153 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:16,153 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:16,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:16,153 INFO L82 PathProgramCache]: Analyzing trace with hash -255930645, now seen corresponding path program 1 times [2018-11-28 18:21:16,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:16,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:16,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-28 18:21:16,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:16,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:16,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:16,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-28 18:21:16,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:21:16,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-28 18:21:16,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 18:21:16,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 18:21:16,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:21:16,691 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 16 states. [2018-11-28 18:21:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:20,160 INFO L93 Difference]: Finished difference Result 114 states and 154 transitions. [2018-11-28 18:21:20,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 18:21:20,162 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 110 [2018-11-28 18:21:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:20,162 INFO L225 Difference]: With dead ends: 114 [2018-11-28 18:21:20,163 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:21:20,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=717, Unknown=1, NotChecked=0, Total=930 [2018-11-28 18:21:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:21:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:21:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:21:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:21:20,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-11-28 18:21:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:20,165 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:21:20,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 18:21:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:21:20,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:21:20,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:21:20,377 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 131 [2018-11-28 18:21:20,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:20,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:20,577 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 131 [2018-11-28 18:21:20,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:20,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:20,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:20,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:20,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:20,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:21,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:21,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:21,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:21,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:24,032 WARN L180 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 104 DAG size of output: 50 [2018-11-28 18:21:24,642 WARN L180 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 43 [2018-11-28 18:21:25,838 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 100 DAG size of output: 27 [2018-11-28 18:21:27,353 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 129 DAG size of output: 43 [2018-11-28 18:21:27,610 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 27 [2018-11-28 18:21:27,925 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2018-11-28 18:21:28,296 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2018-11-28 18:21:28,863 WARN L180 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 43 [2018-11-28 18:21:29,156 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2018-11-28 18:21:29,708 WARN L180 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 43 [2018-11-28 18:21:29,835 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 16 [2018-11-28 18:21:30,197 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2018-11-28 18:21:30,773 WARN L180 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 47 [2018-11-28 18:21:30,923 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 15 [2018-11-28 18:21:31,288 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 33 [2018-11-28 18:21:31,320 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:21:31,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:21:31,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:21:31,320 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:21:31,320 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:21:31,321 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:21:31,321 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse3 (<= 1 main_~i~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= (* 2 main_~l~0) main_~j~0)) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse6 (< 0 main_~l~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 1 main_~l~0) .cse0 .cse1 .cse2 .cse3 (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) .cse4) (and .cse1 .cse2 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse4 .cse5 .cse6))) [2018-11-28 18:21:31,321 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-11-28 18:21:31,321 INFO L444 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (and (<= 1 main_~i~0) (and (<= 1 main_~l~0) (<= main_~j~0 main_~n~0) (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2)))))))) (or (and .cse0 (<= main_~i~0 main_~n~0) (<= main_~r~0 main_~n~0) (<= (* 2 main_~l~0) main_~j~0)) (and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (and (<= main_~r~0 main_~j~0) .cse0)))) [2018-11-28 18:21:31,321 INFO L444 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse3 (<= 1 main_~i~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= (* 2 main_~l~0) main_~j~0)) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse6 (< 0 main_~l~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 1 main_~l~0) .cse0 .cse1 .cse2 .cse3 (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) .cse4) (and .cse1 .cse2 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse4 .cse5 .cse6))) [2018-11-28 18:21:31,322 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 44) the Hoare annotation is: (let ((.cse5 (<= main_~i~0 main_~n~0)) (.cse0 (<= (* 2 main_~l~0) main_~j~0)) (.cse1 (<= main_~r~0 main_~n~0)) (.cse2 (< 0 main_~l~0)) (.cse3 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse6 (<= 1 main_~i~0)) (.cse4 (<= 1 main_~l~0))) (or (and .cse0 (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6 (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) .cse1) (and .cse5 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse0 .cse6 .cse1 .cse2 .cse3) (and .cse6 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0) (and .cse4 (<= main_~l~0 1) (<= 2 main_~r~0))))) [2018-11-28 18:21:31,322 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 21 54) no Hoare annotation was computed. [2018-11-28 18:21:31,322 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-11-28 18:21:31,322 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-11-28 18:21:31,322 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-11-28 18:21:31,322 INFO L444 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse4 (<= 1 main_~l~0)) (.cse5 (<= main_~r~0 main_~n~0)) (.cse6 (<= main_~j~0 main_~n~0))) (let ((.cse0 (<= 1 main_~i~0)) (.cse1 (<= main_~i~0 main_~n~0)) (.cse2 (<= (* 2 main_~l~0) main_~j~0)) (.cse3 (and (<= 2 main_~j~0) .cse4 .cse5 .cse6 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))))) (or (and .cse0 .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse2 .cse3) (and .cse4 .cse0 (and .cse5 .cse6) (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) .cse1 .cse2) (and (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse2 .cse3)))) [2018-11-28 18:21:31,322 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-28 18:21:31,322 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-11-28 18:21:31,323 INFO L444 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse4 (<= 1 main_~l~0)) (.cse5 (<= main_~r~0 main_~n~0)) (.cse6 (<= main_~j~0 main_~n~0))) (let ((.cse0 (<= 1 main_~i~0)) (.cse1 (<= main_~i~0 main_~n~0)) (.cse2 (<= (* 2 main_~l~0) main_~j~0)) (.cse3 (and (<= 2 main_~j~0) .cse4 .cse5 .cse6 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))))) (or (and .cse0 .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse2 .cse3) (and .cse4 .cse0 (and .cse5 .cse6) (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) .cse1 .cse2) (and (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse2 .cse3)))) [2018-11-28 18:21:31,323 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 54) no Hoare annotation was computed. [2018-11-28 18:21:31,323 INFO L444 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~i~0) (<= 1 main_~l~0) (<= main_~l~0 1) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-28 18:21:31,323 INFO L444 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~l~0 1) (<= main_~r~0 main_~n~0) (<= (* 2 main_~l~0) main_~j~0) (<= 2 main_~r~0)) [2018-11-28 18:21:31,323 INFO L444 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (and (<= 1 main_~i~0) (and (<= main_~r~0 main_~n~0) (<= 2 main_~l~0) (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (<= (* 2 main_~l~0) main_~j~0)))) (or (and .cse0 (<= main_~i~0 main_~n~0)) (and .cse0 (<= main_~j~0 main_~n~0)))) [2018-11-28 18:21:31,323 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-28 18:21:31,323 INFO L444 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (and (<= 1 main_~i~0) (and (<= main_~r~0 main_~n~0) (<= 2 main_~l~0) (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (<= (* 2 main_~l~0) main_~j~0)))) (or (and .cse0 (<= main_~i~0 main_~n~0)) (and .cse0 (<= main_~j~0 main_~n~0)))) [2018-11-28 18:21:31,323 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-11-28 18:21:31,324 INFO L444 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse4 (<= 1 main_~l~0)) (.cse5 (<= main_~r~0 main_~n~0)) (.cse6 (<= main_~j~0 main_~n~0))) (let ((.cse0 (<= 1 main_~i~0)) (.cse1 (<= main_~i~0 main_~n~0)) (.cse2 (<= (* 2 main_~l~0) main_~j~0)) (.cse3 (and (<= 2 main_~j~0) .cse4 .cse5 .cse6 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))))) (or (and .cse0 .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse2 .cse3) (and .cse4 .cse0 (and .cse5 .cse6) (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) .cse1 .cse2) (and (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse2 .cse3)))) [2018-11-28 18:21:31,324 INFO L444 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse4 (<= 1 main_~l~0)) (.cse5 (<= main_~r~0 main_~n~0)) (.cse6 (<= main_~j~0 main_~n~0))) (let ((.cse0 (<= 1 main_~i~0)) (.cse1 (<= main_~i~0 main_~n~0)) (.cse2 (<= (* 2 main_~l~0) main_~j~0)) (.cse3 (and (<= 2 main_~j~0) .cse4 .cse5 .cse6 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))))) (or (and .cse0 .cse1 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse2 .cse3) (and .cse4 .cse0 (and .cse5 .cse6) (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) .cse1 .cse2) (and (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse2 .cse3)))) [2018-11-28 18:21:31,324 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-28 18:21:31,324 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-28 18:21:31,324 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-11-28 18:21:31,324 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse3 (<= 1 main_~i~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= (* 2 main_~l~0) main_~j~0)) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse6 (< 0 main_~l~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 1 main_~l~0) .cse0 .cse1 .cse2 .cse3 (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) .cse4) (and .cse1 .cse2 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse4 .cse5 .cse6))) [2018-11-28 18:21:31,325 INFO L444 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse3 (<= 1 main_~i~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= (* 2 main_~l~0) main_~j~0)) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse6 (< 0 main_~l~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 1 main_~l~0) .cse0 .cse1 .cse2 .cse3 (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) .cse4) (and .cse1 .cse2 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse4 .cse5 .cse6))) [2018-11-28 18:21:31,325 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-28 18:21:31,325 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-28 18:21:31,325 INFO L444 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse5 (<= 1 main_~l~0)) (.cse6 (<= main_~r~0 main_~n~0)) (.cse7 (<= main_~j~0 main_~n~0))) (let ((.cse2 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse4 (and (<= 2 main_~j~0) .cse5 .cse6 .cse7 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2)))))) (.cse1 (<= main_~i~0 main_~n~0)) (.cse0 (<= 1 main_~i~0)) (.cse3 (<= (* 2 main_~l~0) main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse3 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse4) (and (<= main_~r~0 main_~j~0) .cse0 .cse2 .cse4) (and .cse1 (and .cse5 (exists ((v_main_~l~0_19 Int)) (and (<= (* 2 v_main_~l~0_19) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_19))) (and .cse0 (and .cse6 .cse7)) .cse3))))) [2018-11-28 18:21:31,325 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-28 18:21:31,325 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-28 18:21:31,325 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-28 18:21:31,325 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:21:31,326 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-28 18:21:31,326 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-28 18:21:31,326 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:21:31,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] [2018-11-28 18:21:31,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] [2018-11-28 18:21:31,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,347 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] [2018-11-28 18:21:31,347 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] [2018-11-28 18:21:31,347 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,347 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,347 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,348 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:21:31 BoogieIcfgContainer [2018-11-28 18:21:31,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:21:31,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:21:31,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:21:31,352 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:21:31,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:52" (3/4) ... [2018-11-28 18:21:31,356 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:21:31,364 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:21:31,364 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:21:31,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 18:21:31,370 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-28 18:21:31,371 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 18:21:31,371 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:21:31,371 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:21:31,405 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 * l <= j && i <= n / 2) && 2 * i <= j) && 0 < i) && r <= n) && 0 < l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2)) || (((((1 <= l && i <= n) && 2 * l <= j) && 1 <= i) && (\exists v_main_~l~0_19 : int :: 2 * v_main_~l~0_19 <= r && l + 1 <= v_main_~l~0_19)) && r <= n)) || ((((((i <= n && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && 2 * l <= j) && 1 <= i) && r <= n) && 0 < l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2))) || (((1 <= i && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && r + 1 <= n) && (1 <= l && l <= 1) && 2 <= r) [2018-11-28 18:21:31,439 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:21:31,439 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:21:31,440 INFO L168 Benchmark]: Toolchain (without parser) took 39690.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 951.4 MB in the beginning and 851.7 MB in the end (delta: 99.7 MB). Peak memory consumption was 445.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:31,441 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:31,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:31,443 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.16 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:31,443 INFO L168 Benchmark]: Boogie Preprocessor took 53.46 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:31,444 INFO L168 Benchmark]: RCFGBuilder took 581.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:31,446 INFO L168 Benchmark]: TraceAbstraction took 38634.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 862.9 MB in the end (delta: 251.4 MB). Peak memory consumption was 503.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:31,447 INFO L168 Benchmark]: Witness Printer took 87.67 ms. Allocated memory is still 1.4 GB. Free memory was 862.9 MB in the beginning and 851.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:31,452 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.16 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.46 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 581.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38634.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 862.9 MB in the end (delta: 251.4 MB). Peak memory consumption was 503.4 MB. Max. memory is 11.5 GB. * Witness Printer took 87.67 ms. Allocated memory is still 1.4 GB. Free memory was 862.9 MB in the beginning and 851.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 24]: Loop Invariant [2018-11-28 18:21:31,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] [2018-11-28 18:21:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] [2018-11-28 18:21:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] [2018-11-28 18:21:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_19,QUANTIFIED] [2018-11-28 18:21:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-11-28 18:21:31,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-28 18:21:31,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] Derived loop invariant: ((((((((2 * l <= j && i <= n / 2) && 2 * i <= j) && 0 < i) && r <= n) && 0 < l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2)) || (((((1 <= l && i <= n) && 2 * l <= j) && 1 <= i) && (\exists v_main_~l~0_19 : int :: 2 * v_main_~l~0_19 <= r && l + 1 <= v_main_~l~0_19)) && r <= n)) || ((((((i <= n && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && 2 * l <= j) && 1 <= i) && r <= n) && 0 < l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2))) || (((1 <= i && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && r + 1 <= n) && (1 <= l && l <= 1) && 2 <= r) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. SAFE Result, 38.5s OverallTime, 14 OverallIterations, 18 TraceHistogramMax, 21.3s AutomataDifference, 0.0s DeadEndRemovalTime, 11.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 757 SDtfs, 764 SDslu, 3619 SDs, 0 SdLazy, 5522 SolverSat, 1521 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 693 GetRequests, 480 SyntacticMatches, 3 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=10, 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.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 306 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 341 PreInvPairs, 544 NumberOfFragments, 1641 HoareAnnotationTreeSize, 341 FomulaSimplifications, 1080741 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 106434 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1029 NumberOfCodeBlocks, 1029 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1005 ConstructedInterpolants, 82 QuantifiedInterpolants, 209501 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 2358/2542 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...