./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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_product34.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 f18aab99c70cc7d44332259818cc5069ce850e66 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-30f4e4a [2019-11-28 00:20:58,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:58,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:58,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:58,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:58,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:58,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:58,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:58,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:58,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:58,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:58,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:58,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:58,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:58,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:58,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:58,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:58,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:58,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:58,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:58,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:58,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:58,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:58,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:58,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:58,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:58,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:58,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:58,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:58,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:58,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:58,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:58,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:58,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:58,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:58,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:58,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:58,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:58,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:58,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:58,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:58,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:20:58,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:58,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:58,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:58,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:58,793 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:58,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:58,793 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:58,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:58,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:58,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:58,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:58,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:58,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:58,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:58,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:58,796 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:58,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:58,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:58,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:58,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:58,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:58,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:58,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:58,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:58,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:58,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:58,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:58,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:58,799 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 -> f18aab99c70cc7d44332259818cc5069ce850e66 [2019-11-28 00:20:59,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:59,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:59,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:59,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:59,159 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:59,160 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product34.cil.c [2019-11-28 00:20:59,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23d8fb0a/7668d6202789457b9ea9d9bf502707fa/FLAG1ca4f51c4 [2019-11-28 00:20:59,762 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:59,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product34.cil.c [2019-11-28 00:20:59,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23d8fb0a/7668d6202789457b9ea9d9bf502707fa/FLAG1ca4f51c4 [2019-11-28 00:21:00,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23d8fb0a/7668d6202789457b9ea9d9bf502707fa [2019-11-28 00:21:00,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:21:00,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:21:00,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:00,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:21:00,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:21:00,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2f9c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00, skipping insertion in model container [2019-11-28 00:21:00,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:21:00,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:21:00,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:00,669 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:21:00,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:00,795 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:21:00,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00 WrapperNode [2019-11-28 00:21:00,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:00,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:00,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:21:00,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:21:00,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:00,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:21:00,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:21:00,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:21:00,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:21:00,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:21:00,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:21:00,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:21:00,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (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-28 00:21:00,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:21:00,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:21:00,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:21:00,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:21:01,697 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:21:01,697 INFO L297 CfgBuilder]: Removed 100 assume(true) statements. [2019-11-28 00:21:01,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:01 BoogieIcfgContainer [2019-11-28 00:21:01,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:21:01,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:21:01,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:21:01,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:21:01,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:21:00" (1/3) ... [2019-11-28 00:21:01,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23600bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:01, skipping insertion in model container [2019-11-28 00:21:01,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00" (2/3) ... [2019-11-28 00:21:01,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23600bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:01, skipping insertion in model container [2019-11-28 00:21:01,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:01" (3/3) ... [2019-11-28 00:21:01,707 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product34.cil.c [2019-11-28 00:21:01,717 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:21:01,724 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:21:01,737 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:21:01,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:21:01,765 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:21:01,765 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:21:01,765 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:21:01,766 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:21:01,767 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:21:01,767 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:21:01,768 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:21:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-28 00:21:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:21:01,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:01,802 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-28 00:21:01,803 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:01,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:01,808 INFO L82 PathProgramCache]: Analyzing trace with hash -160768028, now seen corresponding path program 1 times [2019-11-28 00:21:01,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:01,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284014051] [2019-11-28 00:21:01,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:02,037 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-28 00:21:02,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284014051] [2019-11-28 00:21:02,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:02,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:02,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446003152] [2019-11-28 00:21:02,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:21:02,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:02,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:21:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:21:02,064 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2019-11-28 00:21:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:02,095 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-11-28 00:21:02,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:21:02,096 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 00:21:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:02,110 INFO L225 Difference]: With dead ends: 157 [2019-11-28 00:21:02,110 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 00:21:02,114 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-28 00:21:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 00:21:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-28 00:21:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 00:21:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2019-11-28 00:21:02,161 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 18 [2019-11-28 00:21:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:02,161 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2019-11-28 00:21:02,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:21:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2019-11-28 00:21:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:21:02,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:02,163 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-28 00:21:02,163 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:02,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:02,164 INFO L82 PathProgramCache]: Analyzing trace with hash -379603997, now seen corresponding path program 1 times [2019-11-28 00:21:02,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:02,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612404725] [2019-11-28 00:21:02,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:02,312 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-28 00:21:02,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612404725] [2019-11-28 00:21:02,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:02,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:02,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641731742] [2019-11-28 00:21:02,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:02,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:02,316 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 3 states. [2019-11-28 00:21:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:02,336 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions. [2019-11-28 00:21:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:02,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 00:21:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:02,338 INFO L225 Difference]: With dead ends: 78 [2019-11-28 00:21:02,338 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 00:21:02,340 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-28 00:21:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 00:21:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 00:21:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 00:21:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-28 00:21:02,350 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-11-28 00:21:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:02,350 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-28 00:21:02,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-28 00:21:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:21:02,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:02,352 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-28 00:21:02,352 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash -301457865, now seen corresponding path program 1 times [2019-11-28 00:21:02,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:02,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986600704] [2019-11-28 00:21:02,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:02,492 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-28 00:21:02,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986600704] [2019-11-28 00:21:02,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:02,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:02,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388523863] [2019-11-28 00:21:02,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:02,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:02,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:02,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:02,498 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 5 states. [2019-11-28 00:21:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:02,595 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2019-11-28 00:21:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:21:02,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 00:21:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:02,601 INFO L225 Difference]: With dead ends: 65 [2019-11-28 00:21:02,601 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 00:21:02,602 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-28 00:21:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 00:21:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 00:21:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 00:21:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-11-28 00:21:02,614 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-11-28 00:21:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:02,614 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-11-28 00:21:02,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-11-28 00:21:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:21:02,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:02,618 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-28 00:21:02,618 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:02,619 INFO L82 PathProgramCache]: Analyzing trace with hash -608954119, now seen corresponding path program 1 times [2019-11-28 00:21:02,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:02,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186096009] [2019-11-28 00:21:02,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:02,742 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-28 00:21:02,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186096009] [2019-11-28 00:21:02,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:02,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:02,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611939934] [2019-11-28 00:21:02,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:02,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:02,745 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-11-28 00:21:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:02,789 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2019-11-28 00:21:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:02,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:21:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:02,791 INFO L225 Difference]: With dead ends: 87 [2019-11-28 00:21:02,792 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 00:21:02,792 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-28 00:21:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 00:21:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-11-28 00:21:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:21:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2019-11-28 00:21:02,811 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 25 [2019-11-28 00:21:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:02,811 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2019-11-28 00:21:02,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2019-11-28 00:21:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:21:02,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:02,813 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-28 00:21:02,814 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash -584147931, now seen corresponding path program 1 times [2019-11-28 00:21:02,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:02,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757533156] [2019-11-28 00:21:02,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:02,956 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-28 00:21:02,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757533156] [2019-11-28 00:21:02,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:02,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:02,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119391870] [2019-11-28 00:21:02,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:02,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:02,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:02,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:02,960 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 5 states. [2019-11-28 00:21:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,090 INFO L93 Difference]: Finished difference Result 254 states and 372 transitions. [2019-11-28 00:21:03,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:21:03,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:21:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,094 INFO L225 Difference]: With dead ends: 254 [2019-11-28 00:21:03,097 INFO L226 Difference]: Without dead ends: 205 [2019-11-28 00:21:03,098 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-28 00:21:03,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-28 00:21:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-11-28 00:21:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 00:21:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2019-11-28 00:21:03,137 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 31 [2019-11-28 00:21:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:03,138 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2019-11-28 00:21:03,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2019-11-28 00:21:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:03,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:03,143 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-28 00:21:03,143 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1078415005, now seen corresponding path program 1 times [2019-11-28 00:21:03,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:03,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60748002] [2019-11-28 00:21:03,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:03,240 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-28 00:21:03,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60748002] [2019-11-28 00:21:03,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:03,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:03,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452013901] [2019-11-28 00:21:03,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:03,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:03,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:03,246 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 5 states. [2019-11-28 00:21:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,374 INFO L93 Difference]: Finished difference Result 346 states and 493 transitions. [2019-11-28 00:21:03,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:21:03,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:21:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,377 INFO L225 Difference]: With dead ends: 346 [2019-11-28 00:21:03,377 INFO L226 Difference]: Without dead ends: 256 [2019-11-28 00:21:03,378 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-28 00:21:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-28 00:21:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 96. [2019-11-28 00:21:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 00:21:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2019-11-28 00:21:03,395 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 32 [2019-11-28 00:21:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:03,396 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2019-11-28 00:21:03,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2019-11-28 00:21:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:03,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:03,397 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-28 00:21:03,398 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:03,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:03,398 INFO L82 PathProgramCache]: Analyzing trace with hash 144951296, now seen corresponding path program 1 times [2019-11-28 00:21:03,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:03,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295530234] [2019-11-28 00:21:03,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:03,463 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-28 00:21:03,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295530234] [2019-11-28 00:21:03,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:03,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:03,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140303956] [2019-11-28 00:21:03,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:03,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:03,466 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand 5 states. [2019-11-28 00:21:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,534 INFO L93 Difference]: Finished difference Result 245 states and 340 transitions. [2019-11-28 00:21:03,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:21:03,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:21:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,537 INFO L225 Difference]: With dead ends: 245 [2019-11-28 00:21:03,538 INFO L226 Difference]: Without dead ends: 156 [2019-11-28 00:21:03,538 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-28 00:21:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-28 00:21:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 102. [2019-11-28 00:21:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 00:21:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 139 transitions. [2019-11-28 00:21:03,562 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 139 transitions. Word has length 32 [2019-11-28 00:21:03,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:03,564 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 139 transitions. [2019-11-28 00:21:03,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 139 transitions. [2019-11-28 00:21:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:03,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:03,573 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-28 00:21:03,573 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:03,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash 846015874, now seen corresponding path program 1 times [2019-11-28 00:21:03,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:03,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302598543] [2019-11-28 00:21:03,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:03,633 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-28 00:21:03,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302598543] [2019-11-28 00:21:03,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:03,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:03,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297040761] [2019-11-28 00:21:03,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:21:03,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:03,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:21:03,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:21:03,636 INFO L87 Difference]: Start difference. First operand 102 states and 139 transitions. Second operand 4 states. [2019-11-28 00:21:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,675 INFO L93 Difference]: Finished difference Result 243 states and 331 transitions. [2019-11-28 00:21:03,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:21:03,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-28 00:21:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,677 INFO L225 Difference]: With dead ends: 243 [2019-11-28 00:21:03,677 INFO L226 Difference]: Without dead ends: 148 [2019-11-28 00:21:03,678 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-28 00:21:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-28 00:21:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2019-11-28 00:21:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 00:21:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 143 transitions. [2019-11-28 00:21:03,700 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 143 transitions. Word has length 32 [2019-11-28 00:21:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:03,701 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 143 transitions. [2019-11-28 00:21:03,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:21:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2019-11-28 00:21:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:03,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:03,705 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-28 00:21:03,705 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:03,706 INFO L82 PathProgramCache]: Analyzing trace with hash 259209860, now seen corresponding path program 1 times [2019-11-28 00:21:03,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:03,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260785580] [2019-11-28 00:21:03,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:03,775 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-28 00:21:03,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260785580] [2019-11-28 00:21:03,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:03,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:03,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414849045] [2019-11-28 00:21:03,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:03,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:03,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:03,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:03,781 INFO L87 Difference]: Start difference. First operand 106 states and 143 transitions. Second operand 3 states. [2019-11-28 00:21:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,809 INFO L93 Difference]: Finished difference Result 253 states and 341 transitions. [2019-11-28 00:21:03,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:03,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 00:21:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,811 INFO L225 Difference]: With dead ends: 253 [2019-11-28 00:21:03,811 INFO L226 Difference]: Without dead ends: 154 [2019-11-28 00:21:03,812 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-28 00:21:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-28 00:21:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-28 00:21:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 00:21:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 201 transitions. [2019-11-28 00:21:03,840 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 201 transitions. Word has length 32 [2019-11-28 00:21:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:03,841 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 201 transitions. [2019-11-28 00:21:03,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 201 transitions. [2019-11-28 00:21:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:21:03,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:03,844 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, 1] [2019-11-28 00:21:03,844 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:03,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1203693628, now seen corresponding path program 1 times [2019-11-28 00:21:03,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:03,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255269037] [2019-11-28 00:21:03,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:03,913 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-28 00:21:03,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255269037] [2019-11-28 00:21:03,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:03,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:03,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317969068] [2019-11-28 00:21:03,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:03,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:03,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:03,916 INFO L87 Difference]: Start difference. First operand 154 states and 201 transitions. Second operand 3 states. [2019-11-28 00:21:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,971 INFO L93 Difference]: Finished difference Result 221 states and 291 transitions. [2019-11-28 00:21:03,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:03,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:21:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,973 INFO L225 Difference]: With dead ends: 221 [2019-11-28 00:21:03,973 INFO L226 Difference]: Without dead ends: 219 [2019-11-28 00:21:03,974 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-28 00:21:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-28 00:21:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 183. [2019-11-28 00:21:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-28 00:21:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 244 transitions. [2019-11-28 00:21:03,997 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 244 transitions. Word has length 33 [2019-11-28 00:21:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:03,997 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 244 transitions. [2019-11-28 00:21:03,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 244 transitions. [2019-11-28 00:21:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:21:03,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:03,999 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-28 00:21:03,999 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:04,000 INFO L82 PathProgramCache]: Analyzing trace with hash -389004008, now seen corresponding path program 1 times [2019-11-28 00:21:04,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:04,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611670407] [2019-11-28 00:21:04,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:04,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:21:04,206 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:21:04,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:21:04 BoogieIcfgContainer [2019-11-28 00:21:04,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:21:04,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:21:04,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:21:04,399 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:21:04,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:01" (3/4) ... [2019-11-28 00:21:04,403 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:21:04,589 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:21:04,589 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:21:04,592 INFO L168 Benchmark]: Toolchain (without parser) took 4519.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -199.7 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:04,593 INFO L168 Benchmark]: CDTParser took 0.23 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-28 00:21:04,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:04,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.79 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:04,595 INFO L168 Benchmark]: Boogie Preprocessor took 40.84 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-28 00:21:04,595 INFO L168 Benchmark]: RCFGBuilder took 791.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:04,596 INFO L168 Benchmark]: TraceAbstraction took 2698.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -141.7 MB). Peak memory consumption was 256.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:04,598 INFO L168 Benchmark]: Witness Printer took 190.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:04,601 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.23 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 723.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.79 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.84 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 791.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2698.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -141.7 MB). Peak memory consumption was 256.3 MB. Max. memory is 11.5 GB. * Witness Printer took 190.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 249]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L151] int waterLevel = 1; [L152] int methaneLevelCritical = 0; [L255] int methAndRunningLastTime ; [L498] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L765] int pumpRunning = 0; [L766] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L123] int retValue_acc ; [L124] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L320] int retValue_acc ; [L323] retValue_acc = 1 [L324] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L130] tmp = valid_product() [L132] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L260] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L697] int splverifierCounter ; [L698] int tmp ; [L699] int tmp___0 ; [L700] int tmp___1 ; [L701] int tmp___2 ; [L704] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L706] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L708] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L714] tmp = __VERIFIER_nondet_int() [L716] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L169] COND TRUE waterLevel < 2 [L170] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L724] tmp___0 = __VERIFIER_nondet_int() [L726] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L181] COND FALSE !(\read(methaneLevelCritical)) [L184] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L734] tmp___2 = __VERIFIER_nondet_int() [L736] COND TRUE \read(tmp___2) [L920] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L772] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L779] COND TRUE \read(systemActive) [L801] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L804] COND TRUE ! pumpRunning [L898] int retValue_acc ; [L899] int tmp ; [L900] int tmp___0 ; [L231] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L234] COND FALSE !(waterLevel < 2) [L238] retValue_acc = 0 [L239] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L904] tmp = isHighWaterSensorDry() [L906] COND FALSE !(\read(tmp)) [L909] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L911] retValue_acc = tmp___0 [L912] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L806] tmp = isHighWaterLevel() [L808] COND TRUE \read(tmp) [L829] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L265] int tmp ; [L266] int tmp___0 ; [L190] int retValue_acc ; [L193] retValue_acc = methaneLevelCritical [L194] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L270] tmp = isMethaneLevelCritical() [L272] COND TRUE \read(tmp) [L853] int retValue_acc ; [L856] retValue_acc = pumpRunning [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L274] tmp___0 = isPumpRunning() [L276] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L277] COND FALSE !(\read(methAndRunningLastTime)) [L282] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L706] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L708] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L714] tmp = __VERIFIER_nondet_int() [L716] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L724] tmp___0 = __VERIFIER_nondet_int() [L726] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L734] tmp___2 = __VERIFIER_nondet_int() [L736] COND TRUE \read(tmp___2) [L920] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L772] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L157] COND TRUE waterLevel > 0 [L158] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L779] COND TRUE \read(systemActive) [L801] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L804] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L265] int tmp ; [L266] int tmp___0 ; [L190] int retValue_acc ; [L193] retValue_acc = methaneLevelCritical [L194] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L270] tmp = isMethaneLevelCritical() [L272] COND TRUE \read(tmp) [L853] int retValue_acc ; [L856] retValue_acc = pumpRunning [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L274] tmp___0 = isPumpRunning() [L276] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L277] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L249] __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.4s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 648 SDtfs, 724 SDslu, 834 SDs, 0 SdLazy, 106 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 402 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 15114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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...