./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/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 ea28f55a4b6a2303e55c14d7dbcddcf1e8db1491 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:27:28,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:28,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:28,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:28,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:28,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:28,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:28,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:28,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:28,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:28,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:28,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:28,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:28,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:28,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:28,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:28,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:28,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:28,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:28,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:28,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:28,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:28,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:28,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:28,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:28,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:28,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:28,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:28,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:28,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:28,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:28,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:28,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:28,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:28,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:28,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:28,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:28,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:28,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:28,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:28,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:28,341 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:27:28,355 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:28,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:28,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:28,356 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:28,357 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:28,357 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:28,357 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:27:28,357 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:28,358 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:28,358 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:27:28,358 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:27:28,358 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:28,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:28,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:27:28,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:27:28,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:27:28,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:28,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:28,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:28,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:28,361 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:27:28,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:28,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:28,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:28,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:28,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:28,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:28,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:28,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:28,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:28,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:28,364 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:27:28,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:27:28,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:28,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:28,365 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_5127852d-30a1-4bf3-ac54-fca7d0de107f/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 -> ea28f55a4b6a2303e55c14d7dbcddcf1e8db1491 [2019-10-22 11:27:28,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:28,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:28,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:28,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:28,411 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:28,412 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c [2019-10-22 11:27:28,472 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/data/35c85afe0/d1790156ee5940d197d30b56d2b119ef/FLAGdca2b0973 [2019-10-22 11:27:28,936 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:28,937 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c [2019-10-22 11:27:28,949 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/data/35c85afe0/d1790156ee5940d197d30b56d2b119ef/FLAGdca2b0973 [2019-10-22 11:27:29,228 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/data/35c85afe0/d1790156ee5940d197d30b56d2b119ef [2019-10-22 11:27:29,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:29,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:29,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:29,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:29,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:29,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:29" (1/1) ... [2019-10-22 11:27:29,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13729cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29, skipping insertion in model container [2019-10-22 11:27:29,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:29" (1/1) ... [2019-10-22 11:27:29,250 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:29,302 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:29,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:29,774 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:29,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:29,897 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:29,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29 WrapperNode [2019-10-22 11:27:29,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:29,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:29,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:29,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:29,906 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:27:29" (1/1) ... [2019-10-22 11:27:29,921 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:27:29" (1/1) ... [2019-10-22 11:27:29,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:29,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:29,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:29,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:29,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29" (1/1) ... [2019-10-22 11:27:29,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29" (1/1) ... [2019-10-22 11:27:29,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29" (1/1) ... [2019-10-22 11:27:29,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29" (1/1) ... [2019-10-22 11:27:30,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29" (1/1) ... [2019-10-22 11:27:30,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29" (1/1) ... [2019-10-22 11:27:30,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29" (1/1) ... [2019-10-22 11:27:30,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:30,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:30,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:30,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:30,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/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:27:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:27:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:27:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:30,923 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:30,923 INFO L284 CfgBuilder]: Removed 118 assume(true) statements. [2019-10-22 11:27:30,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:30 BoogieIcfgContainer [2019-10-22 11:27:30,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:30,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:30,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:30,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:30,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:29" (1/3) ... [2019-10-22 11:27:30,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44df7371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:30, skipping insertion in model container [2019-10-22 11:27:30,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:29" (2/3) ... [2019-10-22 11:27:30,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44df7371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:30, skipping insertion in model container [2019-10-22 11:27:30,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:30" (3/3) ... [2019-10-22 11:27:30,935 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product42.cil.c [2019-10-22 11:27:30,946 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:30,955 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:27:30,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:27:31,005 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:31,006 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:31,006 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:31,006 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:31,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:31,007 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:31,007 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:31,007 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-10-22 11:27:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:27:31,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,038 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:27:31,040 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1607383533, now seen corresponding path program 1 times [2019-10-22 11:27:31,058 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751438601] [2019-10-22 11:27:31,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,307 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:27:31,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751438601] [2019-10-22 11:27:31,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:27:31,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987347086] [2019-10-22 11:27:31,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:27:31,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:27:31,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:27:31,335 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2019-10-22 11:27:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:31,365 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2019-10-22 11:27:31,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:27:31,366 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-22 11:27:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:31,377 INFO L225 Difference]: With dead ends: 175 [2019-10-22 11:27:31,377 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 11:27:31,380 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:27:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 11:27:31,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-10-22 11:27:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 11:27:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-10-22 11:27:31,426 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 18 [2019-10-22 11:27:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:31,426 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-10-22 11:27:31,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:27:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-10-22 11:27:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:27:31,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,428 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:27:31,428 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1734754371, now seen corresponding path program 1 times [2019-10-22 11:27:31,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833019149] [2019-10-22 11:27:31,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,549 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:27:31,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833019149] [2019-10-22 11:27:31,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:31,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226073235] [2019-10-22 11:27:31,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:31,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:31,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:31,553 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 3 states. [2019-10-22 11:27:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:31,564 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2019-10-22 11:27:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:31,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:27:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:31,566 INFO L225 Difference]: With dead ends: 87 [2019-10-22 11:27:31,566 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:27:31,567 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:27:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:27:31,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 11:27:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:27:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-10-22 11:27:31,573 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 19 [2019-10-22 11:27:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:31,573 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-10-22 11:27:31,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-10-22 11:27:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:27:31,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,574 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:27:31,575 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1107356745, now seen corresponding path program 1 times [2019-10-22 11:27:31,575 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778759747] [2019-10-22 11:27:31,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,672 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:27:31,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778759747] [2019-10-22 11:27:31,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:31,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699504244] [2019-10-22 11:27:31,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:31,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:31,675 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2019-10-22 11:27:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:31,724 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2019-10-22 11:27:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:31,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:27:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:31,729 INFO L225 Difference]: With dead ends: 71 [2019-10-22 11:27:31,729 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:27:31,730 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:27:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:27:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 11:27:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:27:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-10-22 11:27:31,746 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 24 [2019-10-22 11:27:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:31,746 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-10-22 11:27:31,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-10-22 11:27:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:27:31,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,747 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:27:31,748 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1414852999, now seen corresponding path program 1 times [2019-10-22 11:27:31,748 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220410706] [2019-10-22 11:27:31,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,831 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:27:31,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220410706] [2019-10-22 11:27:31,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:27:31,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532614551] [2019-10-22 11:27:31,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:31,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:31,834 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 3 states. [2019-10-22 11:27:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:31,888 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2019-10-22 11:27:31,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:31,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:27:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:31,889 INFO L225 Difference]: With dead ends: 93 [2019-10-22 11:27:31,890 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 11:27:31,890 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:27:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 11:27:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-22 11:27:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 11:27:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2019-10-22 11:27:31,901 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 25 [2019-10-22 11:27:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:31,901 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2019-10-22 11:27:31,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2019-10-22 11:27:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:27:31,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,902 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] [2019-10-22 11:27:31,903 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1390046811, now seen corresponding path program 1 times [2019-10-22 11:27:31,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955176410] [2019-10-22 11:27:31,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:32,010 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:27:32,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955176410] [2019-10-22 11:27:32,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:32,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:32,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094798864] [2019-10-22 11:27:32,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:32,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:32,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:32,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:32,013 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 5 states. [2019-10-22 11:27:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:32,172 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2019-10-22 11:27:32,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:32,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:27:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:32,175 INFO L225 Difference]: With dead ends: 271 [2019-10-22 11:27:32,175 INFO L226 Difference]: Without dead ends: 219 [2019-10-22 11:27:32,176 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:27:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-22 11:27:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 103. [2019-10-22 11:27:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-22 11:27:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2019-10-22 11:27:32,199 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 31 [2019-10-22 11:27:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:32,202 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2019-10-22 11:27:32,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2019-10-22 11:27:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:27:32,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:32,204 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] [2019-10-22 11:27:32,204 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:32,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:32,204 INFO L82 PathProgramCache]: Analyzing trace with hash 272516125, now seen corresponding path program 1 times [2019-10-22 11:27:32,204 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:32,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704232067] [2019-10-22 11:27:32,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:32,306 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:27:32,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704232067] [2019-10-22 11:27:32,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:32,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:32,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585538649] [2019-10-22 11:27:32,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:32,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:32,310 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand 5 states. [2019-10-22 11:27:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:32,452 INFO L93 Difference]: Finished difference Result 376 states and 533 transitions. [2019-10-22 11:27:32,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:27:32,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:27:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:32,458 INFO L225 Difference]: With dead ends: 376 [2019-10-22 11:27:32,458 INFO L226 Difference]: Without dead ends: 280 [2019-10-22 11:27:32,459 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:27:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-22 11:27:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 102. [2019-10-22 11:27:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-22 11:27:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2019-10-22 11:27:32,476 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 32 [2019-10-22 11:27:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:32,477 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2019-10-22 11:27:32,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2019-10-22 11:27:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:27:32,478 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:32,478 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:27:32,479 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash -824557763, now seen corresponding path program 1 times [2019-10-22 11:27:32,480 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:32,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940301156] [2019-10-22 11:27:32,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:32,568 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:27:32,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940301156] [2019-10-22 11:27:32,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:32,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:32,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014921497] [2019-10-22 11:27:32,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:32,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:32,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:32,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:32,570 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand 5 states. [2019-10-22 11:27:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:32,635 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2019-10-22 11:27:32,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:32,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-22 11:27:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:32,637 INFO L225 Difference]: With dead ends: 273 [2019-10-22 11:27:32,638 INFO L226 Difference]: Without dead ends: 178 [2019-10-22 11:27:32,638 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:27:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-22 11:27:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 108. [2019-10-22 11:27:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-22 11:27:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2019-10-22 11:27:32,666 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 35 [2019-10-22 11:27:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:32,667 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2019-10-22 11:27:32,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2019-10-22 11:27:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:27:32,668 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:32,668 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:27:32,669 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:32,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:32,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1835675013, now seen corresponding path program 1 times [2019-10-22 11:27:32,669 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:32,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846098940] [2019-10-22 11:27:32,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:32,730 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:27:32,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846098940] [2019-10-22 11:27:32,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:32,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:32,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633332544] [2019-10-22 11:27:32,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:32,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:32,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:32,733 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 4 states. [2019-10-22 11:27:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:32,773 INFO L93 Difference]: Finished difference Result 255 states and 347 transitions. [2019-10-22 11:27:32,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:32,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 11:27:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:32,775 INFO L225 Difference]: With dead ends: 255 [2019-10-22 11:27:32,775 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 11:27:32,776 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:27:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 11:27:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 112. [2019-10-22 11:27:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-22 11:27:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2019-10-22 11:27:32,799 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 35 [2019-10-22 11:27:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:32,799 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-10-22 11:27:32,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2019-10-22 11:27:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:27:32,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:32,801 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:27:32,801 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:32,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1438223929, now seen corresponding path program 1 times [2019-10-22 11:27:32,802 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:32,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450909236] [2019-10-22 11:27:32,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:32,861 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:27:32,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450909236] [2019-10-22 11:27:32,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:32,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:27:32,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794315256] [2019-10-22 11:27:32,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:32,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:32,863 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand 3 states. [2019-10-22 11:27:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:32,893 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-10-22 11:27:32,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:32,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:27:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:32,894 INFO L225 Difference]: With dead ends: 265 [2019-10-22 11:27:32,894 INFO L226 Difference]: Without dead ends: 160 [2019-10-22 11:27:32,895 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:27:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-22 11:27:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-10-22 11:27:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-22 11:27:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-10-22 11:27:32,938 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 35 [2019-10-22 11:27:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:32,938 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-10-22 11:27:32,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-10-22 11:27:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:27:32,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:32,950 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:27:32,951 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1113565433, now seen corresponding path program 1 times [2019-10-22 11:27:32,952 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:32,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848443533] [2019-10-22 11:27:32,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:32,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:33,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848443533] [2019-10-22 11:27:33,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:33,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:33,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779700426] [2019-10-22 11:27:33,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:33,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:33,039 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 6 states. [2019-10-22 11:27:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:33,234 INFO L93 Difference]: Finished difference Result 485 states and 635 transitions. [2019-10-22 11:27:33,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:27:33,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-22 11:27:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:33,236 INFO L225 Difference]: With dead ends: 485 [2019-10-22 11:27:33,236 INFO L226 Difference]: Without dead ends: 332 [2019-10-22 11:27:33,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:27:33,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-22 11:27:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 160. [2019-10-22 11:27:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-22 11:27:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-10-22 11:27:33,258 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 36 [2019-10-22 11:27:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:33,258 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-10-22 11:27:33,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-10-22 11:27:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:27:33,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:33,261 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:27:33,261 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:33,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1527108990, now seen corresponding path program 1 times [2019-10-22 11:27:33,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:33,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661196219] [2019-10-22 11:27:33,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:33,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:33,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:33,314 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:27:33,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661196219] [2019-10-22 11:27:33,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:33,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:33,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187373896] [2019-10-22 11:27:33,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:33,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:33,316 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 3 states. [2019-10-22 11:27:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:33,360 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2019-10-22 11:27:33,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:33,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-22 11:27:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:33,362 INFO L225 Difference]: With dead ends: 233 [2019-10-22 11:27:33,362 INFO L226 Difference]: Without dead ends: 231 [2019-10-22 11:27:33,362 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:27:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-22 11:27:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2019-10-22 11:27:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 11:27:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2019-10-22 11:27:33,382 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 51 [2019-10-22 11:27:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:33,383 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2019-10-22 11:27:33,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2019-10-22 11:27:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-22 11:27:33,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:33,384 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:27:33,384 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash 338659975, now seen corresponding path program 1 times [2019-10-22 11:27:33,385 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:33,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341229062] [2019-10-22 11:27:33,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:33,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:33,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:34,102 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:27:34,103 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:27:34,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:34 BoogieIcfgContainer [2019-10-22 11:27:34,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:34,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:34,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:34,241 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:34,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:30" (3/4) ... [2019-10-22 11:27:34,243 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:27:34,376 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5127852d-30a1-4bf3-ac54-fca7d0de107f/bin/utaipan/witness.graphml [2019-10-22 11:27:34,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:34,381 INFO L168 Benchmark]: Toolchain (without parser) took 5149.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 941.8 MB in the beginning and 1.2 GB in the end (delta: -244.5 MB). Peak memory consumption was 216.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:34,381 INFO L168 Benchmark]: CDTParser took 0.24 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:27:34,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:34,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:34,382 INFO L168 Benchmark]: Boogie Preprocessor took 52.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:34,382 INFO L168 Benchmark]: RCFGBuilder took 911.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:34,383 INFO L168 Benchmark]: TraceAbstraction took 3314.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 894.2 MB in the end (delta: 170.7 MB). Peak memory consumption was 170.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:34,383 INFO L168 Benchmark]: Witness Printer took 139.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 894.2 MB in the beginning and 1.2 GB in the end (delta: -292.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:34,385 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.24 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 664.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 911.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3314.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 894.2 MB in the end (delta: 170.7 MB). Peak memory consumption was 170.7 MB. Max. memory is 11.5 GB. * Witness Printer took 139.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 894.2 MB in the beginning and 1.2 GB in the end (delta: -292.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 844]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L486] int pumpRunning = 0; [L487] int systemActive = 1; [L666] int methAndRunningLastTime ; [L743] int cleanupTimeShifts = 4; [L850] int waterLevel = 1; [L851] int methaneLevelCritical = 0; [L817] int retValue_acc ; [L818] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L734] int retValue_acc ; [L737] retValue_acc = 1 [L738] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] tmp = valid_product() [L826] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L671] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L412] int splverifierCounter ; [L413] int tmp ; [L414] int tmp___0 ; [L415] int tmp___1 ; [L416] int tmp___2 ; [L419] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L429] tmp = __VERIFIER_nondet_int() [L431] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L868] COND TRUE waterLevel < 2 [L869] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L494] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L526] COND TRUE ! pumpRunning [L638] int retValue_acc ; [L639] int tmp ; [L640] int tmp___0 ; [L930] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L933] COND FALSE !(waterLevel < 2) [L937] retValue_acc = 0 [L938] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L644] tmp = isHighWaterSensorDry() [L646] COND FALSE !(\read(tmp)) [L649] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L651] retValue_acc = tmp___0 [L652] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L528] tmp = isHighWaterLevel() [L530] COND TRUE \read(tmp) [L557] int tmp ; [L582] int retValue_acc ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L586] retValue_acc = isMethaneLevelCritical() [L588] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L561] tmp = isMethaneAlarm() [L563] COND FALSE !(\read(tmp)) [L551] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L681] tmp = isMethaneLevelCritical() [L683] COND FALSE !(\read(tmp)) [L699] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L429] tmp = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] COND FALSE !(\read(methaneLevelCritical)) [L883] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L494] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L856] COND TRUE waterLevel > 0 [L857] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L526] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L681] tmp = isMethaneLevelCritical() [L683] COND TRUE \read(tmp) [L593] int retValue_acc ; [L596] retValue_acc = pumpRunning [L597] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L685] tmp___0 = isPumpRunning() [L687] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L688] COND FALSE !(\read(methAndRunningLastTime)) [L693] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L429] tmp = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L494] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L856] COND TRUE waterLevel > 0 [L857] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L526] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L681] tmp = isMethaneLevelCritical() [L683] COND TRUE \read(tmp) [L593] int retValue_acc ; [L596] retValue_acc = pumpRunning [L597] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L685] tmp___0 = isPumpRunning() [L687] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L688] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L844] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 837 SDtfs, 942 SDslu, 1280 SDs, 0 SdLazy, 171 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 631 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 19622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...