./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product44_false-unreach-call_false-termination.cil.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/product-lines/minepump_spec2_product44_false-unreach-call_false-termination.cil.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 1e304dec1a19556a559249c7b1ef76290bc8b678 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:47:10,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:47:10,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:47:10,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:47:10,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:47:11,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:47:11,002 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:47:11,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:47:11,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:47:11,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:47:11,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:47:11,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:47:11,009 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:47:11,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:47:11,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:47:11,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:47:11,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:47:11,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:47:11,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:47:11,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:47:11,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:47:11,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:47:11,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:47:11,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:47:11,024 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:47:11,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:47:11,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:47:11,027 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:47:11,028 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:47:11,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:47:11,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:47:11,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:47:11,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:47:11,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:47:11,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:47:11,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:47:11,034 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:47:11,061 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:47:11,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:47:11,064 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:47:11,064 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:47:11,064 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:47:11,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:47:11,064 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:47:11,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:47:11,066 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:47:11,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:47:11,067 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:47:11,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:47:11,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:47:11,067 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:47:11,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:47:11,067 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:47:11,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:47:11,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:47:11,070 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:47:11,070 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:47:11,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:47:11,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:47:11,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:47:11,071 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:47:11,071 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:47:11,071 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:47:11,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:47:11,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:47:11,072 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 -> 1e304dec1a19556a559249c7b1ef76290bc8b678 [2019-01-12 14:47:11,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:47:11,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:47:11,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:47:11,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:47:11,162 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:47:11,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product44_false-unreach-call_false-termination.cil.c [2019-01-12 14:47:11,214 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685242507/aecd3d638c454f2a8dd155656654b1b3/FLAGa3199d80c [2019-01-12 14:47:11,749 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:47:11,750 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product44_false-unreach-call_false-termination.cil.c [2019-01-12 14:47:11,773 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685242507/aecd3d638c454f2a8dd155656654b1b3/FLAGa3199d80c [2019-01-12 14:47:12,013 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685242507/aecd3d638c454f2a8dd155656654b1b3 [2019-01-12 14:47:12,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:47:12,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:47:12,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:47:12,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:47:12,024 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:47:12,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:47:12" (1/1) ... [2019-01-12 14:47:12,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20575267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12, skipping insertion in model container [2019-01-12 14:47:12,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:47:12" (1/1) ... [2019-01-12 14:47:12,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:47:12,089 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:47:12,442 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:47:12,472 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:47:12,651 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:47:12,695 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:47:12,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12 WrapperNode [2019-01-12 14:47:12,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:47:12,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:47:12,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:47:12,697 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:47:12,707 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:47:12" (1/1) ... [2019-01-12 14:47:12,726 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:47:12" (1/1) ... [2019-01-12 14:47:12,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:47:12,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:47:12,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:47:12,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:47:12,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12" (1/1) ... [2019-01-12 14:47:12,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12" (1/1) ... [2019-01-12 14:47:12,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12" (1/1) ... [2019-01-12 14:47:12,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12" (1/1) ... [2019-01-12 14:47:12,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12" (1/1) ... [2019-01-12 14:47:12,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12" (1/1) ... [2019-01-12 14:47:12,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12" (1/1) ... [2019-01-12 14:47:12,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:47:12,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:47:12,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:47:12,817 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:47:12,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12" (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:47:12,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:47:12,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:47:12,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:47:12,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:47:14,166 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:47:14,166 INFO L286 CfgBuilder]: Removed 122 assue(true) statements. [2019-01-12 14:47:14,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:47:14 BoogieIcfgContainer [2019-01-12 14:47:14,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:47:14,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:47:14,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:47:14,172 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:47:14,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:47:12" (1/3) ... [2019-01-12 14:47:14,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3207b432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:47:14, skipping insertion in model container [2019-01-12 14:47:14,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:12" (2/3) ... [2019-01-12 14:47:14,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3207b432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:47:14, skipping insertion in model container [2019-01-12 14:47:14,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:47:14" (3/3) ... [2019-01-12 14:47:14,176 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product44_false-unreach-call_false-termination.cil.c [2019-01-12 14:47:14,186 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:47:14,194 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:47:14,210 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:47:14,247 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:47:14,247 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:47:14,248 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:47:14,248 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:47:14,248 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:47:14,248 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:47:14,248 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:47:14,249 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:47:14,249 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:47:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-01-12 14:47:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 14:47:14,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:14,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:14,279 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash -732978716, now seen corresponding path program 1 times [2019-01-12 14:47:14,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:14,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:14,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:14,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:14,546 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:47:14,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:14,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:14,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:47:14,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:47:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:47:14,571 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2019-01-12 14:47:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:14,603 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2019-01-12 14:47:14,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:47:14,604 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-01-12 14:47:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:14,617 INFO L225 Difference]: With dead ends: 179 [2019-01-12 14:47:14,617 INFO L226 Difference]: Without dead ends: 89 [2019-01-12 14:47:14,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:47:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-12 14:47:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-12 14:47:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-12 14:47:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2019-01-12 14:47:14,661 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 18 [2019-01-12 14:47:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:14,662 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2019-01-12 14:47:14,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:47:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2019-01-12 14:47:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:47:14,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:14,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:14,664 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash -951814685, now seen corresponding path program 1 times [2019-01-12 14:47:14,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:14,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:14,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:14,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:14,807 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:47:14,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:14,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:14,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:14,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:14,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:14,810 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand 3 states. [2019-01-12 14:47:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:14,835 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-01-12 14:47:14,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:14,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 14:47:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:14,836 INFO L225 Difference]: With dead ends: 89 [2019-01-12 14:47:14,837 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 14:47:14,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 14:47:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 14:47:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:47:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-01-12 14:47:14,844 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 19 [2019-01-12 14:47:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:14,845 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-01-12 14:47:14,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-01-12 14:47:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:47:14,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:14,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:14,847 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2025304256, now seen corresponding path program 1 times [2019-01-12 14:47:14,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:14,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:14,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:15,001 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:47:15,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:15,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:15,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:15,005 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 3 states. [2019-01-12 14:47:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:15,125 INFO L93 Difference]: Finished difference Result 109 states and 160 transitions. [2019-01-12 14:47:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:15,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:47:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:15,131 INFO L225 Difference]: With dead ends: 109 [2019-01-12 14:47:15,131 INFO L226 Difference]: Without dead ends: 75 [2019-01-12 14:47:15,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-12 14:47:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-01-12 14:47:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 14:47:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2019-01-12 14:47:15,156 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 24 [2019-01-12 14:47:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:15,156 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2019-01-12 14:47:15,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2019-01-12 14:47:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:47:15,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:15,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:15,158 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:15,162 INFO L82 PathProgramCache]: Analyzing trace with hash 193545241, now seen corresponding path program 1 times [2019-01-12 14:47:15,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:15,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:15,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:15,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:15,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:15,287 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:47:15,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:15,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:15,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:15,289 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2019-01-12 14:47:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:15,444 INFO L93 Difference]: Finished difference Result 178 states and 267 transitions. [2019-01-12 14:47:15,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:15,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 14:47:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:15,447 INFO L225 Difference]: With dead ends: 178 [2019-01-12 14:47:15,447 INFO L226 Difference]: Without dead ends: 114 [2019-01-12 14:47:15,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-12 14:47:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-01-12 14:47:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-12 14:47:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2019-01-12 14:47:15,464 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 25 [2019-01-12 14:47:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:15,464 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2019-01-12 14:47:15,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2019-01-12 14:47:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:47:15,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:15,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:15,467 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:15,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash 433385865, now seen corresponding path program 1 times [2019-01-12 14:47:15,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:15,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:15,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:15,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:15,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:15,596 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:47:15,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:15,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:15,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:15,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:15,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:15,599 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand 5 states. [2019-01-12 14:47:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:15,882 INFO L93 Difference]: Finished difference Result 544 states and 809 transitions. [2019-01-12 14:47:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:47:15,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-12 14:47:15,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:15,888 INFO L225 Difference]: With dead ends: 544 [2019-01-12 14:47:15,888 INFO L226 Difference]: Without dead ends: 439 [2019-01-12 14:47:15,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:47:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-01-12 14:47:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 203. [2019-01-12 14:47:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-12 14:47:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2019-01-12 14:47:15,924 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 27 [2019-01-12 14:47:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:15,924 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2019-01-12 14:47:15,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2019-01-12 14:47:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 14:47:15,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:15,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:15,927 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1000759295, now seen corresponding path program 1 times [2019-01-12 14:47:15,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:15,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:15,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:15,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:16,113 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:47:16,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:16,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:16,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:16,115 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand 5 states. [2019-01-12 14:47:16,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:16,903 INFO L93 Difference]: Finished difference Result 769 states and 1111 transitions. [2019-01-12 14:47:16,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:47:16,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-01-12 14:47:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:16,907 INFO L225 Difference]: With dead ends: 769 [2019-01-12 14:47:16,907 INFO L226 Difference]: Without dead ends: 573 [2019-01-12 14:47:16,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:47:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-01-12 14:47:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 201. [2019-01-12 14:47:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-12 14:47:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2019-01-12 14:47:16,959 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 28 [2019-01-12 14:47:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:16,959 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2019-01-12 14:47:16,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2019-01-12 14:47:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:47:16,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:16,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:16,967 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:16,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash 341285158, now seen corresponding path program 1 times [2019-01-12 14:47:16,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:16,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:16,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:16,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:17,108 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:47:17,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:17,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:47:17,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:17,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:17,110 INFO L87 Difference]: Start difference. First operand 201 states and 286 transitions. Second operand 5 states. [2019-01-12 14:47:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:17,544 INFO L93 Difference]: Finished difference Result 555 states and 781 transitions. [2019-01-12 14:47:17,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:47:17,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-12 14:47:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:17,548 INFO L225 Difference]: With dead ends: 555 [2019-01-12 14:47:17,548 INFO L226 Difference]: Without dead ends: 361 [2019-01-12 14:47:17,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:47:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-01-12 14:47:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 213. [2019-01-12 14:47:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-12 14:47:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2019-01-12 14:47:17,581 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 35 [2019-01-12 14:47:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:17,582 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2019-01-12 14:47:17,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2019-01-12 14:47:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:47:17,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:17,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:17,585 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:17,586 INFO L82 PathProgramCache]: Analyzing trace with hash -669832092, now seen corresponding path program 1 times [2019-01-12 14:47:17,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:17,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:17,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:17,757 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:47:17,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:17,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:17,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:47:17,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:47:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:47:17,760 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand 4 states. [2019-01-12 14:47:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:18,057 INFO L93 Difference]: Finished difference Result 515 states and 715 transitions. [2019-01-12 14:47:18,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:47:18,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-12 14:47:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:18,061 INFO L225 Difference]: With dead ends: 515 [2019-01-12 14:47:18,061 INFO L226 Difference]: Without dead ends: 309 [2019-01-12 14:47:18,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-12 14:47:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 221. [2019-01-12 14:47:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-12 14:47:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 306 transitions. [2019-01-12 14:47:18,106 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 306 transitions. Word has length 35 [2019-01-12 14:47:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:18,107 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 306 transitions. [2019-01-12 14:47:18,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:47:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 306 transitions. [2019-01-12 14:47:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:47:18,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:18,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:18,112 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1690900446, now seen corresponding path program 1 times [2019-01-12 14:47:18,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:18,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:18,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:18,209 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:47:18,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:18,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:18,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:18,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:18,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:18,212 INFO L87 Difference]: Start difference. First operand 221 states and 306 transitions. Second operand 3 states. [2019-01-12 14:47:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:18,382 INFO L93 Difference]: Finished difference Result 535 states and 735 transitions. [2019-01-12 14:47:18,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:18,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-01-12 14:47:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:18,386 INFO L225 Difference]: With dead ends: 535 [2019-01-12 14:47:18,386 INFO L226 Difference]: Without dead ends: 321 [2019-01-12 14:47:18,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-12 14:47:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-01-12 14:47:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-12 14:47:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 428 transitions. [2019-01-12 14:47:18,436 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 428 transitions. Word has length 35 [2019-01-12 14:47:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:18,437 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 428 transitions. [2019-01-12 14:47:18,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 428 transitions. [2019-01-12 14:47:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:47:18,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:18,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:18,440 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:18,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2015558942, now seen corresponding path program 1 times [2019-01-12 14:47:18,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:18,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:18,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:18,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:18,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:18,889 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:47:18,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:18,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 14:47:18,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:47:18,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:47:18,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:47:18,892 INFO L87 Difference]: Start difference. First operand 321 states and 428 transitions. Second operand 8 states. [2019-01-12 14:47:20,386 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 14:47:20,629 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 14:47:21,766 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 14:47:21,995 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 14:47:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:22,089 INFO L93 Difference]: Finished difference Result 1403 states and 1854 transitions. [2019-01-12 14:47:22,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 14:47:22,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-01-12 14:47:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:22,097 INFO L225 Difference]: With dead ends: 1403 [2019-01-12 14:47:22,097 INFO L226 Difference]: Without dead ends: 1089 [2019-01-12 14:47:22,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:47:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-01-12 14:47:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 321. [2019-01-12 14:47:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-12 14:47:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 420 transitions. [2019-01-12 14:47:22,145 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 420 transitions. Word has length 36 [2019-01-12 14:47:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:22,146 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 420 transitions. [2019-01-12 14:47:22,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:47:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 420 transitions. [2019-01-12 14:47:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:47:22,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:22,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:22,147 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:22,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:22,148 INFO L82 PathProgramCache]: Analyzing trace with hash -59965040, now seen corresponding path program 1 times [2019-01-12 14:47:22,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:22,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:22,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:22,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:22,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:47:22,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:22,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:22,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:22,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:22,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:22,251 INFO L87 Difference]: Start difference. First operand 321 states and 420 transitions. Second operand 3 states. [2019-01-12 14:47:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:22,422 INFO L93 Difference]: Finished difference Result 471 states and 623 transitions. [2019-01-12 14:47:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:22,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-12 14:47:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:22,425 INFO L225 Difference]: With dead ends: 471 [2019-01-12 14:47:22,426 INFO L226 Difference]: Without dead ends: 469 [2019-01-12 14:47:22,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-01-12 14:47:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 361. [2019-01-12 14:47:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-12 14:47:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 481 transitions. [2019-01-12 14:47:22,479 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 481 transitions. Word has length 51 [2019-01-12 14:47:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:22,479 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 481 transitions. [2019-01-12 14:47:22,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 481 transitions. [2019-01-12 14:47:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 14:47:22,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:22,481 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:22,482 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:22,482 INFO L82 PathProgramCache]: Analyzing trace with hash -376855367, now seen corresponding path program 1 times [2019-01-12 14:47:22,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:22,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:22,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:47:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:47:23,210 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:47:23,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:47:23 BoogieIcfgContainer [2019-01-12 14:47:23,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:47:23,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:47:23,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:47:23,385 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:47:23,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:47:14" (3/4) ... [2019-01-12 14:47:23,388 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:47:23,569 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:47:23,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:47:23,570 INFO L168 Benchmark]: Toolchain (without parser) took 11552.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 951.4 MB in the beginning and 838.9 MB in the end (delta: 112.5 MB). Peak memory consumption was 327.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:23,571 INFO L168 Benchmark]: CDTParser took 0.16 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:47:23,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:23,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:47:23,572 INFO L168 Benchmark]: Boogie Preprocessor took 40.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:23,573 INFO L168 Benchmark]: RCFGBuilder took 1351.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:23,573 INFO L168 Benchmark]: TraceAbstraction took 9214.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 870.6 MB in the end (delta: 188.1 MB). Peak memory consumption was 264.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:23,574 INFO L168 Benchmark]: Witness Printer took 185.12 ms. Allocated memory is still 1.2 GB. Free memory was 870.6 MB in the beginning and 838.9 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:23,576 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.16 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 676.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1351.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9214.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 870.6 MB in the end (delta: 188.1 MB). Peak memory consumption was 264.1 MB. Max. memory is 11.5 GB. * Witness Printer took 185.12 ms. Allocated memory is still 1.2 GB. Free memory was 870.6 MB in the beginning and 838.9 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L132] int pumpRunning = 0; [L133] int systemActive = 1; [L364] int cleanupTimeShifts = 4; [L462] int methAndRunningLastTime ; [L502] int waterLevel = 1; [L503] int methaneLevelCritical = 0; [L765] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L439] int retValue_acc ; [L440] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L355] int retValue_acc ; [L358] retValue_acc = 1 [L359] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] tmp = valid_product() [L448] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L467] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L73] tmp = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L520] COND TRUE waterLevel < 2 [L521] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L140] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L172] COND TRUE ! pumpRunning [L284] int retValue_acc ; [L285] int tmp ; [L286] int tmp___0 ; [L582] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L585] COND FALSE !(waterLevel < 2) [L589] retValue_acc = 0 [L590] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L290] tmp = isHighWaterSensorDry() [L292] COND FALSE !(\read(tmp)) [L295] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L297] retValue_acc = tmp___0 [L298] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L174] tmp = isHighWaterLevel() [L176] COND TRUE \read(tmp) [L203] int tmp ; [L228] int retValue_acc ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L232] retValue_acc = isMethaneLevelCritical() [L234] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L207] tmp = isMethaneAlarm() [L209] COND FALSE !(\read(tmp)) [L197] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L477] tmp = isMethaneLevelCritical() [L479] COND FALSE !(\read(tmp)) [L495] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L532] COND FALSE !(\read(methaneLevelCritical)) [L535] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L140] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L508] COND TRUE waterLevel > 0 [L509] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L172] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L477] tmp = isMethaneLevelCritical() [L479] COND TRUE \read(tmp) [L239] int retValue_acc ; [L242] retValue_acc = pumpRunning [L243] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L481] tmp___0 = isPumpRunning() [L483] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L484] COND FALSE !(\read(methAndRunningLastTime)) [L489] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L140] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L508] COND TRUE waterLevel > 0 [L509] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L172] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L477] tmp = isMethaneLevelCritical() [L479] COND TRUE \read(tmp) [L239] int retValue_acc ; [L242] retValue_acc = pumpRunning [L243] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L481] tmp___0 = isPumpRunning() [L483] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L484] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L44] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 93 locations, 3 error locations. UNSAFE Result, 9.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 966 SDtfs, 1119 SDslu, 2015 SDs, 0 SdLazy, 277 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=11, 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1726 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 18652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...