./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c -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 ad4e6ad99a266ddeead98987e8e44db723af5bc7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:58:52,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:58:52,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:58:52,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:58:52,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:58:52,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:58:52,716 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:58:52,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:58:52,724 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:58:52,726 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:58:52,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:58:52,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:58:52,730 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:58:52,731 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:58:52,732 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:58:52,733 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:58:52,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:58:52,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:58:52,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:58:52,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:58:52,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:58:52,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:58:52,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:58:52,765 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:58:52,765 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:58:52,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:58:52,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:58:52,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:58:52,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:58:52,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:58:52,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:58:52,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:58:52,773 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:58:52,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:58:52,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:58:52,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:58:52,777 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:58:52,802 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:58:52,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:58:52,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:58:52,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:58:52,805 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:58:52,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:58:52,805 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:58:52,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:58:52,805 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:58:52,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:58:52,806 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:58:52,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:58:52,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:58:52,806 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:58:52,807 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:58:52,807 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:58:52,807 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:58:52,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:58:52,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:58:52,807 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:58:52,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:58:52,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:58:52,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:58:52,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:58:52,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:58:52,809 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:58:52,809 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:58:52,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:58:52,809 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 -> ad4e6ad99a266ddeead98987e8e44db723af5bc7 [2019-01-12 14:58:52,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:58:52,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:58:52,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:58:52,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:58:52,874 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:58:52,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c [2019-01-12 14:58:52,957 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18200818c/2ccbcf79c21f4da8a7c6f7b699eee005/FLAGb10ed84cb [2019-01-12 14:58:53,428 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:58:53,428 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c [2019-01-12 14:58:53,433 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18200818c/2ccbcf79c21f4da8a7c6f7b699eee005/FLAGb10ed84cb [2019-01-12 14:58:53,808 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18200818c/2ccbcf79c21f4da8a7c6f7b699eee005 [2019-01-12 14:58:53,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:58:53,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:58:53,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:58:53,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:58:53,818 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:58:53,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:58:53" (1/1) ... [2019-01-12 14:58:53,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fbb653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:53, skipping insertion in model container [2019-01-12 14:58:53,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:58:53" (1/1) ... [2019-01-12 14:58:53,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:58:53,846 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:58:54,014 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:58:54,018 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:58:54,032 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:58:54,046 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:58:54,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54 WrapperNode [2019-01-12 14:58:54,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:58:54,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:58:54,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:58:54,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:58:54,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... [2019-01-12 14:58:54,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... [2019-01-12 14:58:54,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:58:54,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:58:54,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:58:54,087 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:58:54,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... [2019-01-12 14:58:54,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... [2019-01-12 14:58:54,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... [2019-01-12 14:58:54,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... [2019-01-12 14:58:54,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... [2019-01-12 14:58:54,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... [2019-01-12 14:58:54,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... [2019-01-12 14:58:54,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:58:54,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:58:54,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:58:54,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:58:54,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:58:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:58:54,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:58:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 14:58:54,244 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 14:58:54,484 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:58:54,485 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:58:54,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:58:54 BoogieIcfgContainer [2019-01-12 14:58:54,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:58:54,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:58:54,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:58:54,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:58:54,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:58:53" (1/3) ... [2019-01-12 14:58:54,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311078f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:58:54, skipping insertion in model container [2019-01-12 14:58:54,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:54" (2/3) ... [2019-01-12 14:58:54,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311078f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:58:54, skipping insertion in model container [2019-01-12 14:58:54,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:58:54" (3/3) ... [2019-01-12 14:58:54,495 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i15_o15_false-unreach-call_true-termination.c [2019-01-12 14:58:54,506 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:58:54,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:58:54,527 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:58:54,555 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:58:54,555 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:58:54,556 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:58:54,556 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:58:54,556 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:58:54,556 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:58:54,556 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:58:54,556 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:58:54,557 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:58:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 14:58:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:58:54,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:54,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:54,580 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:54,587 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 14:58:54,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:54,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:54,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:54,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:58:54,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:58:54,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:58:54,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:58:54,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:58:54,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:58:54,930 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 14:58:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:55,089 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 14:58:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:58:55,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:58:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:55,100 INFO L225 Difference]: With dead ends: 24 [2019-01-12 14:58:55,101 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 14:58:55,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:58:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 14:58:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 14:58:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 14:58:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 14:58:55,140 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 14:58:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:55,141 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 14:58:55,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:58:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 14:58:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 14:58:55,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:55,143 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:55,143 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:55,144 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 14:58:55,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:55,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:55,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:55,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:58:55,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:55,257 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 [2019-01-12 14:58:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:55,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:58:55,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:55,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:58:55,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:58:55,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:58:55,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:58:55,382 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 14:58:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:55,566 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 14:58:55,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:58:55,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 14:58:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:55,569 INFO L225 Difference]: With dead ends: 21 [2019-01-12 14:58:55,569 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 14:58:55,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:58:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 14:58:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 14:58:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:58:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 14:58:55,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 14:58:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:55,578 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 14:58:55,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:58:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 14:58:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 14:58:55,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:55,579 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:55,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 14:58:55,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:55,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:55,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:55,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:58:55,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:55,804 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 [2019-01-12 14:58:55,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:55,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:55,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:55,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:58:55,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:55,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:58:55,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:58:55,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:58:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:58:55,909 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 14:58:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:56,071 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 14:58:56,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:58:56,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 14:58:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:56,077 INFO L225 Difference]: With dead ends: 24 [2019-01-12 14:58:56,077 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 14:58:56,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:58:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 14:58:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 14:58:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 14:58:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 14:58:56,084 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 14:58:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:56,085 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 14:58:56,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:58:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 14:58:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:58:56,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:56,086 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:56,087 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 14:58:56,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:56,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:56,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:58:56,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:56,330 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 [2019-01-12 14:58:56,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:58:56,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 14:58:56,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:56,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:58:56,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:56,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-01-12 14:58:56,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:58:56,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:58:56,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:58:56,928 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2019-01-12 14:58:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:57,261 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 14:58:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:58:57,263 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-12 14:58:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:57,264 INFO L225 Difference]: With dead ends: 27 [2019-01-12 14:58:57,264 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 14:58:57,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:58:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 14:58:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 14:58:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 14:58:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 14:58:57,271 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 14:58:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:57,272 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 14:58:57,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:58:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 14:58:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:58:57,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:57,274 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:57,274 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 14:58:57,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:57,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:57,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:57,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:57,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 14:58:57,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:57,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-12 14:58:57,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:58:57,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:58:57,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:57,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 14:58:57,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:57,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 14:58:57,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:58:57,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:58:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:58:57,541 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 14:58:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:57,765 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 14:58:57,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:58:57,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 14:58:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:57,769 INFO L225 Difference]: With dead ends: 30 [2019-01-12 14:58:57,769 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 14:58:57,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:58:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 14:58:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 14:58:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:58:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 14:58:57,778 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 14:58:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:57,778 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 14:58:57,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:58:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 14:58:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 14:58:57,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:57,781 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:57,782 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:57,782 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 14:58:57,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:57,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:57,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:57,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:57,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 14:58:57,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:57,980 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 [2019-01-12 14:58:58,003 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:58:58,027 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 14:58:58,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:58,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 14:58:58,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:58,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2019-01-12 14:58:58,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 14:58:58,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 14:58:58,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-01-12 14:58:58,291 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2019-01-12 14:58:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:58,643 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 14:58:58,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 14:58:58,644 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-01-12 14:58:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:58,645 INFO L225 Difference]: With dead ends: 33 [2019-01-12 14:58:58,645 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 14:58:58,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 14:58:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 14:58:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 14:58:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 14:58:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 14:58:58,653 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 14:58:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:58,653 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 14:58:58,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 14:58:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 14:58:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 14:58:58,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:58,656 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:58,657 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 14:58:58,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:58,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:58,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:58,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:58,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 14:58:58,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:58,883 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 [2019-01-12 14:58:58,894 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:58:58,963 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 14:58:58,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:58,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 14:58:59,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 14:58:59,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:58:59,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:58:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:58:59,026 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 17 states. [2019-01-12 14:58:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:59,164 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 14:58:59,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 14:58:59,165 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-01-12 14:58:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:59,166 INFO L225 Difference]: With dead ends: 36 [2019-01-12 14:58:59,166 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 14:58:59,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:58:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 14:58:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 14:58:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 14:58:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 14:58:59,174 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 14:58:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:59,175 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 14:58:59,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:58:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 14:58:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:58:59,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:59,177 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:59,178 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 14:58:59,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:59,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:59,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 14:58:59,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:59,460 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 [2019-01-12 14:58:59,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:59,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 14:58:59,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:59,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2019-01-12 14:58:59,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 14:58:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 14:58:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2019-01-12 14:58:59,918 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2019-01-12 14:59:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:00,797 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 14:59:00,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 14:59:00,798 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-01-12 14:59:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:00,800 INFO L225 Difference]: With dead ends: 39 [2019-01-12 14:59:00,800 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:59:00,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=354, Invalid=1538, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:59:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:59:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 14:59:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 14:59:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 14:59:00,808 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 14:59:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:00,809 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 14:59:00,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 14:59:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 14:59:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:59:00,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:00,812 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:00,812 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 14:59:00,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:00,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:00,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 14:59:00,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:00,993 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 [2019-01-12 14:59:01,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:01,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:01,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:01,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 14:59:01,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:01,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 14:59:01,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 14:59:01,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 14:59:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:59:01,083 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 14:59:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:01,246 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 14:59:01,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:59:01,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 14:59:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:01,249 INFO L225 Difference]: With dead ends: 42 [2019-01-12 14:59:01,249 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 14:59:01,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:59:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 14:59:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 14:59:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 14:59:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 14:59:01,257 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 14:59:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:01,257 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 14:59:01,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 14:59:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 14:59:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 14:59:01,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:01,260 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:01,261 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 14:59:01,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:01,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:01,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 14:59:01,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:01,465 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 [2019-01-12 14:59:01,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:01,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 14:59:01,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:01,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 14:59:02,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:02,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2019-01-12 14:59:02,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 14:59:02,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 14:59:02,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 14:59:02,107 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2019-01-12 14:59:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:02,632 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 14:59:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 14:59:02,633 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2019-01-12 14:59:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:02,635 INFO L225 Difference]: With dead ends: 45 [2019-01-12 14:59:02,635 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 14:59:02,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=531, Invalid=2331, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 14:59:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 14:59:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 14:59:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:59:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 14:59:02,647 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 14:59:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:02,647 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 14:59:02,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 14:59:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 14:59:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 14:59:02,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:02,650 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:02,652 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:02,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:02,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 14:59:02,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:02,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:02,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:02,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 14:59:02,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:02,927 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 [2019-01-12 14:59:02,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:02,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:02,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:02,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 14:59:03,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:03,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 14:59:03,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 14:59:03,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 14:59:03,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:59:03,040 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-01-12 14:59:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:03,268 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 14:59:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 14:59:03,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-01-12 14:59:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:03,271 INFO L225 Difference]: With dead ends: 48 [2019-01-12 14:59:03,271 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 14:59:03,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 14:59:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 14:59:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 14:59:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 14:59:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 14:59:03,281 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 14:59:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:03,281 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 14:59:03,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 14:59:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 14:59:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 14:59:03,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:03,285 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:03,285 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 14:59:03,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:03,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:03,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:03,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 14:59:03,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:03,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:03,535 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:03,599 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 14:59:03,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:03,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 14:59:03,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:03,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 14:59:03,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 14:59:03,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 14:59:03,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:59:03,675 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-01-12 14:59:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:04,134 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 14:59:04,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 14:59:04,136 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-01-12 14:59:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:04,137 INFO L225 Difference]: With dead ends: 51 [2019-01-12 14:59:04,137 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 14:59:04,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-01-12 14:59:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 14:59:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 14:59:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 14:59:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 14:59:04,145 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 14:59:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:04,147 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 14:59:04,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 14:59:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 14:59:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 14:59:04,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:04,149 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:04,149 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 14:59:04,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:04,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:04,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 14:59:04,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:04,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:04,612 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 14:59:04,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:04,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 14:59:05,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:05,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 44 [2019-01-12 14:59:05,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-12 14:59:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-12 14:59:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:59:05,392 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 44 states. [2019-01-12 14:59:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:06,479 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 14:59:06,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 14:59:06,480 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 81 [2019-01-12 14:59:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:06,482 INFO L225 Difference]: With dead ends: 54 [2019-01-12 14:59:06,482 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 14:59:06,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=864, Invalid=3828, Unknown=0, NotChecked=0, Total=4692 [2019-01-12 14:59:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 14:59:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 14:59:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 14:59:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 14:59:06,496 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 14:59:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:06,497 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 14:59:06,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-12 14:59:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 14:59:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 14:59:06,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:06,499 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:06,500 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 14:59:06,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:06,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:06,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 14:59:06,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:06,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:06,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:06,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 14:59:07,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:07,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18] total 47 [2019-01-12 14:59:07,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-12 14:59:07,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-12 14:59:07,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 14:59:07,626 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 47 states. [2019-01-12 14:59:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:08,788 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 14:59:08,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 14:59:08,789 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 87 [2019-01-12 14:59:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:08,791 INFO L225 Difference]: With dead ends: 57 [2019-01-12 14:59:08,791 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 14:59:08,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=993, Invalid=4409, Unknown=0, NotChecked=0, Total=5402 [2019-01-12 14:59:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 14:59:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 14:59:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 14:59:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 14:59:08,800 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 14:59:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:08,800 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 14:59:08,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-12 14:59:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 14:59:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 14:59:08,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:08,804 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:08,804 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 14:59:08,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:08,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:08,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 14:59:09,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:09,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:09,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:09,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:09,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:09,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 14:59:10,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:10,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2019-01-12 14:59:10,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-12 14:59:10,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-12 14:59:10,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2052, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 14:59:10,415 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 50 states. [2019-01-12 14:59:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:11,205 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 14:59:11,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 14:59:11,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 93 [2019-01-12 14:59:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:11,208 INFO L225 Difference]: With dead ends: 60 [2019-01-12 14:59:11,208 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 14:59:11,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1131, Invalid=5031, Unknown=0, NotChecked=0, Total=6162 [2019-01-12 14:59:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 14:59:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 14:59:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 14:59:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 14:59:11,218 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 14:59:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:11,219 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 14:59:11,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-12 14:59:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 14:59:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 14:59:11,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:11,220 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:11,220 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:11,221 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 14:59:11,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:11,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:11,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:59:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:59:11,280 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:59:11,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:59:11 BoogieIcfgContainer [2019-01-12 14:59:11,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:59:11,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:59:11,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:59:11,326 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:59:11,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:58:54" (3/4) ... [2019-01-12 14:59:11,331 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:59:11,416 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:59:11,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:59:11,418 INFO L168 Benchmark]: Toolchain (without parser) took 17605.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 156.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:11,420 INFO L168 Benchmark]: CDTParser took 0.18 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. [2019-01-12 14:59:11,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.01 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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. [2019-01-12 14:59:11,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.36 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. [2019-01-12 14:59:11,421 INFO L168 Benchmark]: Boogie Preprocessor took 23.27 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. [2019-01-12 14:59:11,422 INFO L168 Benchmark]: RCFGBuilder took 376.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:11,425 INFO L168 Benchmark]: TraceAbstraction took 16837.59 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 1.1 GB in the end (delta: -30.3 MB). Peak memory consumption was 177.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:11,425 INFO L168 Benchmark]: Witness Printer took 91.49 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:59:11,430 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.18 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 233.01 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 38.36 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 23.27 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 376.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16837.59 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 1.1 GB in the end (delta: -30.3 MB). Peak memory consumption was 177.9 MB. Max. memory is 11.5 GB. * Witness Printer took 91.49 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 15; [L11] CALL, EXPR id(input) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 15 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 16.7s OverallTime, 16 OverallIterations, 16 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 237 SDslu, 1301 SDs, 0 SdLazy, 1309 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1203 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 479 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4105 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1492 ConstructedInterpolants, 0 QuantifiedInterpolants, 225352 SizeOfPredicates, 116 NumberOfNonLiveVariables, 1806 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 29 InterpolantComputations, 1 PerfectInterpolantSequences, 3150/6300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...