./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/minepump_spec2_product33.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 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-f6fb2bb [2019-11-19 18:57:24,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:57:24,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:57:24,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:57:24,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:57:24,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:57:24,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:57:24,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:57:24,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:57:24,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:57:24,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:57:24,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:57:24,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:57:24,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:57:24,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:57:24,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:57:24,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:57:24,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:57:24,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:57:24,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:57:24,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:57:24,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:57:24,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:57:24,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:57:24,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:57:24,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:57:24,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:57:24,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:57:24,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:57:24,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:57:24,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:57:24,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:57:24,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:57:24,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:57:24,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:57:24,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:57:24,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:57:24,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:57:24,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:57:24,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:57:24,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:57:24,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:57:24,865 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:57:24,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:57:24,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:57:24,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:57:24,868 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:57:24,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:57:24,869 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:57:24,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:57:24,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:57:24,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:57:24,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:57:24,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:57:24,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:57:24,872 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:57:24,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:57:24,873 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:57:24,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:57:24,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:57:24,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:57:24,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:57:24,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:57:24,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:57:24,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:57:24,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:57:24,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:57:24,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:57:24,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:57:24,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:57:24,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 [2019-11-19 18:57:25,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:57:25,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:57:25,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:57:25,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:57:25,217 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:57:25,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2019-11-19 18:57:25,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0551684c7/42f9df4335784741b21b8d607b99e73e/FLAG8f71911c4 [2019-11-19 18:57:25,815 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:57:25,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2019-11-19 18:57:25,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0551684c7/42f9df4335784741b21b8d607b99e73e/FLAG8f71911c4 [2019-11-19 18:57:26,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0551684c7/42f9df4335784741b21b8d607b99e73e [2019-11-19 18:57:26,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:57:26,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:57:26,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:57:26,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:57:26,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:57:26,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:26,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191da8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26, skipping insertion in model container [2019-11-19 18:57:26,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:26,141 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:57:26,203 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:57:26,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:57:26,785 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:57:26,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:57:26,964 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:57:26,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26 WrapperNode [2019-11-19 18:57:26,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:57:26,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:57:26,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:57:26,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:57:26,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:26,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:27,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:57:27,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:57:27,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:57:27,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:57:27,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:27,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:27,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:27,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:27,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:27,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:27,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (1/1) ... [2019-11-19 18:57:27,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:57:27,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:57:27,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:57:27,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:57:27,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (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-11-19 18:57:27,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:57:27,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 18:57:27,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:57:27,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:57:28,086 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:57:28,086 INFO L285 CfgBuilder]: Removed 98 assume(true) statements. [2019-11-19 18:57:28,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:28 BoogieIcfgContainer [2019-11-19 18:57:28,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:57:28,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:57:28,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:57:28,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:57:28,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:57:26" (1/3) ... [2019-11-19 18:57:28,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d50e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:28, skipping insertion in model container [2019-11-19 18:57:28,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:26" (2/3) ... [2019-11-19 18:57:28,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d50e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:28, skipping insertion in model container [2019-11-19 18:57:28,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:28" (3/3) ... [2019-11-19 18:57:28,098 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product33.cil.c [2019-11-19 18:57:28,108 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:57:28,117 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-19 18:57:28,129 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-19 18:57:28,157 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:57:28,158 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:57:28,158 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:57:28,158 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:57:28,159 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:57:28,159 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:57:28,159 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:57:28,159 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:57:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-19 18:57:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 18:57:28,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:28,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:28,185 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:28,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:28,192 INFO L82 PathProgramCache]: Analyzing trace with hash -816697532, now seen corresponding path program 1 times [2019-11-19 18:57:28,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:28,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989048750] [2019-11-19 18:57:28,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:28,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989048750] [2019-11-19 18:57:28,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:28,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:28,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141390868] [2019-11-19 18:57:28,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:57:28,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:28,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:57:28,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:57:28,530 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2019-11-19 18:57:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:28,562 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-11-19 18:57:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:57:28,564 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-19 18:57:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:28,576 INFO L225 Difference]: With dead ends: 157 [2019-11-19 18:57:28,577 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 18:57:28,580 INFO L630 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-11-19 18:57:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 18:57:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-19 18:57:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-19 18:57:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2019-11-19 18:57:28,626 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 18 [2019-11-19 18:57:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:28,627 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2019-11-19 18:57:28,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:57:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2019-11-19 18:57:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 18:57:28,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:28,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:28,630 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1035533501, now seen corresponding path program 1 times [2019-11-19 18:57:28,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:28,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580779584] [2019-11-19 18:57:28,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:28,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-11-19 18:57:28,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580779584] [2019-11-19 18:57:28,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:28,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:57:28,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717694033] [2019-11-19 18:57:28,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:28,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:28,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:28,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:28,813 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 3 states. [2019-11-19 18:57:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:28,830 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions. [2019-11-19 18:57:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:28,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 18:57:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:28,835 INFO L225 Difference]: With dead ends: 78 [2019-11-19 18:57:28,836 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 18:57:28,837 INFO L630 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-11-19 18:57:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 18:57:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-19 18:57:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 18:57:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-19 18:57:28,850 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-11-19 18:57:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:28,850 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-19 18:57:28,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-19 18:57:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 18:57:28,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:28,854 INFO L410 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-11-19 18:57:28,854 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1153900874, now seen corresponding path program 1 times [2019-11-19 18:57:28,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:28,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101734327] [2019-11-19 18:57:28,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:29,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101734327] [2019-11-19 18:57:29,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:29,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:57:29,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658361768] [2019-11-19 18:57:29,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:57:29,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:29,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:57:29,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:57:29,026 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 6 states. [2019-11-19 18:57:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:29,141 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2019-11-19 18:57:29,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:57:29,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-19 18:57:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:29,143 INFO L225 Difference]: With dead ends: 65 [2019-11-19 18:57:29,143 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 18:57:29,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:57:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 18:57:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-19 18:57:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 18:57:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-11-19 18:57:29,151 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-11-19 18:57:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:29,151 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-11-19 18:57:29,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:57:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-11-19 18:57:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 18:57:29,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:29,153 INFO L410 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-11-19 18:57:29,154 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1264883623, now seen corresponding path program 1 times [2019-11-19 18:57:29,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:29,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397803310] [2019-11-19 18:57:29,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:29,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397803310] [2019-11-19 18:57:29,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:29,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:29,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625913942] [2019-11-19 18:57:29,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:29,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:29,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:29,237 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-11-19 18:57:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:29,285 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2019-11-19 18:57:29,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:29,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 18:57:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:29,287 INFO L225 Difference]: With dead ends: 87 [2019-11-19 18:57:29,288 INFO L226 Difference]: Without dead ends: 58 [2019-11-19 18:57:29,288 INFO L630 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-11-19 18:57:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-19 18:57:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-11-19 18:57:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-19 18:57:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2019-11-19 18:57:29,298 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 25 [2019-11-19 18:57:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:29,299 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2019-11-19 18:57:29,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2019-11-19 18:57:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 18:57:29,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:29,301 INFO L410 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] [2019-11-19 18:57:29,301 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:29,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:29,302 INFO L82 PathProgramCache]: Analyzing trace with hash -703728504, now seen corresponding path program 1 times [2019-11-19 18:57:29,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:29,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079751929] [2019-11-19 18:57:29,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:29,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079751929] [2019-11-19 18:57:29,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:29,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:57:29,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6206725] [2019-11-19 18:57:29,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:29,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:29,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:29,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:29,398 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 5 states. [2019-11-19 18:57:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:29,481 INFO L93 Difference]: Finished difference Result 145 states and 205 transitions. [2019-11-19 18:57:29,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:57:29,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 18:57:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:29,484 INFO L225 Difference]: With dead ends: 145 [2019-11-19 18:57:29,484 INFO L226 Difference]: Without dead ends: 96 [2019-11-19 18:57:29,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:57:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-19 18:57:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 59. [2019-11-19 18:57:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 18:57:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2019-11-19 18:57:29,496 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 31 [2019-11-19 18:57:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:29,496 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2019-11-19 18:57:29,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2019-11-19 18:57:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 18:57:29,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:29,498 INFO L410 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] [2019-11-19 18:57:29,499 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash 229735205, now seen corresponding path program 1 times [2019-11-19 18:57:29,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:29,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264408945] [2019-11-19 18:57:29,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:29,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264408945] [2019-11-19 18:57:29,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:29,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:57:29,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975094628] [2019-11-19 18:57:29,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:29,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:29,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:29,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:29,623 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 5 states. [2019-11-19 18:57:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:29,777 INFO L93 Difference]: Finished difference Result 207 states and 293 transitions. [2019-11-19 18:57:29,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:57:29,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 18:57:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:29,780 INFO L225 Difference]: With dead ends: 207 [2019-11-19 18:57:29,780 INFO L226 Difference]: Without dead ends: 155 [2019-11-19 18:57:29,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 18:57:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-19 18:57:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 58. [2019-11-19 18:57:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-19 18:57:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2019-11-19 18:57:29,793 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 31 [2019-11-19 18:57:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:29,794 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2019-11-19 18:57:29,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2019-11-19 18:57:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 18:57:29,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:29,795 INFO L410 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] [2019-11-19 18:57:29,796 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2663926, now seen corresponding path program 1 times [2019-11-19 18:57:29,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:29,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702892438] [2019-11-19 18:57:29,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:29,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702892438] [2019-11-19 18:57:29,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:29,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:57:29,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010567939] [2019-11-19 18:57:29,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:57:29,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:29,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:57:29,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:57:29,851 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand 4 states. [2019-11-19 18:57:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:29,888 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2019-11-19 18:57:29,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:57:29,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-19 18:57:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:29,890 INFO L225 Difference]: With dead ends: 133 [2019-11-19 18:57:29,890 INFO L226 Difference]: Without dead ends: 82 [2019-11-19 18:57:29,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-19 18:57:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-19 18:57:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-19 18:57:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2019-11-19 18:57:29,900 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 31 [2019-11-19 18:57:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:29,901 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-19 18:57:29,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:57:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2019-11-19 18:57:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 18:57:29,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:29,903 INFO L410 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] [2019-11-19 18:57:29,903 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:29,904 INFO L82 PathProgramCache]: Analyzing trace with hash -589469940, now seen corresponding path program 1 times [2019-11-19 18:57:29,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:29,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499623465] [2019-11-19 18:57:29,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:29,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499623465] [2019-11-19 18:57:29,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:29,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:57:29,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883369236] [2019-11-19 18:57:29,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:29,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:29,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:29,958 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand 3 states. [2019-11-19 18:57:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:29,982 INFO L93 Difference]: Finished difference Result 138 states and 188 transitions. [2019-11-19 18:57:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:29,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-19 18:57:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:29,984 INFO L225 Difference]: With dead ends: 138 [2019-11-19 18:57:29,984 INFO L226 Difference]: Without dead ends: 85 [2019-11-19 18:57:29,985 INFO L630 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-11-19 18:57:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-19 18:57:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-19 18:57:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 18:57:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2019-11-19 18:57:29,996 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 31 [2019-11-19 18:57:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:29,997 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-11-19 18:57:29,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2019-11-19 18:57:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 18:57:29,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:29,999 INFO L410 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] [2019-11-19 18:57:29,999 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1606491700, now seen corresponding path program 1 times [2019-11-19 18:57:30,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:30,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296143695] [2019-11-19 18:57:30,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:57:30,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296143695] [2019-11-19 18:57:30,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:30,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:57:30,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244163335] [2019-11-19 18:57:30,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:57:30,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:30,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:57:30,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:57:30,049 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 3 states. [2019-11-19 18:57:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:30,084 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2019-11-19 18:57:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:57:30,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-19 18:57:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:30,086 INFO L225 Difference]: With dead ends: 126 [2019-11-19 18:57:30,086 INFO L226 Difference]: Without dead ends: 124 [2019-11-19 18:57:30,086 INFO L630 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-11-19 18:57:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-19 18:57:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2019-11-19 18:57:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-19 18:57:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2019-11-19 18:57:30,100 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 32 [2019-11-19 18:57:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:30,101 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2019-11-19 18:57:30,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:57:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2019-11-19 18:57:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:57:30,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:30,103 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:30,104 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1682990208, now seen corresponding path program 1 times [2019-11-19 18:57:30,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:30,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758243072] [2019-11-19 18:57:30,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:57:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 18:57:30,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758243072] [2019-11-19 18:57:30,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:57:30,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:57:30,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877609691] [2019-11-19 18:57:30,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:57:30,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:57:30,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:57:30,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:57:30,221 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand 5 states. [2019-11-19 18:57:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:57:30,333 INFO L93 Difference]: Finished difference Result 358 states and 492 transitions. [2019-11-19 18:57:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:57:30,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-19 18:57:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:57:30,337 INFO L225 Difference]: With dead ends: 358 [2019-11-19 18:57:30,338 INFO L226 Difference]: Without dead ends: 251 [2019-11-19 18:57:30,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:57:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-19 18:57:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 183. [2019-11-19 18:57:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-19 18:57:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 244 transitions. [2019-11-19 18:57:30,366 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 244 transitions. Word has length 50 [2019-11-19 18:57:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:57:30,367 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 244 transitions. [2019-11-19 18:57:30,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:57:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 244 transitions. [2019-11-19 18:57:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 18:57:30,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:57:30,373 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:57:30,373 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:57:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:57:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash 967205496, now seen corresponding path program 1 times [2019-11-19 18:57:30,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:57:30,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256591129] [2019-11-19 18:57:30,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:57:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:57:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:57:31,012 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:57:31,013 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:57:31,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:57:31 BoogieIcfgContainer [2019-11-19 18:57:31,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:57:31,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:57:31,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:57:31,149 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:57:31,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:28" (3/4) ... [2019-11-19 18:57:31,151 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:57:31,341 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:57:31,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:57:31,346 INFO L168 Benchmark]: Toolchain (without parser) took 5218.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:31,347 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:57:31,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -99.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:31,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:31,348 INFO L168 Benchmark]: Boogie Preprocessor took 52.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:57:31,348 INFO L168 Benchmark]: RCFGBuilder took 992.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:31,348 INFO L168 Benchmark]: TraceAbstraction took 3058.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 998.5 MB in the beginning and 1.2 GB in the end (delta: -157.8 MB). Peak memory consumption was 273.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:31,349 INFO L168 Benchmark]: Witness Printer took 192.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:57:31,351 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 840.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -99.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 992.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3058.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 998.5 MB in the beginning and 1.2 GB in the end (delta: -157.8 MB). Peak memory consumption was 273.3 MB. Max. memory is 11.5 GB. * Witness Printer took 192.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 284]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L85] int waterLevel = 1; [L86] int methaneLevelCritical = 0; [L179] int cleanupTimeShifts = 4; [L292] int pumpRunning = 0; [L293] int systemActive = 1; [L679] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L876] int methAndRunningLastTime ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] int retValue_acc ; [L258] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L264] tmp = valid_product() [L266] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L881] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] int splverifierCounter ; [L447] int tmp ; [L448] int tmp___0 ; [L449] int tmp___1 ; [L450] int tmp___2 ; [L453] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L463] tmp = __VERIFIER_nondet_int() [L465] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L103] COND TRUE waterLevel < 2 [L104] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L115] COND FALSE !(\read(methaneLevelCritical)) [L118] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L300] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L332] COND TRUE ! pumpRunning [L426] int retValue_acc ; [L427] int tmp ; [L428] int tmp___0 ; [L165] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L168] COND FALSE !(waterLevel < 2) [L172] retValue_acc = 0 [L173] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] tmp = isHighWaterSensorDry() [L434] COND FALSE !(\read(tmp)) [L437] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] retValue_acc = tmp___0 [L440] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L334] tmp = isHighWaterLevel() [L336] COND TRUE \read(tmp) [L357] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L898] COND FALSE !(\read(methAndRunningLastTime)) [L903] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L463] tmp = __VERIFIER_nondet_int() [L465] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L300] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L91] COND TRUE waterLevel > 0 [L92] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L332] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L898] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L284] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.9s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 659 SDtfs, 686 SDslu, 743 SDs, 0 SdLazy, 102 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 236 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 18228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...