./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.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/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.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 f345f307410a5ddbdd0513896d69ca703c67be23 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:11:38,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:11:38,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:11:38,729 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:11:38,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:11:38,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:11:38,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:11:38,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:11:38,736 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:11:38,737 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:11:38,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:11:38,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:11:38,739 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:11:38,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:11:38,742 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:11:38,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:11:38,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:11:38,746 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:11:38,748 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:11:38,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:11:38,752 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:11:38,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:11:38,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:11:38,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:11:38,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:11:38,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:11:38,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:11:38,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:11:38,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:11:38,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:11:38,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:11:38,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:11:38,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:11:38,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:11:38,766 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:11:38,766 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:11:38,767 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:11:38,786 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:11:38,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:11:38,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:11:38,789 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:11:38,789 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:11:38,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:11:38,789 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:11:38,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:11:38,790 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:11:38,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:11:38,790 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:11:38,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:11:38,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:11:38,790 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:11:38,791 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:11:38,791 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:11:38,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:11:38,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:11:38,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:11:38,792 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:11:38,792 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:11:38,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:11:38,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:11:38,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:11:38,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:11:38,793 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:11:38,793 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:11:38,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:11:38,793 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 -> f345f307410a5ddbdd0513896d69ca703c67be23 [2019-01-12 15:11:38,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:11:38,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:11:38,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:11:38,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:11:38,854 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:11:38,855 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2019-01-12 15:11:38,929 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334bb78c7/1d1263e5d8e64b32bf3b01e89bd43f64/FLAG78f9d3281 [2019-01-12 15:11:39,397 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:11:39,398 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2019-01-12 15:11:39,406 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334bb78c7/1d1263e5d8e64b32bf3b01e89bd43f64/FLAG78f9d3281 [2019-01-12 15:11:39,702 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334bb78c7/1d1263e5d8e64b32bf3b01e89bd43f64 [2019-01-12 15:11:39,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:11:39,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:11:39,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:39,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:11:39,714 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:11:39,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:39" (1/1) ... [2019-01-12 15:11:39,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b00d126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:39, skipping insertion in model container [2019-01-12 15:11:39,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:39" (1/1) ... [2019-01-12 15:11:39,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:11:39,745 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:11:39,959 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:39,965 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:11:39,984 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:40,001 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:11:40,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40 WrapperNode [2019-01-12 15:11:40,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:40,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:40,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:11:40,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:11:40,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (1/1) ... [2019-01-12 15:11:40,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (1/1) ... [2019-01-12 15:11:40,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:40,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:11:40,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:11:40,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:11:40,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (1/1) ... [2019-01-12 15:11:40,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (1/1) ... [2019-01-12 15:11:40,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (1/1) ... [2019-01-12 15:11:40,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (1/1) ... [2019-01-12 15:11:40,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (1/1) ... [2019-01-12 15:11:40,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (1/1) ... [2019-01-12 15:11:40,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (1/1) ... [2019-01-12 15:11:40,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:11:40,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:11:40,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:11:40,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:11:40,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (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 15:11:40,233 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2019-01-12 15:11:40,233 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2019-01-12 15:11:40,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:11:40,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:11:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 15:11:40,234 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 15:11:40,684 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:11:40,685 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:11:40,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:40 BoogieIcfgContainer [2019-01-12 15:11:40,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:11:40,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:11:40,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:11:40,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:11:40,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:11:39" (1/3) ... [2019-01-12 15:11:40,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64256039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:40, skipping insertion in model container [2019-01-12 15:11:40,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:40" (2/3) ... [2019-01-12 15:11:40,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64256039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:40, skipping insertion in model container [2019-01-12 15:11:40,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:40" (3/3) ... [2019-01-12 15:11:40,696 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2019-01-12 15:11:40,706 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:11:40,713 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:11:40,730 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:11:40,760 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:11:40,761 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:11:40,761 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:11:40,761 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:11:40,761 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:11:40,761 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:11:40,762 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:11:40,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:11:40,763 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:11:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-01-12 15:11:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:11:40,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:40,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:40,793 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash -394807891, now seen corresponding path program 1 times [2019-01-12 15:11:40,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:40,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:40,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:40,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:40,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:41,090 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 15:11:41,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:41,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:41,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:41,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:41,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:41,111 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-01-12 15:11:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:41,207 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-12 15:11:41,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:41,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:11:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:41,219 INFO L225 Difference]: With dead ends: 35 [2019-01-12 15:11:41,220 INFO L226 Difference]: Without dead ends: 22 [2019-01-12 15:11:41,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-12 15:11:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-12 15:11:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 15:11:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-01-12 15:11:41,266 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2019-01-12 15:11:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:41,267 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-12 15:11:41,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-01-12 15:11:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 15:11:41,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:41,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:41,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:41,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1343664860, now seen corresponding path program 1 times [2019-01-12 15:11:41,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:41,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:41,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:41,413 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 15:11:41,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:41,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:41,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:41,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:41,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:41,422 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-01-12 15:11:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:41,511 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-01-12 15:11:41,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:41,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-12 15:11:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:41,514 INFO L225 Difference]: With dead ends: 40 [2019-01-12 15:11:41,514 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 15:11:41,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 15:11:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 15:11:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:11:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-01-12 15:11:41,524 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-01-12 15:11:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:41,525 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-12 15:11:41,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-01-12 15:11:41,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 15:11:41,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:41,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:41,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:41,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1372294011, now seen corresponding path program 1 times [2019-01-12 15:11:41,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:41,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:41,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:41,974 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 15:11:41,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:41,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 15:11:41,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:11:41,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:11:41,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:41,976 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 8 states. [2019-01-12 15:11:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:42,154 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-12 15:11:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:42,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-12 15:11:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:42,156 INFO L225 Difference]: With dead ends: 32 [2019-01-12 15:11:42,156 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 15:11:42,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:11:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 15:11:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 15:11:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:11:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-01-12 15:11:42,165 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-01-12 15:11:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:42,165 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-12 15:11:42,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:11:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-01-12 15:11:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:11:42,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:42,167 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:42,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:42,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:42,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1000474712, now seen corresponding path program 1 times [2019-01-12 15:11:42,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:42,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:42,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:42,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:42,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:11:42,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:42,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:42,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:42,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:42,369 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-01-12 15:11:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:42,398 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-01-12 15:11:42,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:42,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-12 15:11:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:42,401 INFO L225 Difference]: With dead ends: 44 [2019-01-12 15:11:42,402 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:11:42,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:11:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-12 15:11:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 15:11:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-01-12 15:11:42,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-01-12 15:11:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:42,411 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-12 15:11:42,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-01-12 15:11:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:11:42,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:42,413 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:42,413 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1196988217, now seen corresponding path program 1 times [2019-01-12 15:11:42,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:42,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:42,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:42,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:42,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:11:42,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:42,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:42,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:42,538 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-01-12 15:11:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:42,577 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-01-12 15:11:42,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:42,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-12 15:11:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:42,580 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:11:42,580 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:11:42,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:11:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-12 15:11:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 15:11:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-01-12 15:11:42,587 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-01-12 15:11:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:42,588 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-12 15:11:42,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-01-12 15:11:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:11:42,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:42,589 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:42,590 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1168359066, now seen corresponding path program 1 times [2019-01-12 15:11:42,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:42,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:42,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:42,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:42,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:43,243 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 15:11:43,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:43,243 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 15:11:43,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:43,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:43,441 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 15:11:43,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:43,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-12 15:11:43,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:11:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:11:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:43,478 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 12 states. [2019-01-12 15:11:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:43,701 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-01-12 15:11:43,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:11:43,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-01-12 15:11:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:43,706 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:11:43,706 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 15:11:43,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:11:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 15:11:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-01-12 15:11:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 15:11:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-01-12 15:11:43,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-01-12 15:11:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:43,713 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-12 15:11:43,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:11:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-01-12 15:11:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 15:11:43,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:43,715 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:43,715 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:43,716 INFO L82 PathProgramCache]: Analyzing trace with hash -26461427, now seen corresponding path program 1 times [2019-01-12 15:11:43,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:43,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:43,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:43,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:43,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:43,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:43,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:43,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:43,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:43,903 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-01-12 15:11:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:43,933 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-01-12 15:11:43,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:43,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 15:11:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:43,937 INFO L225 Difference]: With dead ends: 50 [2019-01-12 15:11:43,937 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 15:11:43,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 15:11:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-01-12 15:11:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 15:11:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-01-12 15:11:43,945 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 30 [2019-01-12 15:11:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:43,946 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-12 15:11:43,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-01-12 15:11:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 15:11:43,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:43,947 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:43,948 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:43,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:43,948 INFO L82 PathProgramCache]: Analyzing trace with hash -222974932, now seen corresponding path program 1 times [2019-01-12 15:11:43,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:43,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:43,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:44,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:44,474 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 15:11:44,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:44,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:44,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:44,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-12 15:11:44,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:11:44,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:11:44,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:44,682 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2019-01-12 15:11:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:44,895 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-01-12 15:11:44,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:11:44,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-01-12 15:11:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:44,899 INFO L225 Difference]: With dead ends: 66 [2019-01-12 15:11:44,899 INFO L226 Difference]: Without dead ends: 48 [2019-01-12 15:11:44,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:11:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-12 15:11:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-01-12 15:11:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 15:11:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-12 15:11:44,914 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 30 [2019-01-12 15:11:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:44,917 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-12 15:11:44,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:11:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-12 15:11:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 15:11:44,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:44,920 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:44,923 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash -141607649, now seen corresponding path program 2 times [2019-01-12 15:11:44,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:44,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:44,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 15:11:45,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:45,369 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 15:11:45,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:45,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:11:45,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:45,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 15:11:45,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:45,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 17 [2019-01-12 15:11:45,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:11:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:11:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:11:45,478 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 17 states. [2019-01-12 15:11:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:45,746 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-01-12 15:11:45,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:11:45,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2019-01-12 15:11:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:45,747 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:11:45,748 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:11:45,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:11:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:11:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:11:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:11:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:11:45,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-01-12 15:11:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:45,750 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:11:45,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:11:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:11:45,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:11:45,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:11:45,834 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-12 15:11:45,835 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2019-01-12 15:11:45,835 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-01-12 15:11:45,835 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-01-12 15:11:45,835 INFO L448 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2019-01-12 15:11:45,835 INFO L451 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2019-01-12 15:11:45,835 INFO L448 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2019-01-12 15:11:45,835 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:11:45,836 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:11:45,844 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:11:45,844 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 15:11:45,844 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 15:11:45,845 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2019-01-12 15:11:45,845 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-01-12 15:11:45,845 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 27) no Hoare annotation was computed. [2019-01-12 15:11:45,845 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2019-01-12 15:11:45,845 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2019-01-12 15:11:45,845 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2019-01-12 15:11:45,845 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-01-12 15:11:45,846 INFO L451 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: true [2019-01-12 15:11:45,846 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2019-01-12 15:11:45,846 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-01-12 15:11:45,846 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2019-01-12 15:11:45,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:11:45 BoogieIcfgContainer [2019-01-12 15:11:45,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:11:45,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:11:45,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:11:45,863 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:11:45,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:40" (3/4) ... [2019-01-12 15:11:45,874 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:11:45,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2019-01-12 15:11:45,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-01-12 15:11:45,893 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:11:45,894 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:11:45,978 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:11:45,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:11:45,981 INFO L168 Benchmark]: Toolchain (without parser) took 6274.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.3 MB in the beginning and 867.6 MB in the end (delta: 79.7 MB). Peak memory consumption was 220.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:45,989 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:45,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.40 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 15:11:45,990 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.73 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:45,990 INFO L168 Benchmark]: Boogie Preprocessor took 23.99 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:45,991 INFO L168 Benchmark]: RCFGBuilder took 619.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:45,991 INFO L168 Benchmark]: TraceAbstraction took 5174.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 867.6 MB in the end (delta: 249.0 MB). Peak memory consumption was 249.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:45,995 INFO L168 Benchmark]: Witness Printer took 117.45 ms. Allocated memory is still 1.2 GB. Free memory is still 867.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:46,001 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.40 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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.73 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.99 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 619.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5174.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 867.6 MB in the end (delta: 249.0 MB). Peak memory consumption was 249.0 MB. Max. memory is 11.5 GB. * Witness Printer took 117.45 ms. Allocated memory is still 1.2 GB. Free memory is still 867.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 225 SDtfs, 27 SDslu, 1253 SDs, 0 SdLazy, 332 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 5 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 26281 SizeOfPredicates, 10 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 61/93 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...