./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product38.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_spec4_product38.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 764a558f84753bff2f3381f04a56ebf221297041 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:46,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:46,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:46,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:46,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:46,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:46,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:46,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:46,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:46,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:46,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:46,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:46,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:46,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:46,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:46,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:46,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:46,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:46,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:46,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:46,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:46,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:46,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:46,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:46,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:46,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:46,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:46,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:46,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:46,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:46,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:46,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:46,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:46,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:46,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:46,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:46,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:46,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:46,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:46,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:46,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:46,709 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:22:46,734 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:46,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:46,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:46,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:46,738 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:46,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:46,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:46,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:46,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:46,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:46,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:46,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:46,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:46,742 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:46,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:46,743 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:46,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:46,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:46,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:46,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:46,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:46,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:46,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:46,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:46,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:46,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:46,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:46,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:46,747 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 -> 764a558f84753bff2f3381f04a56ebf221297041 [2019-11-28 00:22:47,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:47,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:47,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:47,078 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:47,079 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:47,080 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2019-11-28 00:22:47,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c3daa27/43521a3e76d24b92b5c7fe7006308c28/FLAG4a8983836 [2019-11-28 00:22:47,700 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:47,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2019-11-28 00:22:47,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c3daa27/43521a3e76d24b92b5c7fe7006308c28/FLAG4a8983836 [2019-11-28 00:22:47,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c3daa27/43521a3e76d24b92b5c7fe7006308c28 [2019-11-28 00:22:47,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:47,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:47,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:47,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:47,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:48,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:48,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309df8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48, skipping insertion in model container [2019-11-28 00:22:48,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:48,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:48,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:48,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:48,579 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:48,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:48,717 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:48,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48 WrapperNode [2019-11-28 00:22:48,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:48,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:48,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:48,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:48,728 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:22:48" (1/1) ... [2019-11-28 00:22:48,753 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:22:48" (1/1) ... [2019-11-28 00:22:48,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:48,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:48,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:48,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:48,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:48,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:48,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:48,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:48,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48" (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:22:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:48,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:49,972 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:49,973 INFO L297 CfgBuilder]: Removed 158 assume(true) statements. [2019-11-28 00:22:49,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:49 BoogieIcfgContainer [2019-11-28 00:22:49,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:49,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:49,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:49,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:49,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:47" (1/3) ... [2019-11-28 00:22:49,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4784ca11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:49, skipping insertion in model container [2019-11-28 00:22:49,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48" (2/3) ... [2019-11-28 00:22:49,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4784ca11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:49, skipping insertion in model container [2019-11-28 00:22:49,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:49" (3/3) ... [2019-11-28 00:22:49,994 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product38.cil.c [2019-11-28 00:22:50,008 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:50,022 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:50,037 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:50,084 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:50,084 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:50,086 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:50,086 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:50,088 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:50,089 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:50,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:50,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-11-28 00:22:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:50,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:50,116 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1529342393, now seen corresponding path program 1 times [2019-11-28 00:22:50,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416426612] [2019-11-28 00:22:50,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,408 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:22:50,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416426612] [2019-11-28 00:22:50,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:50,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733993855] [2019-11-28 00:22:50,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:50,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:50,433 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-11-28 00:22:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,484 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-11-28 00:22:50,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:50,487 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,511 INFO L225 Difference]: With dead ends: 216 [2019-11-28 00:22:50,511 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 00:22:50,517 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:22:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 00:22:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-28 00:22:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 00:22:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-11-28 00:22:50,603 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-11-28 00:22:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,604 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-11-28 00:22:50,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-11-28 00:22:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:50,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:50,610 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1945506518, now seen corresponding path program 1 times [2019-11-28 00:22:50,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578527404] [2019-11-28 00:22:50,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,771 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:22:50,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578527404] [2019-11-28 00:22:50,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:50,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469052681] [2019-11-28 00:22:50,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:50,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:50,776 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-11-28 00:22:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,790 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-11-28 00:22:50,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:50,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,792 INFO L225 Difference]: With dead ends: 107 [2019-11-28 00:22:50,792 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 00:22:50,794 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:22:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 00:22:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 00:22:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 00:22:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-11-28 00:22:50,800 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-11-28 00:22:50,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,801 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-11-28 00:22:50,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-11-28 00:22:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:50,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,803 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] [2019-11-28 00:22:50,803 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1939738244, now seen corresponding path program 1 times [2019-11-28 00:22:50,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633663714] [2019-11-28 00:22:50,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,907 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:22:50,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633663714] [2019-11-28 00:22:50,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:50,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186369749] [2019-11-28 00:22:50,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:50,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:50,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:50,910 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 5 states. [2019-11-28 00:22:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,972 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-11-28 00:22:50,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:22:50,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:22:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,974 INFO L225 Difference]: With dead ends: 84 [2019-11-28 00:22:50,974 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 00:22:50,975 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:22:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 00:22:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 00:22:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 00:22:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-11-28 00:22:50,982 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-11-28 00:22:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,983 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-11-28 00:22:50,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-11-28 00:22:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:22:50,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,985 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:22:50,985 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1547834963, now seen corresponding path program 1 times [2019-11-28 00:22:50,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421518900] [2019-11-28 00:22:50,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,065 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:22:51,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421518900] [2019-11-28 00:22:51,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:51,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179203482] [2019-11-28 00:22:51,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:51,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:51,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,069 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-11-28 00:22:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,131 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-11-28 00:22:51,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:51,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:22:51,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,133 INFO L225 Difference]: With dead ends: 105 [2019-11-28 00:22:51,133 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 00:22:51,135 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:22:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 00:22:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-28 00:22:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 00:22:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-11-28 00:22:51,145 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-11-28 00:22:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,146 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-11-28 00:22:51,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-11-28 00:22:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:51,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,148 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] [2019-11-28 00:22:51,149 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1827782978, now seen corresponding path program 1 times [2019-11-28 00:22:51,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525238922] [2019-11-28 00:22:51,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,238 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:22:51,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525238922] [2019-11-28 00:22:51,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:51,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205243824] [2019-11-28 00:22:51,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:51,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:51,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:51,242 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-11-28 00:22:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,351 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-11-28 00:22:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:51,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,356 INFO L225 Difference]: With dead ends: 171 [2019-11-28 00:22:51,356 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 00:22:51,357 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:22:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 00:22:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-11-28 00:22:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 00:22:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-11-28 00:22:51,369 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-11-28 00:22:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,369 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-11-28 00:22:51,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-11-28 00:22:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:51,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,372 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] [2019-11-28 00:22:51,372 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash 834728065, now seen corresponding path program 1 times [2019-11-28 00:22:51,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076419262] [2019-11-28 00:22:51,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,449 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:22:51,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076419262] [2019-11-28 00:22:51,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:51,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413068044] [2019-11-28 00:22:51,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:51,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:51,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:51,452 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-11-28 00:22:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,566 INFO L93 Difference]: Finished difference Result 247 states and 346 transitions. [2019-11-28 00:22:51,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:51,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,569 INFO L225 Difference]: With dead ends: 247 [2019-11-28 00:22:51,569 INFO L226 Difference]: Without dead ends: 183 [2019-11-28 00:22:51,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-28 00:22:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-11-28 00:22:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 00:22:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2019-11-28 00:22:51,588 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 30 [2019-11-28 00:22:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,589 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2019-11-28 00:22:51,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2019-11-28 00:22:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:51,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,591 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:22:51,591 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1173088129, now seen corresponding path program 1 times [2019-11-28 00:22:51,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603754483] [2019-11-28 00:22:51,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,669 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:22:51,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603754483] [2019-11-28 00:22:51,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:51,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461332371] [2019-11-28 00:22:51,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:51,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:51,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:51,678 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand 5 states. [2019-11-28 00:22:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,834 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2019-11-28 00:22:51,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:51,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,836 INFO L225 Difference]: With dead ends: 241 [2019-11-28 00:22:51,836 INFO L226 Difference]: Without dead ends: 239 [2019-11-28 00:22:51,837 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:22:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-28 00:22:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 113. [2019-11-28 00:22:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 00:22:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 151 transitions. [2019-11-28 00:22:51,854 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 151 transitions. Word has length 31 [2019-11-28 00:22:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,854 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 151 transitions. [2019-11-28 00:22:51,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 151 transitions. [2019-11-28 00:22:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:51,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,856 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:22:51,857 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash 66341114, now seen corresponding path program 1 times [2019-11-28 00:22:51,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853775017] [2019-11-28 00:22:51,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,905 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:22:51,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853775017] [2019-11-28 00:22:51,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:51,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478268221] [2019-11-28 00:22:51,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:22:51,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:22:51,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:22:51,909 INFO L87 Difference]: Start difference. First operand 113 states and 151 transitions. Second operand 4 states. [2019-11-28 00:22:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,957 INFO L93 Difference]: Finished difference Result 246 states and 329 transitions. [2019-11-28 00:22:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:22:51,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 00:22:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,959 INFO L225 Difference]: With dead ends: 246 [2019-11-28 00:22:51,960 INFO L226 Difference]: Without dead ends: 139 [2019-11-28 00:22:51,961 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:22:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-28 00:22:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2019-11-28 00:22:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 00:22:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2019-11-28 00:22:51,972 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 31 [2019-11-28 00:22:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,973 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2019-11-28 00:22:51,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:22:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2019-11-28 00:22:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:51,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,975 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:22:51,975 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 324506552, now seen corresponding path program 1 times [2019-11-28 00:22:51,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241502010] [2019-11-28 00:22:51,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,036 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:22:52,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241502010] [2019-11-28 00:22:52,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:52,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354439716] [2019-11-28 00:22:52,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:52,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:52,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:52,039 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 5 states. [2019-11-28 00:22:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,196 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-11-28 00:22:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:52,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,198 INFO L225 Difference]: With dead ends: 265 [2019-11-28 00:22:52,198 INFO L226 Difference]: Without dead ends: 197 [2019-11-28 00:22:52,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-28 00:22:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 139. [2019-11-28 00:22:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-28 00:22:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2019-11-28 00:22:52,217 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 31 [2019-11-28 00:22:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,218 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2019-11-28 00:22:52,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2019-11-28 00:22:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:22:52,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,220 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:52,221 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,221 INFO L82 PathProgramCache]: Analyzing trace with hash -337830252, now seen corresponding path program 1 times [2019-11-28 00:22:52,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21201147] [2019-11-28 00:22:52,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:52,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21201147] [2019-11-28 00:22:52,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380199904] [2019-11-28 00:22:52,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:52,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:52,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:52,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 00:22:52,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422150045] [2019-11-28 00:22:52,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:52,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:52,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:52,532 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand 6 states. [2019-11-28 00:22:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,797 INFO L93 Difference]: Finished difference Result 431 states and 573 transitions. [2019-11-28 00:22:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:52,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-28 00:22:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,802 INFO L225 Difference]: With dead ends: 431 [2019-11-28 00:22:52,802 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 00:22:52,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:22:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 00:22:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 191. [2019-11-28 00:22:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-28 00:22:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 250 transitions. [2019-11-28 00:22:52,834 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 250 transitions. Word has length 50 [2019-11-28 00:22:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,835 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 250 transitions. [2019-11-28 00:22:52,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2019-11-28 00:22:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:22:52,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,838 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 00:22:53,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:53,044 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1076130248, now seen corresponding path program 2 times [2019-11-28 00:22:53,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:53,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711834159] [2019-11-28 00:22:53,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:53,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:53,242 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:53,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:53 BoogieIcfgContainer [2019-11-28 00:22:53,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:53,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:53,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:53,446 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:53,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:49" (3/4) ... [2019-11-28 00:22:53,451 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:53,668 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:53,668 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:53,671 INFO L168 Benchmark]: Toolchain (without parser) took 5677.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -98.1 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:53,671 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:53,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:53,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:53,672 INFO L168 Benchmark]: Boogie Preprocessor took 48.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:53,673 INFO L168 Benchmark]: RCFGBuilder took 1126.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:53,673 INFO L168 Benchmark]: TraceAbstraction took 3468.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -48.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:53,674 INFO L168 Benchmark]: Witness Printer took 222.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:53,676 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 724.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1126.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3468.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -48.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Witness Printer took 222.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 247]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L149] int waterLevel = 1; [L150] int methaneLevelCritical = 0; [L349] int pumpRunning = 0; [L350] int systemActive = 1; [L704] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L927] int retValue_acc ; [L930] retValue_acc = 1 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L281] int splverifierCounter ; [L282] int tmp ; [L283] int tmp___0 ; [L284] int tmp___1 ; [L285] int tmp___2 ; [L288] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L292] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L298] tmp = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L167] COND TRUE waterLevel < 2 [L168] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L356] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L363] COND TRUE \read(systemActive) [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L414] COND FALSE !(\read(pumpRunning)) [L385] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L388] COND TRUE ! pumpRunning [L508] int retValue_acc ; [L509] int tmp ; [L510] int tmp___0 ; [L229] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L232] COND FALSE !(waterLevel < 2) [L236] retValue_acc = 0 [L237] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L514] tmp = isHighWaterSensorDry() [L516] COND FALSE !(\read(tmp)) [L519] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L521] retValue_acc = tmp___0 [L522] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L390] tmp = isHighWaterLevel() [L392] COND TRUE \read(tmp) [L439] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L259] tmp = getWaterLevel() [L261] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L292] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L298] tmp = __VERIFIER_nondet_int() [L300] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L356] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE waterLevel > 0 [L156] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L363] COND TRUE \read(systemActive) [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L414] COND TRUE \read(pumpRunning) [L452] int retValue_acc ; [L188] int retValue_acc ; [L191] retValue_acc = methaneLevelCritical [L192] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L456] retValue_acc = isMethaneLevelCritical() [L458] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L416] tmp = isMethaneAlarm() [L418] COND FALSE !(\read(tmp)) [L385] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L388] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L259] tmp = getWaterLevel() [L261] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L292] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L298] tmp = __VERIFIER_nondet_int() [L300] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L356] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L155] COND TRUE waterLevel > 0 [L156] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L363] COND TRUE \read(systemActive) [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L414] COND TRUE \read(pumpRunning) [L452] int retValue_acc ; [L188] int retValue_acc ; [L191] retValue_acc = methaneLevelCritical [L192] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L456] retValue_acc = isMethaneLevelCritical() [L458] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L416] tmp = isMethaneAlarm() [L418] COND FALSE !(\read(tmp)) [L385] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L388] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L259] tmp = getWaterLevel() [L261] COND TRUE tmp == 0 [L463] int retValue_acc ; [L466] retValue_acc = pumpRunning [L467] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L263] tmp___0 = isPumpRunning() [L265] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L247] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 111 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.1s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 952 SDtfs, 1233 SDslu, 1367 SDs, 0 SdLazy, 233 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred 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, 471 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 21005 SizeOfPredicates, 4 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 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...