./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec2_product43.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan --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 Taipan --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-cad4683 [2019-10-22 11:22:00,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:00,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:00,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:00,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:00,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:00,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:00,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:00,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:00,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:00,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:00,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:00,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:00,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:00,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:00,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:00,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:00,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:00,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:00,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:00,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:00,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:00,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:00,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:00,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:00,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:00,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:00,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:00,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:00,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:00,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:00,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:00,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:00,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:00,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:00,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:00,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:00,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:00,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:00,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:00,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:00,875 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:00,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:00,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:00,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:00,889 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:00,889 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:00,889 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:00,889 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:00,889 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:00,889 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:00,890 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:00,890 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:00,890 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:00,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:00,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:00,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:00,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:00,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:00,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:00,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:00,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:00,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:00,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:00,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:00,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:00,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:00,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:00,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:00,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:00,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:00,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:00,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:00,894 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:00,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:00,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:00,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:00,894 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan 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 -> Taipan 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-10-22 11:22:00,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:00,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:00,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:00,936 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:00,936 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:00,937 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec2_product43.cil.c [2019-10-22 11:22:00,999 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/data/d28c86edf/6c7ad7adf7a140ad818b31b7f421b267/FLAG77f70a413 [2019-10-22 11:22:01,488 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:01,489 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/sv-benchmarks/c/product-lines/minepump_spec2_product43.cil.c [2019-10-22 11:22:01,499 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/data/d28c86edf/6c7ad7adf7a140ad818b31b7f421b267/FLAG77f70a413 [2019-10-22 11:22:01,961 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/data/d28c86edf/6c7ad7adf7a140ad818b31b7f421b267 [2019-10-22 11:22:01,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:01,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:01,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:01,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:01,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:01,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e88365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01, skipping insertion in model container [2019-10-22 11:22:01,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,981 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:02,029 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:02,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:02,372 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:02,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:02,496 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:02,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02 WrapperNode [2019-10-22 11:22:02,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:02,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:02,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:02,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:02,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... [2019-10-22 11:22:02,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... [2019-10-22 11:22:02,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:02,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:02,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:02,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:02,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... [2019-10-22 11:22:02,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... [2019-10-22 11:22:02,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... [2019-10-22 11:22:02,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... [2019-10-22 11:22:02,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... [2019-10-22 11:22:02,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... [2019-10-22 11:22:02,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... [2019-10-22 11:22:02,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:02,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:02,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:02,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:02,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/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-10-22 11:22:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:22:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:22:02,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:02,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:03,248 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:03,248 INFO L284 CfgBuilder]: Removed 120 assume(true) statements. [2019-10-22 11:22:03,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:03 BoogieIcfgContainer [2019-10-22 11:22:03,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:03,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:03,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:03,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:03,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:01" (1/3) ... [2019-10-22 11:22:03,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63395e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:03, skipping insertion in model container [2019-10-22 11:22:03,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:02" (2/3) ... [2019-10-22 11:22:03,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63395e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:03, skipping insertion in model container [2019-10-22 11:22:03,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:03" (3/3) ... [2019-10-22 11:22:03,263 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product43.cil.c [2019-10-22 11:22:03,271 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:03,281 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:22:03,290 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:22:03,312 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:03,312 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:03,312 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:03,312 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:03,312 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:03,312 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:03,313 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:03,313 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-10-22 11:22:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:22:03,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:03,337 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:03,339 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:03,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1388908220, now seen corresponding path program 1 times [2019-10-22 11:22:03,350 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:03,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656539877] [2019-10-22 11:22:03,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:03,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:03,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:03,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656539877] [2019-10-22 11:22:03,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:03,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:03,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482960624] [2019-10-22 11:22:03,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:03,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:03,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:03,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:03,576 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2019-10-22 11:22:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:03,604 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2019-10-22 11:22:03,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:03,605 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-22 11:22:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:03,618 INFO L225 Difference]: With dead ends: 179 [2019-10-22 11:22:03,618 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 11:22:03,621 INFO L600 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-10-22 11:22:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 11:22:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-22 11:22:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:22:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2019-10-22 11:22:03,669 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 18 [2019-10-22 11:22:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:03,669 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2019-10-22 11:22:03,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2019-10-22 11:22:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:22:03,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:03,670 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:03,670 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:03,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1607744189, now seen corresponding path program 1 times [2019-10-22 11:22:03,671 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:03,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353250547] [2019-10-22 11:22:03,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:03,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:03,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:03,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353250547] [2019-10-22 11:22:03,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:03,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:03,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797207121] [2019-10-22 11:22:03,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:03,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:03,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:03,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:03,785 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand 3 states. [2019-10-22 11:22:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:03,803 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-10-22 11:22:03,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:03,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:22:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:03,807 INFO L225 Difference]: With dead ends: 89 [2019-10-22 11:22:03,807 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:22:03,808 INFO L600 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-10-22 11:22:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:22:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 11:22:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:22:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-10-22 11:22:03,814 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 19 [2019-10-22 11:22:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:03,814 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-10-22 11:22:03,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-10-22 11:22:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:22:03,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:03,815 INFO L380 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-10-22 11:22:03,815 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1417220031, now seen corresponding path program 1 times [2019-10-22 11:22:03,815 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:03,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183662314] [2019-10-22 11:22:03,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:03,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:03,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:03,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183662314] [2019-10-22 11:22:03,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:03,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:03,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855663428] [2019-10-22 11:22:03,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:03,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:03,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:03,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:03,905 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 6 states. [2019-10-22 11:22:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:04,055 INFO L93 Difference]: Finished difference Result 133 states and 196 transitions. [2019-10-22 11:22:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:04,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:22:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:04,058 INFO L225 Difference]: With dead ends: 133 [2019-10-22 11:22:04,058 INFO L226 Difference]: Without dead ends: 99 [2019-10-22 11:22:04,059 INFO L600 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-10-22 11:22:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-22 11:22:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2019-10-22 11:22:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 11:22:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2019-10-22 11:22:04,076 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 24 [2019-10-22 11:22:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:04,076 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2019-10-22 11:22:04,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2019-10-22 11:22:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:22:04,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:04,079 INFO L380 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-10-22 11:22:04,079 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:04,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:04,079 INFO L82 PathProgramCache]: Analyzing trace with hash -462384263, now seen corresponding path program 1 times [2019-10-22 11:22:04,079 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:04,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923178088] [2019-10-22 11:22:04,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:04,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923178088] [2019-10-22 11:22:04,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:04,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:04,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386607672] [2019-10-22 11:22:04,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:04,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:04,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:04,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:04,149 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand 3 states. [2019-10-22 11:22:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:04,182 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2019-10-22 11:22:04,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:04,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:22:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:04,184 INFO L225 Difference]: With dead ends: 137 [2019-10-22 11:22:04,184 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 11:22:04,184 INFO L600 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-10-22 11:22:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 11:22:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-22 11:22:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-22 11:22:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2019-10-22 11:22:04,200 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 25 [2019-10-22 11:22:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:04,200 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2019-10-22 11:22:04,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2019-10-22 11:22:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:22:04,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:04,201 INFO L380 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-10-22 11:22:04,202 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1738728008, now seen corresponding path program 1 times [2019-10-22 11:22:04,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:04,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278948026] [2019-10-22 11:22:04,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:04,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278948026] [2019-10-22 11:22:04,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:04,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:04,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116510299] [2019-10-22 11:22:04,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:04,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:04,303 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 5 states. [2019-10-22 11:22:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:04,456 INFO L93 Difference]: Finished difference Result 378 states and 552 transitions. [2019-10-22 11:22:04,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:04,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-22 11:22:04,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:04,460 INFO L225 Difference]: With dead ends: 378 [2019-10-22 11:22:04,460 INFO L226 Difference]: Without dead ends: 304 [2019-10-22 11:22:04,461 INFO L600 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-10-22 11:22:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-22 11:22:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 144. [2019-10-22 11:22:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-22 11:22:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2019-10-22 11:22:04,499 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 27 [2019-10-22 11:22:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:04,499 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2019-10-22 11:22:04,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2019-10-22 11:22:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:22:04,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:04,505 INFO L380 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-10-22 11:22:04,506 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:04,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash 304582848, now seen corresponding path program 1 times [2019-10-22 11:22:04,506 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:04,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103288677] [2019-10-22 11:22:04,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:04,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103288677] [2019-10-22 11:22:04,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:04,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:04,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154100507] [2019-10-22 11:22:04,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:04,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:04,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:04,591 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand 5 states. [2019-10-22 11:22:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:04,722 INFO L93 Difference]: Finished difference Result 529 states and 751 transitions. [2019-10-22 11:22:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:22:04,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-22 11:22:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:04,725 INFO L225 Difference]: With dead ends: 529 [2019-10-22 11:22:04,725 INFO L226 Difference]: Without dead ends: 392 [2019-10-22 11:22:04,726 INFO L600 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-10-22 11:22:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-22 11:22:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 142. [2019-10-22 11:22:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-22 11:22:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 197 transitions. [2019-10-22 11:22:04,756 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 197 transitions. Word has length 28 [2019-10-22 11:22:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:04,757 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 197 transitions. [2019-10-22 11:22:04,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 197 transitions. [2019-10-22 11:22:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:22:04,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:04,758 INFO L380 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-10-22 11:22:04,758 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:04,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:04,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1643402821, now seen corresponding path program 1 times [2019-10-22 11:22:04,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:04,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115244876] [2019-10-22 11:22:04,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:04,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115244876] [2019-10-22 11:22:04,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:04,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:04,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464383298] [2019-10-22 11:22:04,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:04,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:04,817 INFO L87 Difference]: Start difference. First operand 142 states and 197 transitions. Second operand 5 states. [2019-10-22 11:22:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:04,874 INFO L93 Difference]: Finished difference Result 429 states and 593 transitions. [2019-10-22 11:22:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:04,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-22 11:22:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:04,875 INFO L225 Difference]: With dead ends: 429 [2019-10-22 11:22:04,876 INFO L226 Difference]: Without dead ends: 294 [2019-10-22 11:22:04,880 INFO L600 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-10-22 11:22:04,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-22 11:22:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 148. [2019-10-22 11:22:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-22 11:22:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2019-10-22 11:22:04,899 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 35 [2019-10-22 11:22:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:04,900 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2019-10-22 11:22:04,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2019-10-22 11:22:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:22:04,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:04,904 INFO L380 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-10-22 11:22:04,904 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:04,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:04,904 INFO L82 PathProgramCache]: Analyzing trace with hash 632285571, now seen corresponding path program 1 times [2019-10-22 11:22:04,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:04,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22829189] [2019-10-22 11:22:04,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:04,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:04,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22829189] [2019-10-22 11:22:04,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:04,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:04,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970250773] [2019-10-22 11:22:04,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:04,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:04,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:04,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:04,951 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand 4 states. [2019-10-22 11:22:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:04,991 INFO L93 Difference]: Finished difference Result 373 states and 511 transitions. [2019-10-22 11:22:04,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:04,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 11:22:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:04,993 INFO L225 Difference]: With dead ends: 373 [2019-10-22 11:22:04,993 INFO L226 Difference]: Without dead ends: 232 [2019-10-22 11:22:04,994 INFO L600 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-10-22 11:22:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-22 11:22:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2019-10-22 11:22:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-22 11:22:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-10-22 11:22:05,015 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 35 [2019-10-22 11:22:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:05,016 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-10-22 11:22:05,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-10-22 11:22:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:22:05,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:05,017 INFO L380 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-10-22 11:22:05,017 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:05,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:05,017 INFO L82 PathProgramCache]: Analyzing trace with hash -388782783, now seen corresponding path program 1 times [2019-10-22 11:22:05,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:05,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845585248] [2019-10-22 11:22:05,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:05,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:05,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:05,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845585248] [2019-10-22 11:22:05,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:05,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:05,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864798608] [2019-10-22 11:22:05,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:05,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:05,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:05,059 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 3 states. [2019-10-22 11:22:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:05,097 INFO L93 Difference]: Finished difference Result 383 states and 521 transitions. [2019-10-22 11:22:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:05,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:22:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:05,098 INFO L225 Difference]: With dead ends: 383 [2019-10-22 11:22:05,098 INFO L226 Difference]: Without dead ends: 238 [2019-10-22 11:22:05,099 INFO L600 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-10-22 11:22:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-22 11:22:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2019-10-22 11:22:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-22 11:22:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2019-10-22 11:22:05,124 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 35 [2019-10-22 11:22:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:05,127 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2019-10-22 11:22:05,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2019-10-22 11:22:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:22:05,128 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:05,128 INFO L380 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-10-22 11:22:05,129 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash -713441279, now seen corresponding path program 1 times [2019-10-22 11:22:05,129 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:05,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133915213] [2019-10-22 11:22:05,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:05,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:05,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:05,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133915213] [2019-10-22 11:22:05,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:05,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:22:05,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780461636] [2019-10-22 11:22:05,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:05,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:05,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:05,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:05,235 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 8 states. [2019-10-22 11:22:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:05,549 INFO L93 Difference]: Finished difference Result 877 states and 1165 transitions. [2019-10-22 11:22:05,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:22:05,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-22 11:22:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:05,553 INFO L225 Difference]: With dead ends: 877 [2019-10-22 11:22:05,554 INFO L226 Difference]: Without dead ends: 646 [2019-10-22 11:22:05,554 INFO L600 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-10-22 11:22:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-10-22 11:22:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 238. [2019-10-22 11:22:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-22 11:22:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 309 transitions. [2019-10-22 11:22:05,582 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 309 transitions. Word has length 36 [2019-10-22 11:22:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:05,582 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 309 transitions. [2019-10-22 11:22:05,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 309 transitions. [2019-10-22 11:22:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:22:05,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:05,583 INFO L380 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-10-22 11:22:05,584 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash -838060658, now seen corresponding path program 1 times [2019-10-22 11:22:05,584 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:05,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996312172] [2019-10-22 11:22:05,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:05,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:05,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:05,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996312172] [2019-10-22 11:22:05,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:05,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:05,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093133190] [2019-10-22 11:22:05,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:05,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:05,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:05,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:05,622 INFO L87 Difference]: Start difference. First operand 238 states and 309 transitions. Second operand 3 states. [2019-10-22 11:22:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:05,668 INFO L93 Difference]: Finished difference Result 327 states and 426 transitions. [2019-10-22 11:22:05,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:05,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-22 11:22:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:05,669 INFO L225 Difference]: With dead ends: 327 [2019-10-22 11:22:05,670 INFO L226 Difference]: Without dead ends: 325 [2019-10-22 11:22:05,670 INFO L600 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-10-22 11:22:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-22 11:22:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 258. [2019-10-22 11:22:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-22 11:22:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2019-10-22 11:22:05,695 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 51 [2019-10-22 11:22:05,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:05,695 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2019-10-22 11:22:05,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2019-10-22 11:22:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-22 11:22:05,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:05,696 INFO L380 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-10-22 11:22:05,697 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:05,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:05,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1134302103, now seen corresponding path program 1 times [2019-10-22 11:22:05,697 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:05,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893842162] [2019-10-22 11:22:05,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:05,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:05,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:06,189 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:22:06,190 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:22:06,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:06 BoogieIcfgContainer [2019-10-22 11:22:06,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:06,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:06,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:06,349 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:06,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:03" (3/4) ... [2019-10-22 11:22:06,351 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:22:06,486 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2ed2a5a9-610b-4859-bf92-2316a15f133c/bin/utaipan/witness.graphml [2019-10-22 11:22:06,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:06,488 INFO L168 Benchmark]: Toolchain (without parser) took 4521.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 939.1 MB in the beginning and 900.1 MB in the end (delta: 39.0 MB). Peak memory consumption was 240.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:06,488 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:06,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 529.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:06,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:06,489 INFO L168 Benchmark]: Boogie Preprocessor took 30.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:06,489 INFO L168 Benchmark]: RCFGBuilder took 668.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:06,490 INFO L168 Benchmark]: TraceAbstraction took 3097.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.0 GB in the beginning and 931.6 MB in the end (delta: 91.1 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:06,490 INFO L168 Benchmark]: Witness Printer took 137.67 ms. Allocated memory is still 1.2 GB. Free memory was 931.6 MB in the beginning and 900.1 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:06,491 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 529.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 668.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3097.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.0 GB in the beginning and 931.6 MB in the end (delta: 91.1 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. * Witness Printer took 137.67 ms. Allocated memory is still 1.2 GB. Free memory was 931.6 MB in the beginning and 900.1 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.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; [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.0s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.0s, 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.3s 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1151 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s 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...