./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product43.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_product43.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 d3ef47dc64404f2fae365adb4fa9379fd10f9c50 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:21:03,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:21:03,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:21:03,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:21:03,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:21:03,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:21:03,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:21:03,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:21:03,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:21:03,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:21:03,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:21:03,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:21:03,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:21:03,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:21:03,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:21:03,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:21:03,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:21:03,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:21:03,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:21:03,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:21:03,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:21:03,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:21:03,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:21:03,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:21:03,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:21:03,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:21:03,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:21:03,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:21:03,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:21:03,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:21:03,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:21:03,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:21:03,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:21:03,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:21:03,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:21:03,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:21:03,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:21:03,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:21:03,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:21:03,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:21:03,875 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,898 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:21:03,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:21:03,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:21:03,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:21:03,900 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:21:03,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:21:03,901 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:21:03,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:21:03,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:21:03,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:21:03,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:21:03,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:21:03,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:21:03,903 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:21:03,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:21:03,904 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:21:03,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:21:03,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:21:03,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:21:03,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:21:03,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:21:03,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:21:03,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:21:03,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:21:03,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:21:03,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:21:03,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:21:03,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:21:03,907 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 -> d3ef47dc64404f2fae365adb4fa9379fd10f9c50 [2019-11-28 00:21:04,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:21:04,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:21:04,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:21:04,257 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:21:04,257 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:21:04,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product43.cil.c [2019-11-28 00:21:04,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4947e81/b5100ac64377488a918fef838e407110/FLAG2d69ff914 [2019-11-28 00:21:04,882 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:21:04,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product43.cil.c [2019-11-28 00:21:04,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4947e81/b5100ac64377488a918fef838e407110/FLAG2d69ff914 [2019-11-28 00:21:05,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4947e81/b5100ac64377488a918fef838e407110 [2019-11-28 00:21:05,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:21:05,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:21:05,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:05,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:21:05,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:21:05,211 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,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726ded5 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,214 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,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:21:05,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:21:05,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:05,732 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:21:05,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:05,895 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:21:05,895 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,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:05,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:05,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:21:05,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:21:05,906 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,925 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,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:05,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:21:05,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:21:05,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:21:05,990 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,990 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,995 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,995 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:06,006 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:06,015 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,018 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,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:21:06,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:21:06,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:21:06,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:21:06,025 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,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:21:06,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:21:06,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:21:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:21:06,954 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:21:06,954 INFO L297 CfgBuilder]: Removed 120 assume(true) statements. [2019-11-28 00:21:06,956 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,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:21:06,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:21:06,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:21:06,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:21:06,962 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,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ab8475 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,964 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,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ab8475 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,964 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,967 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product43.cil.c [2019-11-28 00:21:06,978 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:21:06,986 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:21:07,001 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:21:07,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:21:07,030 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:21:07,031 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:21:07,031 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:21:07,031 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:21:07,032 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:21:07,032 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:21:07,032 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:21:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-11-28 00:21:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:21:07,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,064 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,065 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1388908220, now seen corresponding path program 1 times [2019-11-28 00:21:07,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797178263] [2019-11-28 00:21:07,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,358 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 [797178263] [2019-11-28 00:21:07,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:07,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608615407] [2019-11-28 00:21:07,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:21:07,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:21:07,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:21:07,385 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2019-11-28 00:21:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,419 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2019-11-28 00:21:07,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:21:07,421 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 00:21:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,434 INFO L225 Difference]: With dead ends: 179 [2019-11-28 00:21:07,435 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 00:21:07,439 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,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 00:21:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 00:21:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 00:21:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2019-11-28 00:21:07,489 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 18 [2019-11-28 00:21:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,490 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2019-11-28 00:21:07,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:21:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2019-11-28 00:21:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:21:07,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,492 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,493 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1607744189, now seen corresponding path program 1 times [2019-11-28 00:21:07,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033209915] [2019-11-28 00:21:07,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,621 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,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033209915] [2019-11-28 00:21:07,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:07,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219039483] [2019-11-28 00:21:07,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:07,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:07,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:07,625 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand 3 states. [2019-11-28 00:21:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,639 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-28 00:21:07,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:07,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 00:21:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,641 INFO L225 Difference]: With dead ends: 89 [2019-11-28 00:21:07,641 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 00:21:07,642 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,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 00:21:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 00:21:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 00:21:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-11-28 00:21:07,649 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 19 [2019-11-28 00:21:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,650 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-11-28 00:21:07,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-11-28 00:21:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:21:07,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,651 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,652 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1417220031, now seen corresponding path program 1 times [2019-11-28 00:21:07,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770462934] [2019-11-28 00:21:07,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,803 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,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770462934] [2019-11-28 00:21:07,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:07,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759421656] [2019-11-28 00:21:07,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:21:07,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:21:07,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:21:07,807 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 6 states. [2019-11-28 00:21:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,982 INFO L93 Difference]: Finished difference Result 133 states and 196 transitions. [2019-11-28 00:21:07,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:21:07,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 00:21:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,988 INFO L225 Difference]: With dead ends: 133 [2019-11-28 00:21:07,989 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 00:21:07,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:21:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 00:21:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2019-11-28 00:21:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 00:21:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2019-11-28 00:21:08,018 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 24 [2019-11-28 00:21:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,019 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2019-11-28 00:21:08,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:21:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2019-11-28 00:21:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:21:08,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,022 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:08,023 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash -462384263, now seen corresponding path program 1 times [2019-11-28 00:21:08,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502628706] [2019-11-28 00:21:08,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,086 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 [502628706] [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 [2] imperfect sequences [] total 2 [2019-11-28 00:21:08,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951063160] [2019-11-28 00:21:08,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:08,137 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 3 interpolants. [2019-11-28 00:21:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:08,138 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand 3 states. [2019-11-28 00:21:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,197 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2019-11-28 00:21:08,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:08,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:21:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,199 INFO L225 Difference]: With dead ends: 137 [2019-11-28 00:21:08,199 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:21:08,200 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,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:21:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-28 00:21:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 00:21:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2019-11-28 00:21:08,230 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 25 [2019-11-28 00:21:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,231 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2019-11-28 00:21:08,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2019-11-28 00:21:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:21:08,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,233 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] [2019-11-28 00:21:08,235 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1738728008, now seen corresponding path program 1 times [2019-11-28 00:21:08,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207393636] [2019-11-28 00:21:08,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,362 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,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207393636] [2019-11-28 00:21:08,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:08,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482088319] [2019-11-28 00:21:08,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:08,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:08,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:08,365 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 5 states. [2019-11-28 00:21:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,520 INFO L93 Difference]: Finished difference Result 378 states and 552 transitions. [2019-11-28 00:21:08,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:21:08,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 00:21:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,523 INFO L225 Difference]: With dead ends: 378 [2019-11-28 00:21:08,524 INFO L226 Difference]: Without dead ends: 304 [2019-11-28 00:21:08,525 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,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-28 00:21:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 144. [2019-11-28 00:21:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 00:21:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2019-11-28 00:21:08,549 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 27 [2019-11-28 00:21:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,549 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2019-11-28 00:21:08,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2019-11-28 00:21:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 00:21:08,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,551 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] [2019-11-28 00:21:08,552 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash 304582848, now seen corresponding path program 1 times [2019-11-28 00:21:08,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951129281] [2019-11-28 00:21:08,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,660 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,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951129281] [2019-11-28 00:21:08,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:08,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823971061] [2019-11-28 00:21:08,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:08,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:08,664 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand 5 states. [2019-11-28 00:21:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,816 INFO L93 Difference]: Finished difference Result 529 states and 751 transitions. [2019-11-28 00:21:08,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:21:08,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 00:21:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,819 INFO L225 Difference]: With dead ends: 529 [2019-11-28 00:21:08,820 INFO L226 Difference]: Without dead ends: 392 [2019-11-28 00:21:08,822 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,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-28 00:21:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 142. [2019-11-28 00:21:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-28 00:21:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 197 transitions. [2019-11-28 00:21:08,869 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 197 transitions. Word has length 28 [2019-11-28 00:21:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,869 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 197 transitions. [2019-11-28 00:21:08,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 197 transitions. [2019-11-28 00:21:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:08,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,877 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,877 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1643402821, now seen corresponding path program 1 times [2019-11-28 00:21:08,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413763359] [2019-11-28 00:21:08,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,952 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,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413763359] [2019-11-28 00:21:08,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:08,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264114757] [2019-11-28 00:21:08,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:08,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:08,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:08,955 INFO L87 Difference]: Start difference. First operand 142 states and 197 transitions. Second operand 5 states. [2019-11-28 00:21:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,031 INFO L93 Difference]: Finished difference Result 429 states and 593 transitions. [2019-11-28 00:21:09,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:21:09,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 00:21:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,034 INFO L225 Difference]: With dead ends: 429 [2019-11-28 00:21:09,034 INFO L226 Difference]: Without dead ends: 294 [2019-11-28 00:21:09,035 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:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-28 00:21:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 148. [2019-11-28 00:21:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-28 00:21:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2019-11-28 00:21:09,055 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 35 [2019-11-28 00:21:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,056 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2019-11-28 00:21:09,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2019-11-28 00:21:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:09,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,057 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:09,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash 632285571, now seen corresponding path program 1 times [2019-11-28 00:21:09,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959362790] [2019-11-28 00:21:09,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,106 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,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959362790] [2019-11-28 00:21:09,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:09,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361416193] [2019-11-28 00:21:09,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:21:09,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:21:09,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:21:09,109 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand 4 states. [2019-11-28 00:21:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,148 INFO L93 Difference]: Finished difference Result 373 states and 511 transitions. [2019-11-28 00:21:09,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:21:09,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-28 00:21:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,150 INFO L225 Difference]: With dead ends: 373 [2019-11-28 00:21:09,150 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 00:21:09,151 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:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 00:21:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2019-11-28 00:21:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 00:21:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-11-28 00:21:09,167 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 35 [2019-11-28 00:21:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,168 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-11-28 00:21:09,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:21:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-11-28 00:21:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:09,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,169 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:09,169 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash -388782783, now seen corresponding path program 1 times [2019-11-28 00:21:09,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537267772] [2019-11-28 00:21:09,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,214 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,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537267772] [2019-11-28 00:21:09,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:09,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882752369] [2019-11-28 00:21:09,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:09,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:09,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:09,217 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 3 states. [2019-11-28 00:21:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,258 INFO L93 Difference]: Finished difference Result 383 states and 521 transitions. [2019-11-28 00:21:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:09,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 00:21:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,261 INFO L225 Difference]: With dead ends: 383 [2019-11-28 00:21:09,261 INFO L226 Difference]: Without dead ends: 238 [2019-11-28 00:21:09,262 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,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-28 00:21:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2019-11-28 00:21:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-28 00:21:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2019-11-28 00:21:09,291 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 35 [2019-11-28 00:21:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,291 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2019-11-28 00:21:09,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2019-11-28 00:21:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:21:09,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,293 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,293 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,294 INFO L82 PathProgramCache]: Analyzing trace with hash -713441279, now seen corresponding path program 1 times [2019-11-28 00:21:09,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964133532] [2019-11-28 00:21:09,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,378 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,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964133532] [2019-11-28 00:21:09,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 00:21:09,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305010714] [2019-11-28 00:21:09,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:21:09,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:21:09,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:21:09,381 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 8 states. [2019-11-28 00:21:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,822 INFO L93 Difference]: Finished difference Result 877 states and 1165 transitions. [2019-11-28 00:21:09,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 00:21:09,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-11-28 00:21:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,826 INFO L225 Difference]: With dead ends: 877 [2019-11-28 00:21:09,826 INFO L226 Difference]: Without dead ends: 646 [2019-11-28 00:21:09,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:21:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-11-28 00:21:09,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 238. [2019-11-28 00:21:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-28 00:21:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 309 transitions. [2019-11-28 00:21:09,869 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 309 transitions. Word has length 36 [2019-11-28 00:21:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,869 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 309 transitions. [2019-11-28 00:21:09,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:21:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 309 transitions. [2019-11-28 00:21:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:21:09,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,871 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,871 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash -838060658, now seen corresponding path program 1 times [2019-11-28 00:21:09,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462251855] [2019-11-28 00:21:09,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,921 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,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462251855] [2019-11-28 00:21:09,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:09,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834300910] [2019-11-28 00:21:09,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:09,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:09,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:09,923 INFO L87 Difference]: Start difference. First operand 238 states and 309 transitions. Second operand 3 states. [2019-11-28 00:21:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,981 INFO L93 Difference]: Finished difference Result 327 states and 426 transitions. [2019-11-28 00:21:09,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:09,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 00:21:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,984 INFO L225 Difference]: With dead ends: 327 [2019-11-28 00:21:09,984 INFO L226 Difference]: Without dead ends: 325 [2019-11-28 00:21:09,984 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,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-28 00:21:10,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 258. [2019-11-28 00:21:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-28 00:21:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2019-11-28 00:21:10,013 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 51 [2019-11-28 00:21:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:10,013 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2019-11-28 00:21:10,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2019-11-28 00:21:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:21:10,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:10,014 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:10,015 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:10,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1134302103, now seen corresponding path program 1 times [2019-11-28 00:21:10,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:10,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154539001] [2019-11-28 00:21:10,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:10,200 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:21:10,201 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:21:10,384 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,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:21:10,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:21:10,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:21:10,385 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:21:10,386 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,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:21:10,536 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:21:10,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:21:10,539 INFO L168 Benchmark]: Toolchain (without parser) took 5336.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -42.8 MB). Peak memory consumption was 164.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,539 INFO L168 Benchmark]: CDTParser took 0.61 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,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.98 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,540 INFO L168 Benchmark]: Boogie Preprocessor took 42.62 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,541 INFO L168 Benchmark]: RCFGBuilder took 932.71 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.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,541 INFO L168 Benchmark]: TraceAbstraction took 3426.56 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.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,541 INFO L168 Benchmark]: Witness Printer took 152.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,544 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.61 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 690.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.98 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 42.62 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 932.71 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.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3426.56 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.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. * Witness Printer took 152.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 946]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L310] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L507] int cleanupTimeShifts = 4; [L648] int methAndRunningLastTime ; [L757] int pumpRunning = 0; [L758] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L588] int retValue_acc ; [L589] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L637] int retValue_acc ; [L640] retValue_acc = 1 [L641] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L595] tmp = valid_product() [L597] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L653] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L689] int splverifierCounter ; [L690] int tmp ; [L691] int tmp___0 ; [L692] int tmp___1 ; [L693] int tmp___2 ; [L696] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L698] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L700] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L706] tmp = __VERIFIER_nondet_int() [L708] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L764] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L771] COND TRUE \read(systemActive) [L793] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L796] COND TRUE ! pumpRunning [L908] int retValue_acc ; [L909] int tmp ; [L910] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L914] tmp = isHighWaterSensorDry() [L916] COND FALSE !(\read(tmp)) [L919] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L921] retValue_acc = tmp___0 [L922] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L798] tmp = isHighWaterLevel() [L800] COND TRUE \read(tmp) [L827] int tmp ; [L852] int retValue_acc ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L856] retValue_acc = isMethaneLevelCritical() [L858] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L831] tmp = isMethaneAlarm() [L833] COND FALSE !(\read(tmp)) [L821] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L658] int tmp ; [L659] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L663] tmp = isMethaneLevelCritical() [L665] COND FALSE !(\read(tmp)) [L681] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L698] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L700] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L706] tmp = __VERIFIER_nondet_int() [L708] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L764] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L771] COND TRUE \read(systemActive) [L793] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L796] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L658] int tmp ; [L659] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L663] tmp = isMethaneLevelCritical() [L665] COND TRUE \read(tmp) [L863] int retValue_acc ; [L866] retValue_acc = pumpRunning [L867] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L667] tmp___0 = isPumpRunning() [L669] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L670] COND FALSE !(\read(methAndRunningLastTime)) [L675] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L698] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L700] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L706] tmp = __VERIFIER_nondet_int() [L708] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L764] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L771] COND TRUE \read(systemActive) [L793] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L796] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L658] int tmp ; [L659] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L663] tmp = isMethaneLevelCritical() [L665] COND TRUE \read(tmp) [L863] int retValue_acc ; [L866] retValue_acc = pumpRunning [L867] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L667] tmp___0 = isPumpRunning() [L669] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L670] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L946] __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, 93 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.1s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 944 SDtfs, 1258 SDslu, 1857 SDs, 0 SdLazy, 217 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1151 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 19852 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...