./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product42.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_product42.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 ea28f55a4b6a2303e55c14d7dbcddcf1e8db1491 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:03,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:21:03,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:21:03,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:21:03,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:21:03,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:21:03,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:21:03,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:21:03,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:21:03,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:21:03,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:21:03,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:21:03,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:21:03,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:21:03,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:21:03,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:21:03,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:21:03,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:21:03,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:21:03,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:21:03,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:21:03,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:21:03,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:21:03,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:21:03,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:21:03,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:21:03,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:21:03,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:21:03,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:21:03,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:21:03,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:21:03,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:21:03,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:21:03,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:21:03,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:21:03,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:21:03,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:21:03,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:21:03,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:21:03,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:21:03,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:21:03,865 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:21:03,880 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:21:03,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:21:03,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:21:03,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:21:03,882 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:21:03,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:21:03,883 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:21:03,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:21:03,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:21:03,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:21:03,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:21:03,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:21:03,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:21:03,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:21:03,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:21:03,885 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:21:03,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:21:03,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:21:03,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:21:03,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:21:03,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:21:03,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:21:03,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:21:03,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:21:03,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:21:03,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:21:03,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:21:03,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:21:03,888 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 -> ea28f55a4b6a2303e55c14d7dbcddcf1e8db1491 [2019-11-28 00:21:04,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:21:04,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:21:04,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:21:04,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:21:04,213 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:21:04,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c [2019-11-28 00:21:04,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c9d2c2f/e149452f6f8842b8b2dae9e42d4e0a35/FLAGc3e2c1756 [2019-11-28 00:21:04,814 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:21:04,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c [2019-11-28 00:21:04,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c9d2c2f/e149452f6f8842b8b2dae9e42d4e0a35/FLAGc3e2c1756 [2019-11-28 00:21:05,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c9d2c2f/e149452f6f8842b8b2dae9e42d4e0a35 [2019-11-28 00:21:05,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:21:05,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:21:05,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:05,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:21:05,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:21:05,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:05" (1/1) ... [2019-11-28 00:21:05,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119fd03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:05, skipping insertion in model container [2019-11-28 00:21:05,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:05" (1/1) ... [2019-11-28 00:21:05,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:21:05,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:21:05,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:05,744 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:21:05,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:05,880 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:21:05,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:05 WrapperNode [2019-11-28 00:21:05,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:05,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:05,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:21:05,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:21:05,888 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:05" (1/1) ... [2019-11-28 00:21:05,923 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:05" (1/1) ... [2019-11-28 00:21:05,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:05,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:21:05,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:21:05,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:21:05,973 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:05" (1/1) ... [2019-11-28 00:21:05,973 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:05" (1/1) ... [2019-11-28 00:21:05,978 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:05" (1/1) ... [2019-11-28 00:21:05,978 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:05" (1/1) ... [2019-11-28 00:21:05,990 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:05" (1/1) ... [2019-11-28 00:21:05,998 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:05" (1/1) ... [2019-11-28 00:21:06,002 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:05" (1/1) ... [2019-11-28 00:21:06,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:21:06,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:21:06,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:21:06,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:21:06,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:05" (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:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:21:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:21:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:21:06,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:21:06,942 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:21:06,943 INFO L297 CfgBuilder]: Removed 118 assume(true) statements. [2019-11-28 00:21:06,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:06 BoogieIcfgContainer [2019-11-28 00:21:06,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:21:06,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:21:06,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:21:06,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:21:06,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:21:05" (1/3) ... [2019-11-28 00:21:06,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee40351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:06, skipping insertion in model container [2019-11-28 00:21:06,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:05" (2/3) ... [2019-11-28 00:21:06,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee40351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:06, skipping insertion in model container [2019-11-28 00:21:06,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:06" (3/3) ... [2019-11-28 00:21:06,953 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product42.cil.c [2019-11-28 00:21:06,963 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:21:06,971 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:21:06,984 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:21:07,009 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:21:07,009 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:21:07,010 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:21:07,010 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:21:07,010 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:21:07,010 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:21:07,010 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:21:07,011 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:21:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-11-28 00:21:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:21:07,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,039 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:07,040 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1607383533, now seen corresponding path program 1 times [2019-11-28 00:21:07,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739265717] [2019-11-28 00:21:07,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,357 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:07,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739265717] [2019-11-28 00:21:07,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:07,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378982636] [2019-11-28 00:21:07,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:21:07,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:21:07,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:21:07,392 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2019-11-28 00:21:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,447 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2019-11-28 00:21:07,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:21:07,448 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 00:21:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,464 INFO L225 Difference]: With dead ends: 175 [2019-11-28 00:21:07,465 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 00:21:07,471 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:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 00:21:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-28 00:21:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 00:21:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-11-28 00:21:07,517 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 18 [2019-11-28 00:21:07,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,518 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-11-28 00:21:07,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:21:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-11-28 00:21:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:21:07,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,519 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:07,520 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1734754371, now seen corresponding path program 1 times [2019-11-28 00:21:07,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554770129] [2019-11-28 00:21:07,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,662 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:07,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554770129] [2019-11-28 00:21:07,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:07,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894311951] [2019-11-28 00:21:07,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:07,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:07,666 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 3 states. [2019-11-28 00:21:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,681 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2019-11-28 00:21:07,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:07,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 00:21:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,683 INFO L225 Difference]: With dead ends: 87 [2019-11-28 00:21:07,684 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 00:21:07,685 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:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 00:21:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 00:21:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:21:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-28 00:21:07,693 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 19 [2019-11-28 00:21:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,693 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-28 00:21:07,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-28 00:21:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:21:07,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,696 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:07,696 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1107356745, now seen corresponding path program 1 times [2019-11-28 00:21:07,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436943685] [2019-11-28 00:21:07,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,801 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:07,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436943685] [2019-11-28 00:21:07,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:07,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60707073] [2019-11-28 00:21:07,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:07,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:07,804 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2019-11-28 00:21:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,831 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2019-11-28 00:21:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:07,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:21:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,833 INFO L225 Difference]: With dead ends: 71 [2019-11-28 00:21:07,833 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 00:21:07,834 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:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 00:21:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 00:21:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:21:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-28 00:21:07,846 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 24 [2019-11-28 00:21:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,846 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 00:21:07,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-11-28 00:21:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:21:07,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,853 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:07,853 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1414852999, now seen corresponding path program 1 times [2019-11-28 00:21:07,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567829276] [2019-11-28 00:21:07,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,970 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:07,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567829276] [2019-11-28 00:21:07,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:07,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909235823] [2019-11-28 00:21:07,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:07,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:07,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:07,974 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 3 states. [2019-11-28 00:21:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,023 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2019-11-28 00:21:08,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:08,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:21:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,024 INFO L225 Difference]: With dead ends: 93 [2019-11-28 00:21:08,025 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 00:21:08,026 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:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 00:21:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-11-28 00:21:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 00:21:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2019-11-28 00:21:08,035 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 25 [2019-11-28 00:21:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,035 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2019-11-28 00:21:08,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2019-11-28 00:21:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:21:08,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,037 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:08,037 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1390046811, now seen corresponding path program 1 times [2019-11-28 00:21:08,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923611631] [2019-11-28 00:21:08,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,135 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:08,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923611631] [2019-11-28 00:21:08,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:08,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98866151] [2019-11-28 00:21:08,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:08,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:08,139 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 5 states. [2019-11-28 00:21:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,325 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2019-11-28 00:21:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:21:08,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:21:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,330 INFO L225 Difference]: With dead ends: 271 [2019-11-28 00:21:08,334 INFO L226 Difference]: Without dead ends: 219 [2019-11-28 00:21:08,335 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:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-28 00:21:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 103. [2019-11-28 00:21:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 00:21:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2019-11-28 00:21:08,380 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 31 [2019-11-28 00:21:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,381 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2019-11-28 00:21:08,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2019-11-28 00:21:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:08,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,391 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:08,392 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash 272516125, now seen corresponding path program 1 times [2019-11-28 00:21:08,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892786316] [2019-11-28 00:21:08,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,533 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:08,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892786316] [2019-11-28 00:21:08,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:08,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458008834] [2019-11-28 00:21:08,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:08,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:08,539 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand 5 states. [2019-11-28 00:21:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,697 INFO L93 Difference]: Finished difference Result 376 states and 533 transitions. [2019-11-28 00:21:08,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:21:08,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:21:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,700 INFO L225 Difference]: With dead ends: 376 [2019-11-28 00:21:08,700 INFO L226 Difference]: Without dead ends: 280 [2019-11-28 00:21:08,701 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:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-28 00:21:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 102. [2019-11-28 00:21:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 00:21:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2019-11-28 00:21:08,718 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 32 [2019-11-28 00:21:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,718 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2019-11-28 00:21:08,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2019-11-28 00:21:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:08,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,720 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, 1, 1] [2019-11-28 00:21:08,721 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash -824557763, now seen corresponding path program 1 times [2019-11-28 00:21:08,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721277668] [2019-11-28 00:21:08,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,780 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:08,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721277668] [2019-11-28 00:21:08,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:08,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032128490] [2019-11-28 00:21:08,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:08,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:08,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:08,783 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand 5 states. [2019-11-28 00:21:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,839 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2019-11-28 00:21:08,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:21:08,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 00:21:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,842 INFO L225 Difference]: With dead ends: 273 [2019-11-28 00:21:08,842 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 00:21:08,843 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:08,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 00:21:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 108. [2019-11-28 00:21:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 00:21:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2019-11-28 00:21:08,857 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 35 [2019-11-28 00:21:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,858 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2019-11-28 00:21:08,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2019-11-28 00:21:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:08,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,860 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, 1, 1] [2019-11-28 00:21:08,860 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1835675013, now seen corresponding path program 1 times [2019-11-28 00:21:08,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977986647] [2019-11-28 00:21:08,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,911 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:08,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977986647] [2019-11-28 00:21:08,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:08,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518608867] [2019-11-28 00:21:08,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:21:08,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:21:08,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:21:08,914 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 4 states. [2019-11-28 00:21:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,951 INFO L93 Difference]: Finished difference Result 255 states and 347 transitions. [2019-11-28 00:21:08,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:21:08,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-28 00:21:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,953 INFO L225 Difference]: With dead ends: 255 [2019-11-28 00:21:08,953 INFO L226 Difference]: Without dead ends: 154 [2019-11-28 00:21:08,954 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:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-28 00:21:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 112. [2019-11-28 00:21:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 00:21:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2019-11-28 00:21:08,968 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 35 [2019-11-28 00:21:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,968 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-11-28 00:21:08,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:21:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2019-11-28 00:21:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:08,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,970 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, 1, 1] [2019-11-28 00:21:08,971 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1438223929, now seen corresponding path program 1 times [2019-11-28 00:21:08,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514029711] [2019-11-28 00:21:08,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,018 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:09,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514029711] [2019-11-28 00:21:09,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:09,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328634795] [2019-11-28 00:21:09,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:09,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:09,022 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand 3 states. [2019-11-28 00:21:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,047 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-11-28 00:21:09,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:09,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 00:21:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,049 INFO L225 Difference]: With dead ends: 265 [2019-11-28 00:21:09,049 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 00:21:09,050 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:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 00:21:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-11-28 00:21:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 00:21:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-11-28 00:21:09,066 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 35 [2019-11-28 00:21:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,067 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-11-28 00:21:09,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-11-28 00:21:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:21:09,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,071 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, 1, 1, 1] [2019-11-28 00:21:09,071 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1113565433, now seen corresponding path program 1 times [2019-11-28 00:21:09,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992940785] [2019-11-28 00:21:09,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,150 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:09,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992940785] [2019-11-28 00:21:09,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:21:09,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647544902] [2019-11-28 00:21:09,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:21:09,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:21:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:21:09,153 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 6 states. [2019-11-28 00:21:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,382 INFO L93 Difference]: Finished difference Result 485 states and 635 transitions. [2019-11-28 00:21:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:21:09,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-28 00:21:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,386 INFO L225 Difference]: With dead ends: 485 [2019-11-28 00:21:09,386 INFO L226 Difference]: Without dead ends: 332 [2019-11-28 00:21:09,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:21:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-28 00:21:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 160. [2019-11-28 00:21:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 00:21:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-11-28 00:21:09,408 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 36 [2019-11-28 00:21:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,408 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-11-28 00:21:09,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:21:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-11-28 00:21:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:21:09,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,410 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:09,410 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1527108990, now seen corresponding path program 1 times [2019-11-28 00:21:09,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930784542] [2019-11-28 00:21:09,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:09,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930784542] [2019-11-28 00:21:09,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:09,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109928435] [2019-11-28 00:21:09,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:09,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:09,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:09,510 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 3 states. [2019-11-28 00:21:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,575 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2019-11-28 00:21:09,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:09,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 00:21:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,577 INFO L225 Difference]: With dead ends: 233 [2019-11-28 00:21:09,578 INFO L226 Difference]: Without dead ends: 231 [2019-11-28 00:21:09,579 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:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-28 00:21:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2019-11-28 00:21:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 00:21:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2019-11-28 00:21:09,599 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 51 [2019-11-28 00:21:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,599 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2019-11-28 00:21:09,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2019-11-28 00:21:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:21:09,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,601 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:09,601 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,601 INFO L82 PathProgramCache]: Analyzing trace with hash 338659975, now seen corresponding path program 1 times [2019-11-28 00:21:09,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775410595] [2019-11-28 00:21:09,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:09,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:21:09,828 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:21:10,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:21:10 BoogieIcfgContainer [2019-11-28 00:21:10,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:21:10,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:21:10,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:21:10,035 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:21:10,035 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:06" (3/4) ... [2019-11-28 00:21:10,037 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:21:10,208 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:21:10,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:21:10,210 INFO L168 Benchmark]: Toolchain (without parser) took 5090.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,211 INFO L168 Benchmark]: CDTParser took 0.43 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:10,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.57 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,212 INFO L168 Benchmark]: Boogie Preprocessor took 43.95 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:21:10,212 INFO L168 Benchmark]: RCFGBuilder took 937.25 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: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,212 INFO L168 Benchmark]: TraceAbstraction took 3088.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -94.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:21:10,213 INFO L168 Benchmark]: Witness Printer took 174.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,215 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.43 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 759.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.57 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.95 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 937.25 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: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3088.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -94.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 174.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 844]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L486] int pumpRunning = 0; [L487] int systemActive = 1; [L666] int methAndRunningLastTime ; [L743] int cleanupTimeShifts = 4; [L850] int waterLevel = 1; [L851] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L817] int retValue_acc ; [L818] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L734] int retValue_acc ; [L737] retValue_acc = 1 [L738] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] tmp = valid_product() [L826] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L671] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L412] int splverifierCounter ; [L413] int tmp ; [L414] int tmp___0 ; [L415] int tmp___1 ; [L416] int tmp___2 ; [L419] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L429] tmp = __VERIFIER_nondet_int() [L431] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L868] COND TRUE waterLevel < 2 [L869] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L494] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L526] COND TRUE ! pumpRunning [L638] int retValue_acc ; [L639] int tmp ; [L640] int tmp___0 ; [L930] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L933] COND FALSE !(waterLevel < 2) [L937] retValue_acc = 0 [L938] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L644] tmp = isHighWaterSensorDry() [L646] COND FALSE !(\read(tmp)) [L649] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L651] retValue_acc = tmp___0 [L652] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L528] tmp = isHighWaterLevel() [L530] COND TRUE \read(tmp) [L557] int tmp ; [L582] int retValue_acc ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L586] retValue_acc = isMethaneLevelCritical() [L588] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L561] tmp = isMethaneAlarm() [L563] COND FALSE !(\read(tmp)) [L551] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L681] tmp = isMethaneLevelCritical() [L683] COND FALSE !(\read(tmp)) [L699] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L429] tmp = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] COND FALSE !(\read(methaneLevelCritical)) [L883] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L494] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L856] COND TRUE waterLevel > 0 [L857] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L526] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L681] tmp = isMethaneLevelCritical() [L683] COND TRUE \read(tmp) [L593] int retValue_acc ; [L596] retValue_acc = pumpRunning [L597] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L685] tmp___0 = isPumpRunning() [L687] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L688] COND FALSE !(\read(methAndRunningLastTime)) [L693] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L429] tmp = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L494] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L856] COND TRUE waterLevel > 0 [L857] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L526] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L681] tmp = isMethaneLevelCritical() [L683] COND TRUE \read(tmp) [L593] int retValue_acc ; [L596] retValue_acc = pumpRunning [L597] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L685] tmp___0 = isPumpRunning() [L687] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L688] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L844] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 837 SDtfs, 942 SDslu, 1280 SDs, 0 SdLazy, 171 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=11, 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, 11 MinimizatonAttempts, 631 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 19622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 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...