./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product43_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_spec4_product43_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 437b76c0cd9dd6f0417f690a0c81e41159d0829e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:48:51,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:48:51,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:48:51,058 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:48:51,059 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:48:51,060 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:48:51,062 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:48:51,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:48:51,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:48:51,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:48:51,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:48:51,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:48:51,069 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:48:51,070 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:48:51,071 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:48:51,072 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:48:51,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:48:51,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:48:51,077 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:48:51,079 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:48:51,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:48:51,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:48:51,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:48:51,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:48:51,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:48:51,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:48:51,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:48:51,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:48:51,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:48:51,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:48:51,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:48:51,092 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:48:51,092 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:48:51,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:48:51,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:48:51,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:48:51,095 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:48:51,110 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:48:51,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:48:51,112 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:48:51,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:48:51,112 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:48:51,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:48:51,113 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:48:51,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:48:51,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:48:51,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:48:51,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:48:51,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:48:51,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:48:51,115 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:48:51,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:48:51,115 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:48:51,116 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:48:51,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:48:51,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:48:51,117 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:48:51,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:48:51,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:48:51,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:48:51,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:48:51,118 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:48:51,118 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:48:51,118 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:48:51,118 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:48:51,118 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 -> 437b76c0cd9dd6f0417f690a0c81e41159d0829e [2019-01-12 14:48:51,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:48:51,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:48:51,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:48:51,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:48:51,174 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:48:51,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product43_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:51,231 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc7b342a/0db0a04911fa4195bae006fb41421016/FLAG9702de521 [2019-01-12 14:48:51,714 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:48:51,715 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product43_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:51,733 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc7b342a/0db0a04911fa4195bae006fb41421016/FLAG9702de521 [2019-01-12 14:48:52,034 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc7b342a/0db0a04911fa4195bae006fb41421016 [2019-01-12 14:48:52,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:48:52,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:48:52,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:52,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:48:52,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:48:52,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:52" (1/1) ... [2019-01-12 14:48:52,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73827462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52, skipping insertion in model container [2019-01-12 14:48:52,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:52" (1/1) ... [2019-01-12 14:48:52,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:48:52,138 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:48:52,506 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:52,520 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:48:52,597 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:52,640 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:48:52,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52 WrapperNode [2019-01-12 14:48:52,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:52,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:52,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:48:52,642 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:48:52,722 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:48:52" (1/1) ... [2019-01-12 14:48:52,744 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:48:52" (1/1) ... [2019-01-12 14:48:52,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:52,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:48:52,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:48:52,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:48:52,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52" (1/1) ... [2019-01-12 14:48:52,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52" (1/1) ... [2019-01-12 14:48:52,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52" (1/1) ... [2019-01-12 14:48:52,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52" (1/1) ... [2019-01-12 14:48:52,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52" (1/1) ... [2019-01-12 14:48:52,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52" (1/1) ... [2019-01-12 14:48:52,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52" (1/1) ... [2019-01-12 14:48:52,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:48:52,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:48:52,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:48:52,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:48:52,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:48:52,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:48:52,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:48:52,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:48:52,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:48:54,085 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:48:54,085 INFO L286 CfgBuilder]: Removed 118 assue(true) statements. [2019-01-12 14:48:54,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:54 BoogieIcfgContainer [2019-01-12 14:48:54,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:48:54,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:48:54,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:48:54,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:48:54,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:48:52" (1/3) ... [2019-01-12 14:48:54,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f203108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:48:54, skipping insertion in model container [2019-01-12 14:48:54,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:52" (2/3) ... [2019-01-12 14:48:54,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f203108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:48:54, skipping insertion in model container [2019-01-12 14:48:54,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:54" (3/3) ... [2019-01-12 14:48:54,095 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product43_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:54,105 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:48:54,113 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:48:54,130 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:48:54,159 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:48:54,160 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:48:54,160 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:48:54,160 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:48:54,160 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:48:54,160 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:48:54,160 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:48:54,161 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:48:54,161 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:48:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-01-12 14:48:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:48:54,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:54,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:48:54,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash 929673937, now seen corresponding path program 1 times [2019-01-12 14:48:54,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:54,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:54,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:54,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:54,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:54,460 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:48:54,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:54,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:48:54,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:48:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:48:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:48:54,484 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-01-12 14:48:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:54,512 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-01-12 14:48:54,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:48:54,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:48:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:54,530 INFO L225 Difference]: With dead ends: 172 [2019-01-12 14:48:54,530 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 14:48:54,534 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:48:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 14:48:54,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 14:48:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 14:48:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-01-12 14:48:54,586 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-01-12 14:48:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:54,587 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-01-12 14:48:54,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:48:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-01-12 14:48:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:48:54,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:54,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:48:54,589 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:54,590 INFO L82 PathProgramCache]: Analyzing trace with hash -117082960, now seen corresponding path program 1 times [2019-01-12 14:48:54,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:54,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:54,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:54,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:54,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:54,755 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:48:54,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:54,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:48:54,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:48:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:48:54,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:48:54,759 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-01-12 14:48:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:54,795 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-01-12 14:48:54,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:48:54,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:48:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:54,797 INFO L225 Difference]: With dead ends: 85 [2019-01-12 14:48:54,797 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 14:48:54,799 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:48:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 14:48:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 14:48:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 14:48:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-01-12 14:48:54,806 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-01-12 14:48:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:54,807 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-01-12 14:48:54,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:48:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-01-12 14:48:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:48:54,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:54,808 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] [2019-01-12 14:48:54,808 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:54,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash 337421565, now seen corresponding path program 1 times [2019-01-12 14:48:54,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:54,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:54,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:54,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:54,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:55,021 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:48:55,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:55,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:48:55,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:48:55,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:48:55,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:48:55,023 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2019-01-12 14:48:55,231 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:48:55,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:55,491 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. [2019-01-12 14:48:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:48:55,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 14:48:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:55,494 INFO L225 Difference]: With dead ends: 128 [2019-01-12 14:48:55,494 INFO L226 Difference]: Without dead ends: 95 [2019-01-12 14:48:55,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:48:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-12 14:48:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2019-01-12 14:48:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-12 14:48:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2019-01-12 14:48:55,517 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2019-01-12 14:48:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:55,522 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2019-01-12 14:48:55,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:48:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2019-01-12 14:48:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:48:55,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:55,528 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] [2019-01-12 14:48:55,528 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:55,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:55,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1224569535, now seen corresponding path program 1 times [2019-01-12 14:48:55,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:55,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:55,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:55,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:55,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:55,635 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:48:55,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:55,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:48:55,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:48:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:48:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:48:55,638 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2019-01-12 14:48:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:55,765 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2019-01-12 14:48:55,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:48:55,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 14:48:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:55,769 INFO L225 Difference]: With dead ends: 131 [2019-01-12 14:48:55,771 INFO L226 Difference]: Without dead ends: 79 [2019-01-12 14:48:55,773 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:48:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-12 14:48:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-01-12 14:48:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 14:48:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2019-01-12 14:48:55,796 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2019-01-12 14:48:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:55,797 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2019-01-12 14:48:55,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:48:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-01-12 14:48:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:48:55,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:55,799 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:48:55,799 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -840484654, now seen corresponding path program 1 times [2019-01-12 14:48:55,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:55,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:55,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:56,006 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:48:56,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:56,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:48:56,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:56,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:56,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:56,009 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2019-01-12 14:48:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:56,210 INFO L93 Difference]: Finished difference Result 281 states and 406 transitions. [2019-01-12 14:48:56,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:48:56,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:48:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:56,214 INFO L225 Difference]: With dead ends: 281 [2019-01-12 14:48:56,214 INFO L226 Difference]: Without dead ends: 210 [2019-01-12 14:48:56,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:48:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-12 14:48:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 138. [2019-01-12 14:48:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-12 14:48:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2019-01-12 14:48:56,253 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 25 [2019-01-12 14:48:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:56,253 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2019-01-12 14:48:56,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2019-01-12 14:48:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:48:56,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:56,255 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] [2019-01-12 14:48:56,255 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1495173652, now seen corresponding path program 1 times [2019-01-12 14:48:56,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:56,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:56,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:56,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:56,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:56,476 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:48:56,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:56,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:48:56,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:56,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:56,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:56,478 INFO L87 Difference]: Start difference. First operand 138 states and 191 transitions. Second operand 5 states. [2019-01-12 14:48:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:57,315 INFO L93 Difference]: Finished difference Result 277 states and 391 transitions. [2019-01-12 14:48:57,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:48:57,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:48:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:57,319 INFO L225 Difference]: With dead ends: 277 [2019-01-12 14:48:57,320 INFO L226 Difference]: Without dead ends: 275 [2019-01-12 14:48:57,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:48:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-12 14:48:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 138. [2019-01-12 14:48:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-12 14:48:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2019-01-12 14:48:57,366 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 26 [2019-01-12 14:48:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:57,367 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2019-01-12 14:48:57,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2019-01-12 14:48:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:48:57,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:57,372 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] [2019-01-12 14:48:57,372 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:57,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1499969411, now seen corresponding path program 1 times [2019-01-12 14:48:57,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:57,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:57,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:57,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:57,649 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:48:57,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:57,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:48:57,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:57,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:57,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:57,653 INFO L87 Difference]: Start difference. First operand 138 states and 189 transitions. Second operand 5 states. [2019-01-12 14:48:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:58,028 INFO L93 Difference]: Finished difference Result 422 states and 578 transitions. [2019-01-12 14:48:58,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:48:58,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 14:48:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:58,032 INFO L225 Difference]: With dead ends: 422 [2019-01-12 14:48:58,032 INFO L226 Difference]: Without dead ends: 290 [2019-01-12 14:48:58,033 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:48:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-12 14:48:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 144. [2019-01-12 14:48:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-12 14:48:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 195 transitions. [2019-01-12 14:48:58,066 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 195 transitions. Word has length 33 [2019-01-12 14:48:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:58,067 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 195 transitions. [2019-01-12 14:48:58,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2019-01-12 14:48:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:48:58,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:58,070 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] [2019-01-12 14:48:58,070 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:58,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:58,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2086775425, now seen corresponding path program 1 times [2019-01-12 14:48:58,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:58,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:58,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:58,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:58,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:58,201 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:48:58,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:58,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:48:58,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:48:58,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:48:58,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:48:58,203 INFO L87 Difference]: Start difference. First operand 144 states and 195 transitions. Second operand 4 states. [2019-01-12 14:48:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:58,376 INFO L93 Difference]: Finished difference Result 335 states and 455 transitions. [2019-01-12 14:48:58,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:48:58,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-12 14:48:58,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:58,379 INFO L225 Difference]: With dead ends: 335 [2019-01-12 14:48:58,380 INFO L226 Difference]: Without dead ends: 197 [2019-01-12 14:48:58,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-12 14:48:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2019-01-12 14:48:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-12 14:48:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2019-01-12 14:48:58,406 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 33 [2019-01-12 14:48:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:58,406 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2019-01-12 14:48:58,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:48:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2019-01-12 14:48:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:48:58,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:58,409 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] [2019-01-12 14:48:58,409 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash 928328193, now seen corresponding path program 1 times [2019-01-12 14:48:58,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:58,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:58,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:58,676 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:48:58,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:48:58,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:48:58,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:48:58,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:48:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:48:58,678 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand 5 states. [2019-01-12 14:48:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:48:59,124 INFO L93 Difference]: Finished difference Result 308 states and 427 transitions. [2019-01-12 14:48:59,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:48:59,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 14:48:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:48:59,128 INFO L225 Difference]: With dead ends: 308 [2019-01-12 14:48:59,128 INFO L226 Difference]: Without dead ends: 232 [2019-01-12 14:48:59,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:48:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-01-12 14:48:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 179. [2019-01-12 14:48:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-12 14:48:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 238 transitions. [2019-01-12 14:48:59,164 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 238 transitions. Word has length 33 [2019-01-12 14:48:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:48:59,164 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 238 transitions. [2019-01-12 14:48:59,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:48:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 238 transitions. [2019-01-12 14:48:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 14:48:59,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:59,168 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:48:59,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash -423849614, now seen corresponding path program 1 times [2019-01-12 14:48:59,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:59,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:59,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:48:59,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:48:59,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:48:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:48:59,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:48:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:48:59,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:48:59,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:48:59,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:48:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:48:59,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:48:59,783 INFO L87 Difference]: Start difference. First operand 179 states and 238 transitions. Second operand 6 states. [2019-01-12 14:49:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:00,665 INFO L93 Difference]: Finished difference Result 512 states and 700 transitions. [2019-01-12 14:49:00,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:49:00,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-01-12 14:49:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:00,669 INFO L225 Difference]: With dead ends: 512 [2019-01-12 14:49:00,670 INFO L226 Difference]: Without dead ends: 380 [2019-01-12 14:49:00,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:49:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-12 14:49:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 239. [2019-01-12 14:49:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-01-12 14:49:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 321 transitions. [2019-01-12 14:49:00,712 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 321 transitions. Word has length 48 [2019-01-12 14:49:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:00,713 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 321 transitions. [2019-01-12 14:49:00,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:49:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 321 transitions. [2019-01-12 14:49:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 14:49:00,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:00,716 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 14:49:00,716 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash -568509983, now seen corresponding path program 2 times [2019-01-12 14:49:00,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:00,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:00,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:01,268 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:49:01,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:49:01 BoogieIcfgContainer [2019-01-12 14:49:01,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:49:01,426 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:49:01,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:49:01,426 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:49:01,427 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:54" (3/4) ... [2019-01-12 14:49:01,430 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:49:01,573 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:49:01,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:49:01,574 INFO L168 Benchmark]: Toolchain (without parser) took 9532.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.8 MB). Free memory was 946.0 MB in the beginning and 980.7 MB in the end (delta: -34.8 MB). Peak memory consumption was 187.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:01,575 INFO L168 Benchmark]: CDTParser took 0.47 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 14:49:01,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.66 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:01,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -213.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:01,577 INFO L168 Benchmark]: Boogie Preprocessor took 52.03 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:49:01,577 INFO L168 Benchmark]: RCFGBuilder took 1246.52 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:01,578 INFO L168 Benchmark]: TraceAbstraction took 7337.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.2 MB). Peak memory consumption was 135.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:01,578 INFO L168 Benchmark]: Witness Printer took 147.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 980.7 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:01,582 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.47 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 597.66 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 146.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -213.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.03 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. * RCFGBuilder took 1246.52 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7337.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.2 MB). Peak memory consumption was 135.0 MB. Max. memory is 11.5 GB. * Witness Printer took 147.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 980.7 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 310]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L120] int pumpRunning = 0; [L121] int systemActive = 1; [L315] int cleanupTimeShifts = 4; [L415] int waterLevel = 1; [L416] int methaneLevelCritical = 0; [L713] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L391] int retValue_acc ; [L392] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L535] int retValue_acc ; [L538] retValue_acc = 1 [L539] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L398] tmp = valid_product() [L400] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L63] tmp = __VERIFIER_nondet_int() [L65] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L433] COND TRUE waterLevel < 2 [L434] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L128] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L135] COND TRUE \read(systemActive) [L157] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L160] COND TRUE ! pumpRunning [L272] int retValue_acc ; [L273] int tmp ; [L274] int tmp___0 ; [L495] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L498] COND FALSE !(waterLevel < 2) [L502] retValue_acc = 0 [L503] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L278] tmp = isHighWaterSensorDry() [L280] COND FALSE !(\read(tmp)) [L283] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L285] retValue_acc = tmp___0 [L286] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L162] tmp = isHighWaterLevel() [L164] COND TRUE \read(tmp) [L191] int tmp ; [L216] int retValue_acc ; [L454] int retValue_acc ; [L457] retValue_acc = methaneLevelCritical [L458] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L220] retValue_acc = isMethaneLevelCritical() [L222] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L195] tmp = isMethaneAlarm() [L197] COND FALSE !(\read(tmp)) [L185] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L911] int tmp ; [L912] int tmp___0 ; [L486] int retValue_acc ; [L489] retValue_acc = waterLevel [L490] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L128] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L421] COND TRUE waterLevel > 0 [L422] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L135] COND TRUE \read(systemActive) [L157] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L160] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L911] int tmp ; [L912] int tmp___0 ; [L486] int retValue_acc ; [L489] retValue_acc = waterLevel [L490] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L128] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L421] COND TRUE waterLevel > 0 [L422] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L135] COND TRUE \read(systemActive) [L157] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L160] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L911] int tmp ; [L912] int tmp___0 ; [L486] int retValue_acc ; [L489] retValue_acc = waterLevel [L490] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L916] tmp = getWaterLevel() [L918] COND TRUE tmp == 0 [L227] int retValue_acc ; [L230] retValue_acc = pumpRunning [L231] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L920] tmp___0 = isPumpRunning() [L922] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L310] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 3 error locations. UNSAFE Result, 7.2s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 857 SDtfs, 1126 SDslu, 1474 SDs, 0 SdLazy, 206 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 662 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 19846 SizeOfPredicates, 4 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...