./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/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 ac98b61700c421642ba0cea32b1043bdcac0ece8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:32:16,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:32:16,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:32:16,662 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:32:16,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:32:16,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:32:16,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:32:16,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:32:16,667 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:32:16,667 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:32:16,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:32:16,668 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:32:16,669 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:32:16,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:32:16,670 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:32:16,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:32:16,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:32:16,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:32:16,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:32:16,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:32:16,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:32:16,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:32:16,678 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:32:16,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:32:16,678 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:32:16,679 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:32:16,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:32:16,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:32:16,681 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:32:16,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:32:16,682 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:32:16,682 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:32:16,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:32:16,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:32:16,683 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:32:16,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:32:16,684 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 07:32:16,692 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:32:16,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:32:16,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:32:16,693 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:32:16,693 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:32:16,694 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:32:16,694 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:32:16,694 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:32:16,694 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:32:16,694 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:32:16,694 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:32:16,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:32:16,695 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:32:16,695 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:32:16,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:32:16,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:32:16,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:32:16,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:32:16,696 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:32:16,696 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:32:16,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:32:16,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:32:16,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:32:16,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:32:16,697 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:32:16,697 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:32:16,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:32:16,697 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:32:16,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:32:16,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:32:16,698 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:32:16,698 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:32:16,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:32:16,698 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:32:16,698 INFO L133 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_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/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 -> ac98b61700c421642ba0cea32b1043bdcac0ece8 [2018-11-10 07:32:16,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:32:16,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:32:16,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:32:16,730 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:32:16,731 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:32:16,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2018-11-10 07:32:16,766 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/data/9c53043e6/94104022b1564ce1a62895cf30970967/FLAG137cb5808 [2018-11-10 07:32:17,182 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:32:17,182 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/sv-benchmarks/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2018-11-10 07:32:17,189 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/data/9c53043e6/94104022b1564ce1a62895cf30970967/FLAG137cb5808 [2018-11-10 07:32:17,198 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/data/9c53043e6/94104022b1564ce1a62895cf30970967 [2018-11-10 07:32:17,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:32:17,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:32:17,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:32:17,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:32:17,203 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:32:17,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17, skipping insertion in model container [2018-11-10 07:32:17,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:32:17,240 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:32:17,417 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:32:17,425 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:32:17,477 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:32:17,493 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:32:17,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17 WrapperNode [2018-11-10 07:32:17,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:32:17,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:32:17,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:32:17,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:32:17,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:32:17,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:32:17,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:32:17,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:32:17,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... [2018-11-10 07:32:17,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:32:17,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:32:17,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:32:17,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:32:17,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/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 [2018-11-10 07:32:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2018-11-10 07:32:17,665 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2018-11-10 07:32:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification4_spec__1 [2018-11-10 07:32:17,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification4_spec__1 [2018-11-10 07:32:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:32:17,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:32:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure stopSystem [2018-11-10 07:32:17,666 INFO L138 BoogieDeclarations]: Found implementation of procedure stopSystem [2018-11-10 07:32:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure isLowWaterLevel [2018-11-10 07:32:17,666 INFO L138 BoogieDeclarations]: Found implementation of procedure isLowWaterLevel [2018-11-10 07:32:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2018-11-10 07:32:17,666 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2018-11-10 07:32:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterSensorDry [2018-11-10 07:32:17,666 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterSensorDry [2018-11-10 07:32:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment [2018-11-10 07:32:17,667 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment [2018-11-10 07:32:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2018-11-10 07:32:17,667 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2018-11-10 07:32:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure test [2018-11-10 07:32:17,667 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2018-11-10 07:32:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure isLowWaterSensorDry [2018-11-10 07:32:17,667 INFO L138 BoogieDeclarations]: Found implementation of procedure isLowWaterSensorDry [2018-11-10 07:32:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump [2018-11-10 07:32:17,667 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump [2018-11-10 07:32:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure getWaterLevel [2018-11-10 07:32:17,668 INFO L138 BoogieDeclarations]: Found implementation of procedure getWaterLevel [2018-11-10 07:32:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterLevel [2018-11-10 07:32:17,668 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterLevel [2018-11-10 07:32:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2018-11-10 07:32:17,668 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2018-11-10 07:32:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2018-11-10 07:32:17,668 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2018-11-10 07:32:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure lowerWaterLevel [2018-11-10 07:32:17,668 INFO L138 BoogieDeclarations]: Found implementation of procedure lowerWaterLevel [2018-11-10 07:32:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2018-11-10 07:32:17,669 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2018-11-10 07:32:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure startSystem [2018-11-10 07:32:17,669 INFO L138 BoogieDeclarations]: Found implementation of procedure startSystem [2018-11-10 07:32:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2018-11-10 07:32:17,669 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2018-11-10 07:32:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2018-11-10 07:32:17,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2018-11-10 07:32:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2018-11-10 07:32:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2018-11-10 07:32:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2018-11-10 07:32:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2018-11-10 07:32:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2018-11-10 07:32:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2018-11-10 07:32:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2018-11-10 07:32:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2018-11-10 07:32:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:32:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:32:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2018-11-10 07:32:17,671 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2018-11-10 07:32:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:32:17,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:32:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2018-11-10 07:32:17,671 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2018-11-10 07:32:18,344 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:32:18,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:32:18 BoogieIcfgContainer [2018-11-10 07:32:18,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:32:18,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:32:18,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:32:18,348 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:32:18,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:32:17" (1/3) ... [2018-11-10 07:32:18,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb6e341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:32:18, skipping insertion in model container [2018-11-10 07:32:18,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:32:17" (2/3) ... [2018-11-10 07:32:18,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb6e341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:32:18, skipping insertion in model container [2018-11-10 07:32:18,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:32:18" (3/3) ... [2018-11-10 07:32:18,350 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2018-11-10 07:32:18,356 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:32:18,361 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:32:18,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:32:18,393 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:32:18,393 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:32:18,393 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:32:18,393 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:32:18,393 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:32:18,394 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:32:18,394 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:32:18,394 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:32:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-11-10 07:32:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 07:32:18,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:18,416 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:18,418 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:32:18,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:18,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2087187724, now seen corresponding path program 1 times [2018-11-10 07:32:18,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:18,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:18,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:18,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:18,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:32:18,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:32:18,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:32:18,622 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:18,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:32:18,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:32:18,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:32:18,635 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 2 states. [2018-11-10 07:32:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:18,667 INFO L93 Difference]: Finished difference Result 280 states and 345 transitions. [2018-11-10 07:32:18,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:32:18,668 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 46 [2018-11-10 07:32:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:18,677 INFO L225 Difference]: With dead ends: 280 [2018-11-10 07:32:18,677 INFO L226 Difference]: Without dead ends: 140 [2018-11-10 07:32:18,680 INFO L605 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 [2018-11-10 07:32:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-10 07:32:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-10 07:32:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 07:32:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-11-10 07:32:18,722 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 46 [2018-11-10 07:32:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:18,723 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-11-10 07:32:18,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:32:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-11-10 07:32:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 07:32:18,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:18,726 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:18,726 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:32:18,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:18,727 INFO L82 PathProgramCache]: Analyzing trace with hash 426480412, now seen corresponding path program 1 times [2018-11-10 07:32:18,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:18,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:18,728 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:32:18,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:32:18,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:32:18,808 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:18,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:32:18,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:32:18,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:32:18,810 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 3 states. [2018-11-10 07:32:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:18,829 INFO L93 Difference]: Finished difference Result 217 states and 253 transitions. [2018-11-10 07:32:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:32:18,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 07:32:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:18,832 INFO L225 Difference]: With dead ends: 217 [2018-11-10 07:32:18,832 INFO L226 Difference]: Without dead ends: 130 [2018-11-10 07:32:18,833 INFO L605 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 [2018-11-10 07:32:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-10 07:32:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-10 07:32:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 07:32:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2018-11-10 07:32:18,845 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 48 [2018-11-10 07:32:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:18,845 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2018-11-10 07:32:18,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:32:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2018-11-10 07:32:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 07:32:18,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:18,847 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:18,847 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:32:18,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:18,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1358516131, now seen corresponding path program 1 times [2018-11-10 07:32:18,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:18,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:18,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:18,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:18,849 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:32:18,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:32:18,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:32:18,961 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:18,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:32:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:32:18,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:32:18,963 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand 7 states. [2018-11-10 07:32:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:19,302 INFO L93 Difference]: Finished difference Result 393 states and 474 transitions. [2018-11-10 07:32:19,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:32:19,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-11-10 07:32:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:19,305 INFO L225 Difference]: With dead ends: 393 [2018-11-10 07:32:19,306 INFO L226 Difference]: Without dead ends: 287 [2018-11-10 07:32:19,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:32:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-10 07:32:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 275. [2018-11-10 07:32:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-10 07:32:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 331 transitions. [2018-11-10 07:32:19,334 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 331 transitions. Word has length 53 [2018-11-10 07:32:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:19,335 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 331 transitions. [2018-11-10 07:32:19,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:32:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 331 transitions. [2018-11-10 07:32:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 07:32:19,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:19,337 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:19,340 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:32:19,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:19,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1072419108, now seen corresponding path program 1 times [2018-11-10 07:32:19,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:19,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:19,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:19,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:19,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:32:19,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:32:19,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 07:32:19,466 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:19,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 07:32:19,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:32:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:32:19,467 INFO L87 Difference]: Start difference. First operand 275 states and 331 transitions. Second operand 10 states. [2018-11-10 07:32:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:19,979 INFO L93 Difference]: Finished difference Result 980 states and 1272 transitions. [2018-11-10 07:32:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 07:32:19,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-10 07:32:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:19,985 INFO L225 Difference]: With dead ends: 980 [2018-11-10 07:32:19,985 INFO L226 Difference]: Without dead ends: 729 [2018-11-10 07:32:19,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-11-10 07:32:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-11-10 07:32:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 717. [2018-11-10 07:32:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2018-11-10 07:32:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 897 transitions. [2018-11-10 07:32:20,060 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 897 transitions. Word has length 58 [2018-11-10 07:32:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:20,061 INFO L481 AbstractCegarLoop]: Abstraction has 717 states and 897 transitions. [2018-11-10 07:32:20,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 07:32:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 897 transitions. [2018-11-10 07:32:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 07:32:20,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:20,063 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:20,064 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:32:20,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1686433438, now seen corresponding path program 1 times [2018-11-10 07:32:20,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:20,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:20,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:20,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:32:20,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:32:20,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:32:20,119 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:20,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:32:20,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:32:20,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:32:20,120 INFO L87 Difference]: Start difference. First operand 717 states and 897 transitions. Second operand 3 states. [2018-11-10 07:32:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:32:20,181 INFO L93 Difference]: Finished difference Result 1635 states and 2149 transitions. [2018-11-10 07:32:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:32:20,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-10 07:32:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:32:20,187 INFO L225 Difference]: With dead ends: 1635 [2018-11-10 07:32:20,187 INFO L226 Difference]: Without dead ends: 942 [2018-11-10 07:32:20,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:32:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2018-11-10 07:32:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 921. [2018-11-10 07:32:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-11-10 07:32:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1154 transitions. [2018-11-10 07:32:20,227 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1154 transitions. Word has length 62 [2018-11-10 07:32:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:32:20,227 INFO L481 AbstractCegarLoop]: Abstraction has 921 states and 1154 transitions. [2018-11-10 07:32:20,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:32:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1154 transitions. [2018-11-10 07:32:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 07:32:20,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:32:20,230 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:32:20,230 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:32:20,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1967395156, now seen corresponding path program 1 times [2018-11-10 07:32:20,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:32:20,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:20,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:32:20,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:32:20,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:32:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:32:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:32:20,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:32:20,314 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:32:20,315 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2018-11-10 07:32:20,316 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [42], [44], [45], [46], [47], [59], [90], [94], [100], [104], [108], [111], [116], [122], [124], [130], [133], [136], [146], [147], [150], [151], [175], [182], [185], [223], [247], [251], [252], [255], [256], [257], [258], [259], [261], [262], [263], [264], [265], [266], [267], [268], [269], [275], [285], [286], [291], [292], [293], [294], [303], [304], [309], [310], [311] [2018-11-10 07:32:20,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:32:20,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:32:30,300 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:32:30,301 INFO L272 AbstractInterpreter]: Visited 60 different actions 124 times. Merged at 14 different actions 21 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 133 variables. [2018-11-10 07:32:30,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:32:30,308 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:32:40,311 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 97.59% of their original sizes. [2018-11-10 07:32:40,311 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:32:40,899 INFO L415 sIntCurrentIteration]: We unified 90 AI predicates to 90 [2018-11-10 07:32:40,899 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:32:40,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:32:40,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [7] total 35 [2018-11-10 07:32:40,900 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:32:40,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 07:32:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 07:32:40,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2018-11-10 07:32:40,901 INFO L87 Difference]: Start difference. First operand 921 states and 1154 transitions. Second operand 30 states. [2018-11-10 07:33:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:00,849 INFO L93 Difference]: Finished difference Result 1954 states and 2484 transitions. [2018-11-10 07:33:00,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 07:33:00,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-10 07:33:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:00,855 INFO L225 Difference]: With dead ends: 1954 [2018-11-10 07:33:00,855 INFO L226 Difference]: Without dead ends: 1303 [2018-11-10 07:33:00,858 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=355, Invalid=2297, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 07:33:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2018-11-10 07:33:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1253. [2018-11-10 07:33:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2018-11-10 07:33:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1549 transitions. [2018-11-10 07:33:00,939 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1549 transitions. Word has length 91 [2018-11-10 07:33:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:00,940 INFO L481 AbstractCegarLoop]: Abstraction has 1253 states and 1549 transitions. [2018-11-10 07:33:00,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 07:33:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1549 transitions. [2018-11-10 07:33:00,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:33:00,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:33:00,944 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:00,944 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:33:00,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:00,944 INFO L82 PathProgramCache]: Analyzing trace with hash -14646701, now seen corresponding path program 1 times [2018-11-10 07:33:00,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:33:00,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:00,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:00,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:00,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:33:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:33:01,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:33:01,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:33:01,008 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:33:01,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:33:01,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:33:01,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:33:01,009 INFO L87 Difference]: Start difference. First operand 1253 states and 1549 transitions. Second operand 5 states. [2018-11-10 07:33:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:01,077 INFO L93 Difference]: Finished difference Result 2098 states and 2675 transitions. [2018-11-10 07:33:01,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:33:01,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-11-10 07:33:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:01,082 INFO L225 Difference]: With dead ends: 2098 [2018-11-10 07:33:01,082 INFO L226 Difference]: Without dead ends: 1285 [2018-11-10 07:33:01,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:33:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-11-10 07:33:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1267. [2018-11-10 07:33:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1267 states. [2018-11-10 07:33:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1561 transitions. [2018-11-10 07:33:01,156 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1561 transitions. Word has length 119 [2018-11-10 07:33:01,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:01,157 INFO L481 AbstractCegarLoop]: Abstraction has 1267 states and 1561 transitions. [2018-11-10 07:33:01,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:33:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1561 transitions. [2018-11-10 07:33:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:33:01,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:33:01,159 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:01,160 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:33:01,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:01,160 INFO L82 PathProgramCache]: Analyzing trace with hash -69039599, now seen corresponding path program 1 times [2018-11-10 07:33:01,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:33:01,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:01,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:01,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:33:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 07:33:01,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:33:01,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:33:01,220 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:33:01,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:33:01,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:33:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:33:01,220 INFO L87 Difference]: Start difference. First operand 1267 states and 1561 transitions. Second operand 5 states. [2018-11-10 07:33:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:33:01,903 INFO L93 Difference]: Finished difference Result 2584 states and 3326 transitions. [2018-11-10 07:33:01,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:33:01,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-11-10 07:33:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:33:01,909 INFO L225 Difference]: With dead ends: 2584 [2018-11-10 07:33:01,909 INFO L226 Difference]: Without dead ends: 1919 [2018-11-10 07:33:01,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:33:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2018-11-10 07:33:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1783. [2018-11-10 07:33:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2018-11-10 07:33:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2212 transitions. [2018-11-10 07:33:01,981 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2212 transitions. Word has length 119 [2018-11-10 07:33:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:33:01,981 INFO L481 AbstractCegarLoop]: Abstraction has 1783 states and 2212 transitions. [2018-11-10 07:33:01,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:33:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2212 transitions. [2018-11-10 07:33:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 07:33:01,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:33:01,985 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:33:01,985 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:33:01,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:01,985 INFO L82 PathProgramCache]: Analyzing trace with hash -466523160, now seen corresponding path program 1 times [2018-11-10 07:33:01,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:33:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:01,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:33:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:33:01,986 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:33:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:33:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 07:33:02,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:33:02,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:33:02,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-11-10 07:33:02,044 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [46], [47], [48], [50], [53], [57], [58], [59], [62], [63], [64], [67], [69], [70], [73], [75], [78], [85], [88], [90], [94], [100], [104], [108], [111], [114], [116], [122], [124], [130], [136], [144], [145], [146], [147], [148], [149], [150], [151], [152], [154], [157], [161], [162], [172], [175], [179], [185], [215], [219], [223], [224], [227], [229], [232], [242], [247], [251], [252], [255], [256], [257], [258], [259], [261], [262], [263], [264], [265], [266], [267], [268], [269], [273], [274], [275], [277], [278], [279], [280], [283], [284], [285], [286], [293], [294], [297], [298], [299], [300], [301], [302], [303], [304], [309], [310], [311], [313], [314], [315], [316] [2018-11-10 07:33:02,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:33:02,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:33:11,947 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:33:11,947 INFO L272 AbstractInterpreter]: Visited 64 different actions 94 times. Merged at 6 different actions 6 times. Never widened. Never found a fixpoint. Largest state had 133 variables. [2018-11-10 07:33:11,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:33:11,952 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:33:29,792 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 97.22% of their original sizes. [2018-11-10 07:33:29,792 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:33:30,316 INFO L415 sIntCurrentIteration]: We unified 135 AI predicates to 135 [2018-11-10 07:33:30,316 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:33:30,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:33:30,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [6] total 31 [2018-11-10 07:33:30,316 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:33:30,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 07:33:30,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 07:33:30,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2018-11-10 07:33:30,317 INFO L87 Difference]: Start difference. First operand 1783 states and 2212 transitions. Second operand 27 states. [2018-11-10 07:34:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:03,367 INFO L93 Difference]: Finished difference Result 3987 states and 5015 transitions. [2018-11-10 07:34:03,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 07:34:03,367 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 136 [2018-11-10 07:34:03,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:03,372 INFO L225 Difference]: With dead ends: 3987 [2018-11-10 07:34:03,372 INFO L226 Difference]: Without dead ends: 2228 [2018-11-10 07:34:03,374 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=336, Invalid=1826, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 07:34:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2018-11-10 07:34:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1995. [2018-11-10 07:34:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-11-10 07:34:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2456 transitions. [2018-11-10 07:34:03,467 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2456 transitions. Word has length 136 [2018-11-10 07:34:03,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:03,467 INFO L481 AbstractCegarLoop]: Abstraction has 1995 states and 2456 transitions. [2018-11-10 07:34:03,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 07:34:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2456 transitions. [2018-11-10 07:34:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 07:34:03,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:03,471 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:03,471 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:03,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1786910320, now seen corresponding path program 1 times [2018-11-10 07:34:03,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:34:03,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:03,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:03,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:03,473 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:34:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:34:03,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:34:03,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:34:03,523 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:34:03,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:34:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:34:03,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:34:03,524 INFO L87 Difference]: Start difference. First operand 1995 states and 2456 transitions. Second operand 4 states. [2018-11-10 07:34:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:03,689 INFO L93 Difference]: Finished difference Result 2877 states and 3530 transitions. [2018-11-10 07:34:03,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:34:03,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-11-10 07:34:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:03,692 INFO L225 Difference]: With dead ends: 2877 [2018-11-10 07:34:03,692 INFO L226 Difference]: Without dead ends: 906 [2018-11-10 07:34:03,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:34:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-10 07:34:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 820. [2018-11-10 07:34:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-11-10 07:34:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 971 transitions. [2018-11-10 07:34:03,745 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 971 transitions. Word has length 144 [2018-11-10 07:34:03,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:03,745 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 971 transitions. [2018-11-10 07:34:03,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:34:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 971 transitions. [2018-11-10 07:34:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 07:34:03,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:03,747 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:03,747 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:03,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash 38242999, now seen corresponding path program 1 times [2018-11-10 07:34:03,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:34:03,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:03,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:03,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:03,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:34:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 07:34:03,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:34:03,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:34:03,808 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:34:03,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:34:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:34:03,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:34:03,809 INFO L87 Difference]: Start difference. First operand 820 states and 971 transitions. Second operand 6 states. [2018-11-10 07:34:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:03,880 INFO L93 Difference]: Finished difference Result 1278 states and 1541 transitions. [2018-11-10 07:34:03,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:34:03,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-11-10 07:34:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:03,882 INFO L225 Difference]: With dead ends: 1278 [2018-11-10 07:34:03,882 INFO L226 Difference]: Without dead ends: 838 [2018-11-10 07:34:03,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:34:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-10 07:34:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-11-10 07:34:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 07:34:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 991 transitions. [2018-11-10 07:34:03,932 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 991 transitions. Word has length 136 [2018-11-10 07:34:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:03,932 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 991 transitions. [2018-11-10 07:34:03,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:34:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 991 transitions. [2018-11-10 07:34:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 07:34:03,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:03,933 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:03,934 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:03,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash -471230091, now seen corresponding path program 1 times [2018-11-10 07:34:03,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:34:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:03,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:03,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:03,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:34:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 07:34:03,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:34:03,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:34:03,989 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:34:03,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:34:03,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:34:03,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:34:03,990 INFO L87 Difference]: Start difference. First operand 838 states and 991 transitions. Second operand 6 states. [2018-11-10 07:34:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:04,139 INFO L93 Difference]: Finished difference Result 851 states and 1003 transitions. [2018-11-10 07:34:04,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:34:04,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-11-10 07:34:04,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:04,142 INFO L225 Difference]: With dead ends: 851 [2018-11-10 07:34:04,142 INFO L226 Difference]: Without dead ends: 848 [2018-11-10 07:34:04,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:34:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-11-10 07:34:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 838. [2018-11-10 07:34:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 07:34:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 988 transitions. [2018-11-10 07:34:04,192 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 988 transitions. Word has length 136 [2018-11-10 07:34:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:04,192 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 988 transitions. [2018-11-10 07:34:04,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:34:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 988 transitions. [2018-11-10 07:34:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 07:34:04,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:04,194 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:04,195 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:04,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash -869359616, now seen corresponding path program 1 times [2018-11-10 07:34:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:34:04,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:04,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:04,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:34:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:34:04,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:34:04,291 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:34:04,291 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-10 07:34:04,291 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [46], [47], [48], [50], [53], [57], [58], [59], [64], [68], [69], [70], [73], [75], [81], [85], [88], [89], [90], [94], [100], [104], [108], [111], [114], [116], [122], [124], [130], [136], [144], [145], [146], [147], [148], [149], [150], [151], [152], [154], [159], [161], [162], [172], [175], [179], [185], [215], [219], [223], [224], [227], [229], [232], [239], [242], [247], [251], [252], [255], [256], [257], [258], [259], [261], [262], [263], [264], [265], [266], [267], [268], [269], [273], [274], [275], [277], [278], [281], [282], [283], [284], [285], [286], [293], [294], [297], [298], [299], [300], [301], [302], [303], [304], [309], [310], [311], [313], [314], [315], [316], [319], [320] [2018-11-10 07:34:04,294 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:34:04,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:34:38,127 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:34:38,127 INFO L272 AbstractInterpreter]: Visited 98 different actions 334 times. Merged at 18 different actions 34 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 133 variables. [2018-11-10 07:34:38,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:38,130 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:34:56,619 INFO L227 lantSequenceWeakener]: Weakened 118 states. On average, predicates are now at 97.37% of their original sizes. [2018-11-10 07:34:56,620 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:34:57,986 INFO L415 sIntCurrentIteration]: We unified 139 AI predicates to 139 [2018-11-10 07:34:57,986 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:34:57,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:34:57,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [10] total 52 [2018-11-10 07:34:57,987 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:34:57,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-10 07:34:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-10 07:34:57,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 07:34:57,988 INFO L87 Difference]: Start difference. First operand 838 states and 988 transitions. Second operand 44 states. [2018-11-10 07:35:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:35:52,843 INFO L93 Difference]: Finished difference Result 2496 states and 3232 transitions. [2018-11-10 07:35:52,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-10 07:35:52,843 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 140 [2018-11-10 07:35:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:35:52,847 INFO L225 Difference]: With dead ends: 2496 [2018-11-10 07:35:52,847 INFO L226 Difference]: Without dead ends: 1784 [2018-11-10 07:35:52,850 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=771, Invalid=6201, Unknown=0, NotChecked=0, Total=6972 [2018-11-10 07:35:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2018-11-10 07:35:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1389. [2018-11-10 07:35:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2018-11-10 07:35:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1627 transitions. [2018-11-10 07:35:53,041 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1627 transitions. Word has length 140 [2018-11-10 07:35:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:35:53,041 INFO L481 AbstractCegarLoop]: Abstraction has 1389 states and 1627 transitions. [2018-11-10 07:35:53,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-10 07:35:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1627 transitions. [2018-11-10 07:35:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 07:35:53,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:35:53,043 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:35:53,043 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:35:53,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash -594600002, now seen corresponding path program 1 times [2018-11-10 07:35:53,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:35:53,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:53,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:35:53,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:53,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:35:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:35:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 07:35:53,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:35:53,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 07:35:53,157 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:35:53,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 07:35:53,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:35:53,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:35:53,158 INFO L87 Difference]: Start difference. First operand 1389 states and 1627 transitions. Second operand 9 states. [2018-11-10 07:35:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:35:53,372 INFO L93 Difference]: Finished difference Result 2216 states and 2648 transitions. [2018-11-10 07:35:53,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:35:53,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-11-10 07:35:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:35:53,375 INFO L225 Difference]: With dead ends: 2216 [2018-11-10 07:35:53,375 INFO L226 Difference]: Without dead ends: 1363 [2018-11-10 07:35:53,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:35:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-11-10 07:35:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2018-11-10 07:35:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2018-11-10 07:35:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1596 transitions. [2018-11-10 07:35:53,484 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1596 transitions. Word has length 140 [2018-11-10 07:35:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:35:53,484 INFO L481 AbstractCegarLoop]: Abstraction has 1363 states and 1596 transitions. [2018-11-10 07:35:53,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 07:35:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1596 transitions. [2018-11-10 07:35:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 07:35:53,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:35:53,487 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:35:53,487 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:35:53,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1144218422, now seen corresponding path program 1 times [2018-11-10 07:35:53,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:35:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:53,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:35:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:53,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:35:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:35:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 07:35:53,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:35:53,592 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:35:53,593 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-11-10 07:35:53,594 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [42], [44], [45], [46], [47], [48], [50], [53], [57], [58], [59], [64], [68], [69], [70], [73], [75], [81], [85], [88], [89], [90], [94], [100], [104], [108], [111], [114], [116], [122], [124], [127], [130], [133], [136], [144], [145], [146], [147], [148], [149], [150], [151], [152], [154], [159], [161], [162], [172], [175], [179], [182], [185], [215], [219], [223], [224], [227], [229], [232], [239], [242], [243], [244], [247], [251], [252], [255], [256], [257], [258], [259], [261], [262], [263], [264], [265], [266], [267], [268], [269], [273], [274], [275], [277], [278], [281], [282], [283], [284], [285], [286], [289], [290], [291], [292], [293], [294], [297], [298], [299], [300], [301], [302], [303], [304], [309], [310], [311], [313], [314], [315], [316], [319], [320] [2018-11-10 07:35:53,597 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:35:53,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:37:25,554 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:37:25,554 INFO L272 AbstractInterpreter]: Visited 110 different actions 1052 times. Merged at 22 different actions 151 times. Widened at 1 different actions 2 times. Found 40 fixpoints after 7 different actions. Largest state had 133 variables. [2018-11-10 07:37:25,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:37:25,556 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:37:47,542 INFO L227 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 97.65% of their original sizes. [2018-11-10 07:37:47,542 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:37:48,881 INFO L415 sIntCurrentIteration]: We unified 172 AI predicates to 172 [2018-11-10 07:37:48,881 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:37:48,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:37:48,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [10] total 60 [2018-11-10 07:37:48,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:37:48,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-10 07:37:48,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-10 07:37:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2431, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 07:37:48,883 INFO L87 Difference]: Start difference. First operand 1363 states and 1596 transitions. Second operand 52 states. [2018-11-10 07:38:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:38:57,184 INFO L93 Difference]: Finished difference Result 3218 states and 4124 transitions. [2018-11-10 07:38:57,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-10 07:38:57,185 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 173 [2018-11-10 07:38:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:38:57,189 INFO L225 Difference]: With dead ends: 3218 [2018-11-10 07:38:57,189 INFO L226 Difference]: Without dead ends: 2137 [2018-11-10 07:38:57,192 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 235 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4226 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1239, Invalid=11871, Unknown=0, NotChecked=0, Total=13110 [2018-11-10 07:38:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-11-10 07:38:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 951. [2018-11-10 07:38:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-11-10 07:38:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1109 transitions. [2018-11-10 07:38:57,337 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1109 transitions. Word has length 173 [2018-11-10 07:38:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:38:57,338 INFO L481 AbstractCegarLoop]: Abstraction has 951 states and 1109 transitions. [2018-11-10 07:38:57,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-10 07:38:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1109 transitions. [2018-11-10 07:38:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 07:38:57,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:38:57,340 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:38:57,341 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:38:57,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:38:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash 992096389, now seen corresponding path program 1 times [2018-11-10 07:38:57,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:38:57,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:38:57,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:38:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:38:57,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:38:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:38:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-10 07:38:57,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:38:57,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:38:57,411 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:38:57,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:38:57,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:38:57,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:38:57,412 INFO L87 Difference]: Start difference. First operand 951 states and 1109 transitions. Second operand 6 states. [2018-11-10 07:38:57,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:38:57,522 INFO L93 Difference]: Finished difference Result 1739 states and 2056 transitions. [2018-11-10 07:38:57,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:38:57,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 189 [2018-11-10 07:38:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:38:57,526 INFO L225 Difference]: With dead ends: 1739 [2018-11-10 07:38:57,527 INFO L226 Difference]: Without dead ends: 961 [2018-11-10 07:38:57,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:38:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-11-10 07:38:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2018-11-10 07:38:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2018-11-10 07:38:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1120 transitions. [2018-11-10 07:38:57,658 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1120 transitions. Word has length 189 [2018-11-10 07:38:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:38:57,658 INFO L481 AbstractCegarLoop]: Abstraction has 961 states and 1120 transitions. [2018-11-10 07:38:57,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:38:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1120 transitions. [2018-11-10 07:38:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 07:38:57,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:38:57,660 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:38:57,660 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:38:57,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:38:57,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1014728643, now seen corresponding path program 1 times [2018-11-10 07:38:57,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:38:57,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:38:57,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:38:57,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:38:57,661 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:38:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:38:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 07:38:57,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:38:57,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:38:57,734 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:38:57,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:38:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:38:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:38:57,735 INFO L87 Difference]: Start difference. First operand 961 states and 1120 transitions. Second operand 8 states. [2018-11-10 07:38:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:38:57,836 INFO L93 Difference]: Finished difference Result 1226 states and 1418 transitions. [2018-11-10 07:38:57,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:38:57,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 189 [2018-11-10 07:38:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:38:57,837 INFO L225 Difference]: With dead ends: 1226 [2018-11-10 07:38:57,837 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:38:57,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:38:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:38:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:38:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:38:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:38:57,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2018-11-10 07:38:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:38:57,840 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:38:57,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:38:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:38:57,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:38:57,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:38:57,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:38:57,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:38:57,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:38:58,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:38:58,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:38:58,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,522 WARN L179 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 471 DAG size of output: 429 [2018-11-10 07:39:00,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:00,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,268 WARN L179 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 272 [2018-11-10 07:39:01,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:01,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:03,710 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 465 DAG size of output: 425 [2018-11-10 07:39:03,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:03,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:03,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:03,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:03,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,516 WARN L179 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 344 [2018-11-10 07:39:04,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:04,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:06,258 WARN L179 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 450 DAG size of output: 411 [2018-11-10 07:39:06,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:06,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:06,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:06,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:08,125 WARN L179 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 468 DAG size of output: 420 [2018-11-10 07:39:08,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:08,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:08,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:08,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:39:08,676 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 33 [2018-11-10 07:39:08,958 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 36 [2018-11-10 07:39:09,230 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 44 [2018-11-10 07:39:09,544 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 34 [2018-11-10 07:39:12,280 WARN L179 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 500 DAG size of output: 96 [2018-11-10 07:39:12,492 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 36 [2018-11-10 07:39:13,048 WARN L179 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 72 [2018-11-10 07:39:13,720 WARN L179 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 66 [2018-11-10 07:39:14,152 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 49 [2018-11-10 07:39:15,053 WARN L179 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 339 DAG size of output: 86 [2018-11-10 07:39:15,704 WARN L179 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 74 [2018-11-10 07:39:16,117 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 30 [2018-11-10 07:39:16,436 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 54 [2018-11-10 07:39:16,670 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 25 [2018-11-10 07:39:17,057 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 25 [2018-11-10 07:39:19,004 WARN L179 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 493 DAG size of output: 81 [2018-11-10 07:39:19,127 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 22 [2018-11-10 07:39:20,098 WARN L179 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 413 DAG size of output: 79 [2018-11-10 07:39:20,460 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 56 [2018-11-10 07:39:20,874 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 32 [2018-11-10 07:39:21,560 WARN L179 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 70 [2018-11-10 07:39:23,943 WARN L179 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 480 DAG size of output: 110 [2018-11-10 07:39:26,478 WARN L179 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 487 DAG size of output: 69 [2018-11-10 07:39:26,664 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 29 [2018-11-10 07:39:26,853 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 22 [2018-11-10 07:39:27,020 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 39 [2018-11-10 07:39:27,221 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 44 [2018-11-10 07:39:27,942 WARN L179 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 335 DAG size of output: 75 [2018-11-10 07:39:28,024 INFO L428 ceAbstractionStarter]: At program point select_helpersFINAL(lines 932 938) the Hoare annotation is: true [2018-11-10 07:39:28,024 INFO L425 ceAbstractionStarter]: For program point select_helpersEXIT(lines 932 938) no Hoare annotation was computed. [2018-11-10 07:39:28,024 INFO L425 ceAbstractionStarter]: For program point valid_productEXIT(lines 939 947) no Hoare annotation was computed. [2018-11-10 07:39:28,024 INFO L428 ceAbstractionStarter]: At program point valid_productENTRY(lines 939 947) the Hoare annotation is: true [2018-11-10 07:39:28,024 INFO L425 ceAbstractionStarter]: For program point valid_productFINAL(lines 939 947) no Hoare annotation was computed. [2018-11-10 07:39:28,024 INFO L428 ceAbstractionStarter]: At program point __utac_acc__Specification4_spec__1ENTRY(lines 958 982) the Hoare annotation is: true [2018-11-10 07:39:28,024 INFO L425 ceAbstractionStarter]: For program point __utac_acc__Specification4_spec__1EXIT(lines 958 982) no Hoare annotation was computed. [2018-11-10 07:39:28,024 INFO L421 ceAbstractionStarter]: At program point L972(line 972) the Hoare annotation is: (let ((.cse1 (+ ~systemActive~0 ~waterLevel~0)) (.cse0 (+ ~pumpRunning~0 ~systemActive~0)) (.cse2 (* 2 ~pumpRunning~0))) (and (or (not (= ~systemActive~0 0)) (< ~pumpRunning~0 ~systemActive~0) (< 0 .cse0) (< .cse1 1) (< (+ ~pumpRunning~0 2) ~waterLevel~0)) (or (< 3 (+ ~pumpRunning~0 ~waterLevel~0)) (< .cse1 3) (< .cse2 2) (< 2 .cse0)) (or (< (+ ~pumpRunning~0 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) (< 0 .cse2)))) [2018-11-10 07:39:28,024 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 976) no Hoare annotation was computed. [2018-11-10 07:39:28,024 INFO L421 ceAbstractionStarter]: At program point L968(line 968) the Hoare annotation is: (let ((.cse1 (+ ~systemActive~0 ~waterLevel~0)) (.cse0 (+ ~pumpRunning~0 ~systemActive~0)) (.cse2 (* 2 ~pumpRunning~0))) (and (or (not (= ~systemActive~0 0)) (< ~pumpRunning~0 ~systemActive~0) (< 0 .cse0) (< .cse1 1) (< (+ ~pumpRunning~0 2) ~waterLevel~0)) (or (< 3 (+ ~pumpRunning~0 ~waterLevel~0)) (< .cse1 3) (< .cse2 2) (< 2 .cse0)) (or (< (+ ~pumpRunning~0 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) (< 0 .cse2)))) [2018-11-10 07:39:28,024 INFO L425 ceAbstractionStarter]: For program point L968-1(line 968) no Hoare annotation was computed. [2018-11-10 07:39:28,025 INFO L425 ceAbstractionStarter]: For program point L966(lines 966 979) no Hoare annotation was computed. [2018-11-10 07:39:28,025 INFO L425 ceAbstractionStarter]: For program point L966-1(lines 958 982) no Hoare annotation was computed. [2018-11-10 07:39:28,025 INFO L428 ceAbstractionStarter]: At program point L964(line 964) the Hoare annotation is: true [2018-11-10 07:39:28,025 INFO L425 ceAbstractionStarter]: For program point L964-1(line 964) no Hoare annotation was computed. [2018-11-10 07:39:28,025 INFO L421 ceAbstractionStarter]: At program point L897(line 897) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 07:39:28,025 INFO L421 ceAbstractionStarter]: At program point L896(line 896) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 07:39:28,025 INFO L421 ceAbstractionStarter]: At program point L896-1(line 896) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 07:39:28,025 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 890 912) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 07:39:28,025 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 890 912) no Hoare annotation was computed. [2018-11-10 07:39:28,025 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 890 912) no Hoare annotation was computed. [2018-11-10 07:39:28,025 INFO L421 ceAbstractionStarter]: At program point L902(line 902) the Hoare annotation is: (or (and (<= (+ ~systemActive~0 main_~tmp~8) 2) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0) (<= 1 (+ ~pumpRunning~0 main_~tmp~8))) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 07:39:28,026 INFO L421 ceAbstractionStarter]: At program point L902-1(line 902) the Hoare annotation is: (or (and (<= (+ ~systemActive~0 main_~tmp~8) 2) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0) (<= 1 (+ ~pumpRunning~0 main_~tmp~8))) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point L900(lines 900 907) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point L900-1(lines 900 907) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point L898(line 898) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point stopSystemEXIT(lines 355 369) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L421 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse4 (* 2 |old(~pumpRunning~0)|))) (let ((.cse2 (+ |old(~pumpRunning~0)| ~waterLevel~0)) (.cse0 (< 0 .cse4)) (.cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))) (and (or (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (< ~waterLevel~0 |old(~systemActive~0)|) .cse0 .cse1) (or (let ((.cse3 (+ ~waterLevel~0 |old(~systemActive~0)|))) (or (< 3 .cse2) (< .cse3 3) (< .cse4 2) (< 3 .cse3) (< ~waterLevel~0 2))) (and (<= (+ ~systemActive~0 ~waterLevel~0) 3) (= ~pumpRunning~0 1) (<= ~pumpRunning~0 ~systemActive~0))) (or (< .cse2 1) (not (= |old(~systemActive~0)| 0)) .cse0 .cse1)))) [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L421 ceAbstractionStarter]: At program point stopSystemENTRY(lines 355 369) the Hoare annotation is: (let ((.cse3 (* 2 |old(~pumpRunning~0)|)) (.cse7 (+ ~waterLevel~0 |old(~systemActive~0)|)) (.cse14 (+ ~systemActive~0 ~waterLevel~0))) (let ((.cse10 (<= .cse14 3)) (.cse4 (not (= |old(~systemActive~0)| 0))) (.cse0 (< (* 2 |old(~systemActive~0)|) 2)) (.cse9 (< ~waterLevel~0 2)) (.cse8 (< 3 .cse7)) (.cse2 (< 0 .cse3)) (.cse6 (= ~pumpRunning~0 0)) (.cse11 (<= ~pumpRunning~0 ~systemActive~0))) (and (let ((.cse5 (+ ~pumpRunning~0 ~systemActive~0))) (or (let ((.cse1 (not (= ~waterLevel~0 1)))) (and (or (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) .cse0 .cse1 .cse2) (or (< .cse3 0) .cse4 .cse1 .cse2))) (and (<= 0 .cse5) (<= ~systemActive~0 ~pumpRunning~0) .cse6) (and (<= ~systemActive~0 ~waterLevel~0) (<= 1 .cse5) .cse6))) (or (or (< 3 (+ |old(~pumpRunning~0)| ~waterLevel~0)) (< .cse7 3) (< .cse3 2) .cse8 .cse9) (and .cse10 (= ~pumpRunning~0 1) .cse11)) (or (and .cse10 (<= (+ ~pumpRunning~0 1) ~systemActive~0) .cse6) (let ((.cse12 (+ |old(~pumpRunning~0)| 2))) (let ((.cse13 (< .cse12 ~waterLevel~0))) (and (or .cse4 (< ~waterLevel~0 .cse12) (< |old(~pumpRunning~0)| |old(~systemActive~0)|) (< 0 (+ |old(~pumpRunning~0)| |old(~systemActive~0)|)) .cse13) (or .cse0 .cse9 .cse8 .cse2 .cse13)))) (and (<= .cse14 2) .cse6 .cse11))))) [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point stopSystemFINAL(lines 355 369) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point isPumpRunningEXIT(lines 272 280) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L428 ceAbstractionStarter]: At program point isPumpRunningENTRY(lines 272 280) the Hoare annotation is: true [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point isPumpRunningFINAL(lines 272 280) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L428 ceAbstractionStarter]: At program point isLowWaterLevelENTRY(lines 336 354) the Hoare annotation is: true [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L428 ceAbstractionStarter]: At program point L343(line 343) the Hoare annotation is: true [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point L343-1(line 343) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point isLowWaterLevelEXIT(lines 336 354) no Hoare annotation was computed. [2018-11-10 07:39:28,026 INFO L425 ceAbstractionStarter]: For program point isLowWaterLevelFINAL(lines 336 354) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point select_featuresEXIT(lines 925 931) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L428 ceAbstractionStarter]: At program point select_featuresFINAL(lines 925 931) the Hoare annotation is: true [2018-11-10 07:39:28,027 INFO L421 ceAbstractionStarter]: At program point runTestENTRY(lines 877 886) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point runTestEXIT(lines 877 886) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point runTestFINAL(lines 877 886) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L421 ceAbstractionStarter]: At program point deactivatePumpENTRY(lines 253 260) the Hoare annotation is: (and (or (let ((.cse0 (+ ~systemActive~0 ~waterLevel~0))) (or (< 3 (+ |old(~pumpRunning~0)| ~waterLevel~0)) (< .cse0 3) (< (* 2 |old(~pumpRunning~0)|) 2) (< 3 .cse0) (< ~waterLevel~0 2))) (= ~pumpRunning~0 1)) (or (and (<= 2 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~pumpRunning~0 ~systemActive~0)) (< (* 2 ~systemActive~0) 2) (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0)))) [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point deactivatePumpEXIT(lines 253 260) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point deactivatePumpFINAL(lines 253 260) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point isHighWaterSensorDryEXIT(lines 127 140) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 137) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L428 ceAbstractionStarter]: At program point isHighWaterSensorDryENTRY(lines 127 140) the Hoare annotation is: true [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point isHighWaterSensorDryFINAL(lines 127 140) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point L226-1(line 226) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 241) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point processEnvironmentEXIT(lines 220 244) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L421 ceAbstractionStarter]: At program point processEnvironmentENTRY(lines 220 244) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< ~waterLevel~0 ~systemActive~0))) (and (or (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 .cse1) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) (= ~pumpRunning~0 0)) (or (and (<= 2 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~pumpRunning~0 ~systemActive~0)) .cse0 .cse1 (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))))) [2018-11-10 07:39:28,027 INFO L421 ceAbstractionStarter]: At program point L239(line 239) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< ~waterLevel~0 ~systemActive~0))) (and (or (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 .cse1) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) (= ~pumpRunning~0 0)) (or .cse0 .cse1 (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))))) [2018-11-10 07:39:28,027 INFO L425 ceAbstractionStarter]: For program point L239-1(lines 220 244) no Hoare annotation was computed. [2018-11-10 07:39:28,027 INFO L421 ceAbstractionStarter]: At program point L234(line 234) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< ~waterLevel~0 ~systemActive~0))) (and (or .cse0 .cse1 (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 .cse1) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-11-10 07:39:28,028 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< ~waterLevel~0 ~systemActive~0))) (and (or .cse0 (and (= processEnvironment_~tmp~1 1) (<= 2 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~pumpRunning~0 ~systemActive~0)) .cse1 (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 .cse1) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-11-10 07:39:28,028 INFO L425 ceAbstractionStarter]: For program point L228(lines 228 236) no Hoare annotation was computed. [2018-11-10 07:39:28,028 INFO L421 ceAbstractionStarter]: At program point L226(line 226) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< ~waterLevel~0 ~systemActive~0))) (and (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 .cse1) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) (or (and (<= 2 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~pumpRunning~0 ~systemActive~0)) .cse0 .cse1 (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))))) [2018-11-10 07:39:28,028 INFO L425 ceAbstractionStarter]: For program point processEnvironment__wrappee__baseEXIT(lines 186 192) no Hoare annotation was computed. [2018-11-10 07:39:28,028 INFO L428 ceAbstractionStarter]: At program point processEnvironment__wrappee__baseFINAL(lines 186 192) the Hoare annotation is: true [2018-11-10 07:39:28,028 INFO L421 ceAbstractionStarter]: At program point testENTRY(lines 380 447) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 07:39:28,028 INFO L421 ceAbstractionStarter]: At program point L440(lines 389 441) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 07:39:28,028 INFO L425 ceAbstractionStarter]: For program point testFINAL(lines 380 447) no Hoare annotation was computed. [2018-11-10 07:39:28,028 INFO L421 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse0 (+ ~waterLevel~0 2147483646)) (.cse22 (* 2 test_~tmp___0~2)) (.cse15 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse14 (+ ~pumpRunning~0 ~systemActive~0)) (.cse19 (+ ~systemActive~0 ~waterLevel~0))) (let ((.cse1 (<= 2 .cse19)) (.cse3 (<= .cse14 1)) (.cse9 (* 2 ~pumpRunning~0)) (.cse11 (<= 2 .cse15)) (.cse12 (<= (+ ~waterLevel~0 test_~splverifierCounter~0) 2)) (.cse13 (<= 0 (+ ~pumpRunning~0 test_~tmp___1~0 2147483648))) (.cse2 (<= 0 (+ test_~tmp~4 test_~splverifierCounter~0 2147483648))) (.cse4 (<= 0 (* 2 test_~splverifierCounter~0))) (.cse6 (<= (* 2 test_~tmp~4) 4294967294)) (.cse16 (<= (+ ~waterLevel~0 test_~tmp___1~0) 2147483649)) (.cse18 (= test_~splverifierCounter~0 0)) (.cse20 (<= test_~tmp___2~0 (+ ~systemActive~0 2147483647))) (.cse21 (<= .cse14 0)) (.cse5 (<= .cse22 4294967294)) (.cse7 (<= test_~tmp___1~0 .cse0)) (.cse8 (<= 0 (+ ~waterLevel~0 test_~tmp___1~0 2147483647))) (.cse17 (<= 0 (+ .cse22 4294967296))) (.cse10 (<= 0 (+ ~pumpRunning~0 test_~tmp___2~0 2147483648)))) (or (and (<= (+ ~systemActive~0 test_~splverifierCounter~0) 1) (<= test_~tmp___2~0 .cse0) (= ~waterLevel~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 0 (+ ~waterLevel~0 test_~tmp___0~2 2147483647)) (<= 0 .cse9) .cse10) (and (<= test_~tmp___2~0 (+ test_~splverifierCounter~0 2147483647)) .cse11 .cse12 (<= ~systemActive~0 (+ test_~tmp___0~2 2147483649)) .cse13 .cse1 .cse2 .cse3 .cse4 (<= 1 .cse14) .cse5 .cse6 (<= .cse15 2) .cse16 .cse10) (< 1 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) (and (<= ~pumpRunning~0 (+ test_~tmp___1~0 2147483649)) (= ~systemActive~0 1) (<= .cse9 2) (<= ~waterLevel~0 (+ test_~tmp___2~0 2147483650)) (<= .cse15 3) (<= 3 .cse15) (<= (+ ~waterLevel~0 test_~tmp___2~0) 2147483649) .cse5 (<= 2 .cse14) .cse16 .cse17 .cse18) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (< |old(~waterLevel~0)| |old(~systemActive~0)|) (and (<= ~waterLevel~0 (+ test_~tmp___0~2 2147483650)) .cse11 .cse12 .cse13 (<= 1 .cse19) .cse2 .cse20 .cse21 .cse4 .cse5 .cse6 (<= ~waterLevel~0 (+ ~systemActive~0 2)) .cse16 .cse10) (and .cse18 (<= 0 (+ ~systemActive~0 test_~tmp~4 2147483648)) .cse20 .cse21 (<= (* 2 ~waterLevel~0) 2) (<= 0 .cse14) .cse5 .cse7 .cse8 (<= 1 .cse15) (<= test_~tmp~4 (+ ~pumpRunning~0 2147483647)) .cse17 (= ~pumpRunning~0 0) .cse10)))) [2018-11-10 07:39:28,028 INFO L425 ceAbstractionStarter]: For program point L428(lines 428 434) no Hoare annotation was computed. [2018-11-10 07:39:28,028 INFO L421 ceAbstractionStarter]: At program point L428-1(lines 420 435) the Hoare annotation is: (let ((.cse8 (* 2 test_~tmp___0~2)) (.cse11 (+ ~pumpRunning~0 1)) (.cse12 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse5 (+ ~pumpRunning~0 ~systemActive~0))) (let ((.cse6 (<= 0 .cse5)) (.cse7 (<= 1 .cse12)) (.cse0 (<= .cse11 ~waterLevel~0)) (.cse1 (<= ~systemActive~0 ~waterLevel~0)) (.cse10 (<= ~waterLevel~0 .cse11)) (.cse2 (<= 0 (+ ~systemActive~0 test_~tmp___0~2 2147483647))) (.cse3 (= test_~splverifierCounter~0 0)) (.cse4 (<= .cse8 4294967294)) (.cse9 (= ~pumpRunning~0 0))) (or (and (and (and (<= 0 (+ ~systemActive~0 test_~tmp___2~0 2147483647)) (<= test_~tmp___2~0 (+ ~systemActive~0 2147483646))) (and .cse0 .cse1 (<= 2 (* 2 ~systemActive~0)) (<= (+ ~systemActive~0 ~waterLevel~0) 3) .cse2) .cse3) .cse4 (<= 2 .cse5)) (and (<= 0 (+ ~pumpRunning~0 test_~tmp___1~0 2147483648)) (<= .cse5 0) (<= (+ ~waterLevel~0 test_~tmp___2~0) 2147483649) .cse6 .cse4 .cse7 (<= ~waterLevel~0 (+ ~systemActive~0 2)) (<= (+ ~waterLevel~0 test_~tmp___1~0) 2147483649) (<= 0 (+ .cse8 4294967296)) .cse9 (<= 0 (+ ~pumpRunning~0 test_~tmp___2~0 2147483648)) .cse3) (and .cse10 .cse6 (<= ~systemActive~0 ~pumpRunning~0) .cse7 .cse9 .cse3) (< 1 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (< |old(~waterLevel~0)| |old(~systemActive~0)|) (and (and (or (and (<= .cse5 1) (<= .cse11 ~systemActive~0) (<= .cse12 2) (<= 0 (+ ~waterLevel~0 test_~tmp___0~2 2147483646)) (<= 2 .cse12)) (and .cse0 (<= ~pumpRunning~0 ~systemActive~0) .cse1 .cse10 .cse2)) (<= test_~splverifierCounter~0 (+ test_~tmp~4 2147483648)) .cse3) .cse4 (<= test_~tmp___2~0 (+ test_~splverifierCounter~0 2147483647)) (<= test_~tmp~4 (+ ~pumpRunning~0 2147483647)) .cse9 (<= 0 (+ test_~splverifierCounter~0 test_~tmp___2~0 2147483648)))))) [2018-11-10 07:39:28,029 INFO L425 ceAbstractionStarter]: For program point L391(lines 390 439) no Hoare annotation was computed. [2018-11-10 07:39:28,029 INFO L421 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse1 (= test_~splverifierCounter~0 0))) (or (let ((.cse0 (+ ~systemActive~0 2147483646))) (and (and (<= 0 (+ ~systemActive~0 test_~tmp___2~0 2147483647)) (<= test_~tmp___2~0 .cse0)) (= ~pumpRunning~0 1) (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) (<= 2 (* 2 ~systemActive~0)) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (<= 0 (+ ~systemActive~0 test_~tmp___0~2 2147483647)) (<= test_~tmp___0~2 .cse0)) .cse1)) (< 1 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (< |old(~waterLevel~0)| |old(~systemActive~0)|) (let ((.cse3 (+ ~pumpRunning~0 ~systemActive~0)) (.cse5 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse2 (+ ~pumpRunning~0 2147483647)) (.cse4 (* 2 test_~tmp___0~2))) (and (<= 0 (+ (* 2 test_~tmp~4) 4294967296)) (<= test_~tmp___2~0 .cse2) (<= .cse3 1) (<= 0 .cse3) (<= .cse4 4294967294) (<= .cse5 2) (<= 1 .cse5) (<= test_~tmp~4 .cse2) (<= 0 (+ .cse4 4294967296)) (= ~pumpRunning~0 0) (<= 0 (+ ~pumpRunning~0 test_~tmp___2~0 2147483648)) .cse1)))) [2018-11-10 07:39:28,029 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 435) no Hoare annotation was computed. [2018-11-10 07:39:28,029 INFO L421 ceAbstractionStarter]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (+ ~pumpRunning~0 ~systemActive~0)) (.cse7 (* 2 test_~tmp___0~2))) (let ((.cse4 (<= 0 (+ .cse7 4294967296))) (.cse3 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse5 (= ~pumpRunning~0 0)) (.cse1 (<= 0 .cse0)) (.cse2 (<= .cse7 4294967294)) (.cse6 (= test_~splverifierCounter~0 0))) (or (and (<= 0 (+ ~systemActive~0 test_~tmp~4 2147483648)) (<= .cse0 0) .cse1 .cse2 (<= 1 .cse3) (<= ~waterLevel~0 (+ ~systemActive~0 2)) (<= test_~tmp~4 (+ ~pumpRunning~0 2147483647)) .cse4 .cse5 .cse6) (and (<= 3 .cse3) (<= (+ ~systemActive~0 test_~tmp___0~2) 2147483648) (<= 2 .cse0) .cse4 (<= (+ ~systemActive~0 ~waterLevel~0) 3) (= ~pumpRunning~0 1) .cse6) (and (and (and (<= 0 (+ ~systemActive~0 test_~tmp___0~2 2147483647)) (<= test_~tmp___0~2 (+ ~systemActive~0 2147483646))) (<= 2 .cse3) (= ~systemActive~0 1)) (<= .cse3 2) (<= test_~splverifierCounter~0 (+ test_~tmp~4 2147483648)) .cse5 (<= (+ ~systemActive~0 test_~tmp~4) 2147483648) .cse6) (and (and (and (= ~waterLevel~0 |old(~waterLevel~0)|) (<= ~systemActive~0 ~waterLevel~0)) (<= 0 (+ ~systemActive~0 test_~tmp~4 2147483647)) .cse5) .cse1 .cse2 (<= (* 2 test_~tmp~4) 4294967294) (<= 0 (+ test_~splverifierCounter~0 test_~tmp___0~2 2147483648)) .cse6) (< 1 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (< |old(~waterLevel~0)| |old(~systemActive~0)|)))) [2018-11-10 07:39:28,029 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2018-11-10 07:39:28,029 INFO L425 ceAbstractionStarter]: For program point L410-1(lines 410 416) no Hoare annotation was computed. [2018-11-10 07:39:28,030 INFO L421 ceAbstractionStarter]: At program point L437(lines 390 439) the Hoare annotation is: (let ((.cse8 (* 2 test_~tmp___0~2)) (.cse0 (+ ~pumpRunning~0 1))) (let ((.cse1 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse6 (<= ~waterLevel~0 .cse0)) (.cse3 (+ ~pumpRunning~0 ~systemActive~0)) (.cse2 (<= .cse8 4294967294)) (.cse4 (<= 0 (+ .cse8 4294967296))) (.cse7 (= ~pumpRunning~0 0)) (.cse5 (= test_~splverifierCounter~0 0))) (or (and (and (<= .cse0 ~waterLevel~0) (= ~systemActive~0 1)) (<= .cse1 3) .cse2 (<= (* 2 test_~tmp~4) 4294967294) (<= test_~tmp___2~0 (+ test_~splverifierCounter~0 2147483647)) (<= 2 .cse3) .cse4 (<= test_~splverifierCounter~0 (+ test_~tmp~4 2147483648)) (<= 0 (+ test_~splverifierCounter~0 test_~tmp___2~0 2147483648)) .cse5) (and .cse6 (<= 0 .cse3) (<= ~systemActive~0 ~pumpRunning~0) (<= 1 .cse1) .cse7 .cse5) (and (<= ~systemActive~0 ~waterLevel~0) (<= 2 (* 2 ~systemActive~0)) .cse6 (<= .cse3 1) .cse5) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (and (<= 0 (+ ~pumpRunning~0 test_~tmp___1~0 2147483648)) (<= 1 (+ ~systemActive~0 ~waterLevel~0)) (<= .cse3 0) (<= (+ ~waterLevel~0 test_~tmp___2~0) 2147483649) .cse2 (<= ~waterLevel~0 (+ ~systemActive~0 2)) (<= (+ ~waterLevel~0 test_~tmp___1~0) 2147483649) .cse4 .cse7 (<= 0 (+ ~pumpRunning~0 test_~tmp___2~0 2147483648)) .cse5) (< 0 (* 2 |old(~pumpRunning~0)|))))) [2018-11-10 07:39:28,030 INFO L421 ceAbstractionStarter]: At program point L402(line 402) the Hoare annotation is: (let ((.cse0 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse9 (* 2 test_~tmp___0~2)) (.cse2 (+ ~pumpRunning~0 ~systemActive~0))) (let ((.cse5 (<= 0 (+ ~systemActive~0 test_~tmp~4 2147483648))) (.cse4 (<= 0 .cse2)) (.cse1 (<= .cse9 4294967294)) (.cse6 (<= 1 .cse0)) (.cse7 (<= test_~tmp~4 (+ ~pumpRunning~0 2147483647))) (.cse8 (= ~pumpRunning~0 0)) (.cse3 (= test_~splverifierCounter~0 0))) (or (and (<= (+ ~pumpRunning~0 test_~tmp___2~0) 2147483648) (<= ~systemActive~0 (+ test_~tmp___0~2 2147483649)) (<= 2 ~waterLevel~0) (= ~systemActive~0 1) (<= 0 (+ test_~tmp~4 test_~splverifierCounter~0 2147483648)) (<= ~waterLevel~0 (+ test_~tmp___2~0 2147483650)) (<= .cse0 3) .cse1 (<= (* 2 test_~tmp~4) 4294967294) (<= 2 .cse2) .cse3) (and (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) .cse4 .cse5 (<= ~systemActive~0 ~pumpRunning~0) .cse6 .cse7 .cse8 .cse3) (and .cse5 (<= 0 (+ ~pumpRunning~0 test_~tmp___1~0 2147483648)) (<= 2 (* 2 ~waterLevel~0)) (<= .cse2 0) (<= (+ ~waterLevel~0 test_~tmp___2~0) 2147483649) .cse4 .cse1 (<= ~waterLevel~0 (+ ~systemActive~0 2)) (<= (+ ~waterLevel~0 test_~tmp___1~0) 2147483649) .cse7 (<= 0 (+ .cse9 4294967296)) .cse8 (<= 0 (+ ~pumpRunning~0 test_~tmp___2~0 2147483648)) .cse3) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (and (<= (+ ~systemActive~0 ~waterLevel~0) 2) .cse6 (<= ~waterLevel~0 ~systemActive~0) .cse7 (<= test_~splverifierCounter~0 (+ test_~tmp~4 2147483648)) .cse8 .cse3) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))))) [2018-11-10 07:39:28,030 INFO L425 ceAbstractionStarter]: For program point L400(lines 400 406) no Hoare annotation was computed. [2018-11-10 07:39:28,030 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 400 406) no Hoare annotation was computed. [2018-11-10 07:39:28,030 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 396) no Hoare annotation was computed. [2018-11-10 07:39:28,030 INFO L425 ceAbstractionStarter]: For program point L390-1(lines 390 439) no Hoare annotation was computed. [2018-11-10 07:39:28,030 INFO L425 ceAbstractionStarter]: For program point testEXIT(lines 380 447) no Hoare annotation was computed. [2018-11-10 07:39:28,030 INFO L425 ceAbstractionStarter]: For program point isLowWaterSensorDryFINAL(lines 141 149) no Hoare annotation was computed. [2018-11-10 07:39:28,030 INFO L428 ceAbstractionStarter]: At program point isLowWaterSensorDryENTRY(lines 141 149) the Hoare annotation is: true [2018-11-10 07:39:28,030 INFO L425 ceAbstractionStarter]: For program point isLowWaterSensorDryEXIT(lines 141 149) no Hoare annotation was computed. [2018-11-10 07:39:28,031 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:39:28,031 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~waterLevel~0 |old(~waterLevel~0)|) [2018-11-10 07:39:28,031 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:39:28,031 INFO L425 ceAbstractionStarter]: For program point activatePumpFINAL(lines 245 252) no Hoare annotation was computed. [2018-11-10 07:39:28,031 INFO L425 ceAbstractionStarter]: For program point activatePumpEXIT(lines 245 252) no Hoare annotation was computed. [2018-11-10 07:39:28,031 INFO L421 ceAbstractionStarter]: At program point activatePumpENTRY(lines 245 252) the Hoare annotation is: (or (or (< (+ |old(~pumpRunning~0)| ~waterLevel~0) 2) (< (* 2 ~systemActive~0) 2) (< 3 (+ ~systemActive~0 ~waterLevel~0)) (< 0 (* 2 |old(~pumpRunning~0)|))) (= ~pumpRunning~0 0)) [2018-11-10 07:39:28,031 INFO L428 ceAbstractionStarter]: At program point getWaterLevelENTRY(lines 118 126) the Hoare annotation is: true [2018-11-10 07:39:28,031 INFO L425 ceAbstractionStarter]: For program point getWaterLevelFINAL(lines 118 126) no Hoare annotation was computed. [2018-11-10 07:39:28,031 INFO L425 ceAbstractionStarter]: For program point getWaterLevelEXIT(lines 118 126) no Hoare annotation was computed. [2018-11-10 07:39:28,031 INFO L425 ceAbstractionStarter]: For program point isHighWaterLevelEXIT(lines 317 335) no Hoare annotation was computed. [2018-11-10 07:39:28,031 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 330) no Hoare annotation was computed. [2018-11-10 07:39:28,031 INFO L428 ceAbstractionStarter]: At program point isHighWaterLevelENTRY(lines 317 335) the Hoare annotation is: true [2018-11-10 07:39:28,031 INFO L425 ceAbstractionStarter]: For program point isHighWaterLevelFINAL(lines 317 335) no Hoare annotation was computed. [2018-11-10 07:39:28,032 INFO L428 ceAbstractionStarter]: At program point L324(line 324) the Hoare annotation is: true [2018-11-10 07:39:28,032 INFO L425 ceAbstractionStarter]: For program point L326-2(lines 326 330) no Hoare annotation was computed. [2018-11-10 07:39:28,032 INFO L425 ceAbstractionStarter]: For program point L324-1(line 324) no Hoare annotation was computed. [2018-11-10 07:39:28,032 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 74 85) no Hoare annotation was computed. [2018-11-10 07:39:28,032 INFO L428 ceAbstractionStarter]: At program point changeMethaneLevelENTRY(lines 74 85) the Hoare annotation is: true [2018-11-10 07:39:28,032 INFO L425 ceAbstractionStarter]: For program point changeMethaneLevelEXIT(lines 74 85) no Hoare annotation was computed. [2018-11-10 07:39:28,032 INFO L421 ceAbstractionStarter]: At program point timeShiftENTRY(lines 162 185) the Hoare annotation is: (let ((.cse8 (+ |old(~pumpRunning~0)| 2)) (.cse12 (* 2 |old(~pumpRunning~0)|)) (.cse14 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse13 (+ ~systemActive~0 ~waterLevel~0))) (let ((.cse0 (<= .cse13 2)) (.cse1 (<= 1 .cse14)) (.cse7 (not (= ~systemActive~0 0))) (.cse5 (not (= |old(~waterLevel~0)| 1))) (.cse3 (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0)) (.cse4 (< (* 2 ~systemActive~0) 2)) (.cse6 (< 0 .cse12)) (.cse10 (< .cse8 |old(~waterLevel~0)|)) (.cse11 (<= 2 .cse14)) (.cse2 (= ~pumpRunning~0 0)) (.cse9 (+ |old(~pumpRunning~0)| ~systemActive~0))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5 .cse6) (or (or .cse7 (< |old(~waterLevel~0)| .cse8) (< |old(~pumpRunning~0)| ~systemActive~0) (< 0 .cse9) .cse10) (and .cse0 .cse11 (<= ~pumpRunning~0 ~systemActive~0))) (or (and (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) .cse1 .cse2) .cse7 (< .cse12 0) .cse5 .cse6) (or (or (or (< |old(~waterLevel~0)| 2) (or .cse3 .cse4)) .cse6 .cse10) (and (<= .cse13 3) .cse11 .cse2)) (or (and (= ~waterLevel~0 |old(~waterLevel~0)|) (= ~pumpRunning~0 1)) (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3) (< .cse12 2) (< 2 .cse9)))))) [2018-11-10 07:39:28,032 INFO L421 ceAbstractionStarter]: At program point L175(line 175) the Hoare annotation is: (let ((.cse10 (* 2 |old(~pumpRunning~0)|)) (.cse0 (+ ~pumpRunning~0 ~waterLevel~0))) (let ((.cse2 (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0)) (.cse3 (< (* 2 ~systemActive~0) 2)) (.cse7 (+ ~systemActive~0 ~waterLevel~0)) (.cse6 (<= 2 .cse0)) (.cse1 (= ~pumpRunning~0 0)) (.cse4 (not (= |old(~waterLevel~0)| 1))) (.cse11 (+ |old(~pumpRunning~0)| ~systemActive~0)) (.cse9 (+ ~systemActive~0 |old(~waterLevel~0)|)) (.cse8 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) (.cse5 (< 0 .cse10)) (.cse12 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|))) (and (or (and (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) (<= 1 .cse0) .cse1) (or .cse2 .cse3 .cse4 .cse5)) (or (and .cse6 (<= .cse7 2) (<= ~pumpRunning~0 ~systemActive~0)) (or (< 3 .cse8) (< .cse9 3) (< .cse10 2) (< 2 .cse11))) (or (or (or (< |old(~waterLevel~0)| 2) (or .cse2 .cse3)) .cse5 .cse12) (and (<= .cse7 3) .cse6 .cse1)) (or (< |old(~pumpRunning~0)| ~systemActive~0) .cse4 (< 0 .cse11) (< .cse9 1)) (or (< .cse8 2) (not (= ~systemActive~0 0)) .cse5 .cse12)))) [2018-11-10 07:39:28,033 INFO L421 ceAbstractionStarter]: At program point L173(lines 173 179) the Hoare annotation is: (let ((.cse12 (+ ~pumpRunning~0 ~waterLevel~0))) (let ((.cse10 (+ |old(~pumpRunning~0)| 2)) (.cse1 (* 2 |old(~pumpRunning~0)|)) (.cse3 (<= 1 .cse12)) (.cse4 (= ~pumpRunning~0 0))) (let ((.cse0 (and (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) .cse3 .cse4)) (.cse7 (not (= |old(~waterLevel~0)| 1))) (.cse9 (not (= ~systemActive~0 0))) (.cse2 (+ |old(~pumpRunning~0)| ~systemActive~0)) (.cse5 (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0)) (.cse6 (< (* 2 ~systemActive~0) 2)) (.cse8 (< 0 .cse1)) (.cse11 (< .cse10 |old(~waterLevel~0)|))) (and (or .cse0 (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3) (< .cse1 2) (< 2 .cse2))) (or (and .cse3 (<= ~waterLevel~0 ~systemActive~0) .cse4) .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 (< .cse1 0) .cse7 .cse8) (or (or .cse9 (< |old(~waterLevel~0)| .cse10) (< |old(~pumpRunning~0)| ~systemActive~0) (< 0 .cse2) .cse11) (and (<= (+ ~systemActive~0 ~waterLevel~0) 2) (<= 2 .cse12) .cse4)) (or (or (or (< |old(~waterLevel~0)| 2) (or .cse5 .cse6)) .cse8 .cse11) (and (= ~waterLevel~0 |old(~waterLevel~0)|) (= ~pumpRunning~0 1))))))) [2018-11-10 07:39:28,033 INFO L425 ceAbstractionStarter]: For program point timeShiftEXIT(lines 162 185) no Hoare annotation was computed. [2018-11-10 07:39:28,033 INFO L421 ceAbstractionStarter]: At program point L168(line 168) the Hoare annotation is: (let ((.cse5 (* 2 |old(~pumpRunning~0)|))) (let ((.cse2 (< 0 .cse5)) (.cse3 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|)) (.cse4 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) (.cse1 (+ ~systemActive~0 |old(~waterLevel~0)|)) (.cse0 (+ |old(~pumpRunning~0)| ~systemActive~0))) (and (or (< |old(~pumpRunning~0)| ~systemActive~0) (not (= |old(~waterLevel~0)| 1)) (< 0 .cse0) (< .cse1 1)) (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (< |old(~waterLevel~0)| ~systemActive~0)) .cse2 .cse3) (or (< .cse4 2) (not (= ~systemActive~0 0)) .cse2 .cse3) (or (and (= ~waterLevel~0 |old(~waterLevel~0)|) (= ~pumpRunning~0 1)) (or (< 3 .cse4) (< .cse1 3) (< .cse5 2) (< 2 .cse0)))))) [2018-11-10 07:39:28,033 INFO L425 ceAbstractionStarter]: For program point timeShiftFINAL(lines 162 185) no Hoare annotation was computed. [2018-11-10 07:39:28,033 INFO L425 ceAbstractionStarter]: For program point L166(lines 165 184) no Hoare annotation was computed. [2018-11-10 07:39:28,033 INFO L425 ceAbstractionStarter]: For program point cleanupEXIT(lines 816 845) no Hoare annotation was computed. [2018-11-10 07:39:28,033 INFO L425 ceAbstractionStarter]: For program point L830(lines 830 834) no Hoare annotation was computed. [2018-11-10 07:39:28,033 INFO L428 ceAbstractionStarter]: At program point L830-1(lines 830 834) the Hoare annotation is: true [2018-11-10 07:39:28,033 INFO L425 ceAbstractionStarter]: For program point L826-1(lines 826 840) no Hoare annotation was computed. [2018-11-10 07:39:28,033 INFO L428 ceAbstractionStarter]: At program point L826-3(lines 826 840) the Hoare annotation is: true [2018-11-10 07:39:28,034 INFO L428 ceAbstractionStarter]: At program point L822(line 822) the Hoare annotation is: true [2018-11-10 07:39:28,034 INFO L425 ceAbstractionStarter]: For program point L822-1(line 822) no Hoare annotation was computed. [2018-11-10 07:39:28,034 INFO L428 ceAbstractionStarter]: At program point L841(lines 816 845) the Hoare annotation is: true [2018-11-10 07:39:28,034 INFO L425 ceAbstractionStarter]: For program point L837(line 837) no Hoare annotation was computed. [2018-11-10 07:39:28,034 INFO L428 ceAbstractionStarter]: At program point cleanupENTRY(lines 816 845) the Hoare annotation is: true [2018-11-10 07:39:28,034 INFO L425 ceAbstractionStarter]: For program point L827(line 827) no Hoare annotation was computed. [2018-11-10 07:39:28,034 INFO L421 ceAbstractionStarter]: At program point lowerWaterLevelENTRY(lines 50 61) the Hoare annotation is: (or (= ~waterLevel~0 |old(~waterLevel~0)|) (or (or (< 3 (+ ~pumpRunning~0 |old(~waterLevel~0)|)) (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3)) (< (* 2 ~pumpRunning~0) 2) (< 2 (+ ~pumpRunning~0 ~systemActive~0)))) [2018-11-10 07:39:28,034 INFO L425 ceAbstractionStarter]: For program point lowerWaterLevelEXIT(lines 50 61) no Hoare annotation was computed. [2018-11-10 07:39:28,034 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 50 61) no Hoare annotation was computed. [2018-11-10 07:39:28,034 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:39:28,034 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (<= ~systemActive~0 ~waterLevel~0) (= ~pumpRunning~0 0)) [2018-11-10 07:39:28,034 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:39:28,034 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:39:28,035 INFO L425 ceAbstractionStarter]: For program point setupEXIT(lines 870 876) no Hoare annotation was computed. [2018-11-10 07:39:28,035 INFO L428 ceAbstractionStarter]: At program point setupFINAL(lines 870 876) the Hoare annotation is: true [2018-11-10 07:39:28,035 INFO L421 ceAbstractionStarter]: At program point processEnvironment__wrappee__highWaterSensorENTRY(lines 194 218) the Hoare annotation is: (or (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (< ~waterLevel~0 ~systemActive~0)) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) (= ~pumpRunning~0 0)) [2018-11-10 07:39:28,035 INFO L425 ceAbstractionStarter]: For program point processEnvironment__wrappee__highWaterSensorEXIT(lines 194 218) no Hoare annotation was computed. [2018-11-10 07:39:28,035 INFO L421 ceAbstractionStarter]: At program point L213(line 213) the Hoare annotation is: (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (< ~waterLevel~0 ~systemActive~0)) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) [2018-11-10 07:39:28,035 INFO L425 ceAbstractionStarter]: For program point L213-1(lines 194 218) no Hoare annotation was computed. [2018-11-10 07:39:28,035 INFO L421 ceAbstractionStarter]: At program point L208(line 208) the Hoare annotation is: (let ((.cse0 (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0)) (.cse1 (< (* 2 ~systemActive~0) 2)) (.cse2 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (or .cse0 .cse1 (not (= ~waterLevel~0 1)) .cse2) (and (= 0 processEnvironment__wrappee__highWaterSensor_~tmp~0) (= ~pumpRunning~0 0))) (or (or (< ~waterLevel~0 2) (or .cse0 .cse1)) .cse2 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-11-10 07:39:28,035 INFO L421 ceAbstractionStarter]: At program point L204(line 204) the Hoare annotation is: (or (and (<= ~systemActive~0 processEnvironment__wrappee__highWaterSensor_~tmp~0) (<= (+ processEnvironment__wrappee__highWaterSensor_~tmp~0 1) ~waterLevel~0) (= ~pumpRunning~0 0)) (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (< ~waterLevel~0 ~systemActive~0)) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))) [2018-11-10 07:39:28,035 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 210) no Hoare annotation was computed. [2018-11-10 07:39:28,035 INFO L421 ceAbstractionStarter]: At program point L200(line 200) the Hoare annotation is: (or (or (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (< ~waterLevel~0 ~systemActive~0)) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) (= ~pumpRunning~0 0)) [2018-11-10 07:39:28,035 INFO L425 ceAbstractionStarter]: For program point L200-1(line 200) no Hoare annotation was computed. [2018-11-10 07:39:28,036 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 215) no Hoare annotation was computed. [2018-11-10 07:39:28,036 INFO L425 ceAbstractionStarter]: For program point startSystemEXIT(lines 370 377) no Hoare annotation was computed. [2018-11-10 07:39:28,036 INFO L421 ceAbstractionStarter]: At program point startSystemENTRY(lines 370 377) the Hoare annotation is: (let ((.cse5 (<= ~pumpRunning~0 ~systemActive~0)) (.cse13 (+ ~systemActive~0 ~waterLevel~0)) (.cse2 (* 2 ~pumpRunning~0))) (let ((.cse6 (not (= |old(~systemActive~0)| 0))) (.cse3 (+ ~pumpRunning~0 |old(~systemActive~0)|)) (.cse0 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse10 (< (* 2 |old(~systemActive~0)|) 2)) (.cse1 (+ ~waterLevel~0 |old(~systemActive~0)|)) (.cse8 (< 0 .cse2)) (.cse4 (<= .cse13 3)) (.cse9 (+ ~pumpRunning~0 1)) (.cse11 (and (<= .cse13 2) .cse5))) (and (or (or (< 3 .cse0) (< .cse1 3) (< .cse2 2) (< 2 .cse3)) (and .cse4 .cse5)) (or (let ((.cse7 (not (= ~waterLevel~0 1)))) (and (or (< .cse2 0) .cse6 .cse7 .cse8) (or (< .cse9 |old(~systemActive~0)|) .cse10 .cse7 .cse8))) .cse11) (or (and (let ((.cse12 (+ ~pumpRunning~0 2))) (or .cse6 (< ~waterLevel~0 .cse12) (< ~pumpRunning~0 |old(~systemActive~0)|) (< 0 .cse3) (< .cse12 ~waterLevel~0))) (or (< .cse0 2) .cse10 (< 3 .cse1) .cse8)) (and .cse4 (<= .cse9 ~systemActive~0)) .cse11)))) [2018-11-10 07:39:28,036 INFO L425 ceAbstractionStarter]: For program point startSystemFINAL(lines 370 377) no Hoare annotation was computed. [2018-11-10 07:39:28,036 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 62 73) no Hoare annotation was computed. [2018-11-10 07:39:28,036 INFO L425 ceAbstractionStarter]: For program point waterRiseEXIT(lines 62 73) no Hoare annotation was computed. [2018-11-10 07:39:28,036 INFO L421 ceAbstractionStarter]: At program point waterRiseENTRY(lines 62 73) the Hoare annotation is: (let ((.cse8 (+ ~pumpRunning~0 1)) (.cse3 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse5 (* 2 ~pumpRunning~0))) (let ((.cse1 (not (= ~systemActive~0 0))) (.cse0 (+ ~pumpRunning~0 |old(~waterLevel~0)|)) (.cse7 (< (* 2 ~systemActive~0) 2)) (.cse6 (not (= |old(~waterLevel~0)| 1))) (.cse2 (< 0 .cse5)) (.cse4 (and (<= ~waterLevel~0 .cse8) (<= 1 .cse3)))) (and (or (or (< .cse0 2) .cse1 .cse2 (< (+ ~pumpRunning~0 2) |old(~waterLevel~0)|)) (and (<= ~waterLevel~0 (+ ~systemActive~0 2)) (<= 2 .cse3))) (or .cse4 .cse1 (< .cse5 0) .cse6 .cse2) (or (or (< .cse0 3) .cse7 (< 2 (+ ~pumpRunning~0 ~systemActive~0)) (< 3 (+ ~systemActive~0 |old(~waterLevel~0)|))) (= ~waterLevel~0 |old(~waterLevel~0)|)) (or (or (< .cse8 ~systemActive~0) .cse7 .cse6 .cse2) .cse4)))) [2018-11-10 07:39:28,036 INFO L425 ceAbstractionStarter]: For program point __automaton_failFINAL(lines 949 956) no Hoare annotation was computed. [2018-11-10 07:39:28,037 INFO L425 ceAbstractionStarter]: For program point __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION(line 953) no Hoare annotation was computed. [2018-11-10 07:39:28,037 INFO L428 ceAbstractionStarter]: At program point __automaton_failENTRY(lines 949 956) the Hoare annotation is: true [2018-11-10 07:39:28,037 INFO L425 ceAbstractionStarter]: For program point __automaton_failEXIT(lines 949 956) no Hoare annotation was computed. [2018-11-10 07:39:28,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:39:28 BoogieIcfgContainer [2018-11-10 07:39:28,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:39:28,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:39:28,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:39:28,067 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:39:28,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:32:18" (3/4) ... [2018-11-10 07:39:28,070 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:39:28,074 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_helpers [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure valid_product [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __utac_acc__Specification4_spec__1 [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stopSystem [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isLowWaterLevel [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_features [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure runTest [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isHighWaterSensorDry [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure test [2018-11-10 07:39:28,075 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isLowWaterSensorDry [2018-11-10 07:39:28,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:39:28,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activatePump [2018-11-10 07:39:28,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getWaterLevel [2018-11-10 07:39:28,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isHighWaterLevel [2018-11-10 07:39:28,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2018-11-10 07:39:28,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2018-11-10 07:39:28,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2018-11-10 07:39:28,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure lowerWaterLevel [2018-11-10 07:39:28,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup [2018-11-10 07:39:28,077 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2018-11-10 07:39:28,077 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure startSystem [2018-11-10 07:39:28,077 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2018-11-10 07:39:28,077 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __automaton_fail [2018-11-10 07:39:28,084 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 139 nodes and edges [2018-11-10 07:39:28,085 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2018-11-10 07:39:28,086 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-10 07:39:28,111 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((pumpRunning + 1 <= waterLevel && systemActive == 1) && pumpRunning + waterLevel <= 3) && 2 * tmp___0 <= 4294967294) && 2 * tmp <= 4294967294) && tmp___2 <= splverifierCounter + 2147483647) && 2 <= pumpRunning + systemActive) && 0 <= 2 * tmp___0 + 4294967296) && splverifierCounter <= tmp + 2147483648) && 0 <= splverifierCounter + tmp___2 + 2147483648) && splverifierCounter == 0) || (((((waterLevel <= pumpRunning + 1 && 0 <= pumpRunning + systemActive) && systemActive <= pumpRunning) && 1 <= pumpRunning + waterLevel) && pumpRunning == 0) && splverifierCounter == 0)) || ((((systemActive <= waterLevel && 2 <= 2 * systemActive) && waterLevel <= pumpRunning + 1) && pumpRunning + systemActive <= 1) && splverifierCounter == 0)) || \old(pumpRunning) + 1 < \old(systemActive)) || 2 * \old(systemActive) < 2) || !(\old(waterLevel) == 1)) || ((((((((((0 <= pumpRunning + tmp___1 + 2147483648 && 1 <= systemActive + waterLevel) && pumpRunning + systemActive <= 0) && waterLevel + tmp___2 <= 2147483649) && 2 * tmp___0 <= 4294967294) && waterLevel <= systemActive + 2) && waterLevel + tmp___1 <= 2147483649) && 0 <= 2 * tmp___0 + 4294967296) && pumpRunning == 0) && 0 <= pumpRunning + tmp___2 + 2147483648) && splverifierCounter == 0)) || 0 < 2 * \old(pumpRunning) [2018-11-10 07:39:28,111 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(pumpRunning) + 1 < \old(systemActive) || 2 * \old(systemActive) < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) [2018-11-10 07:39:28,149 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9ef1c8d1-9d36-49d7-93a3-9f86a2b8f0a8/bin-2019/utaipan/witness.graphml [2018-11-10 07:39:28,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:39:28,150 INFO L168 Benchmark]: Toolchain (without parser) took 430950.01 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-11-10 07:39:28,150 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:39:28,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.70 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 927.9 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:39:28,151 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 927.9 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:39:28,151 INFO L168 Benchmark]: Boogie Preprocessor took 33.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:39:28,151 INFO L168 Benchmark]: RCFGBuilder took 729.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:39:28,151 INFO L168 Benchmark]: TraceAbstraction took 429720.44 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -102.9 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-11-10 07:39:28,151 INFO L168 Benchmark]: Witness Printer took 82.93 ms. Allocated memory is still 5.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. [2018-11-10 07:39:28,153 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.70 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 927.9 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 927.9 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 729.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 429720.44 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -102.9 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 82.93 ms. Allocated memory is still 5.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 953]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: ((\old(pumpRunning) + 1 < \old(systemActive) || 2 * \old(systemActive) < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) - InvariantResult [Line: 826]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 816]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((((((((((((((((pumpRunning + 1 <= waterLevel && systemActive == 1) && pumpRunning + waterLevel <= 3) && 2 * tmp___0 <= 4294967294) && 2 * tmp <= 4294967294) && tmp___2 <= splverifierCounter + 2147483647) && 2 <= pumpRunning + systemActive) && 0 <= 2 * tmp___0 + 4294967296) && splverifierCounter <= tmp + 2147483648) && 0 <= splverifierCounter + tmp___2 + 2147483648) && splverifierCounter == 0) || (((((waterLevel <= pumpRunning + 1 && 0 <= pumpRunning + systemActive) && systemActive <= pumpRunning) && 1 <= pumpRunning + waterLevel) && pumpRunning == 0) && splverifierCounter == 0)) || ((((systemActive <= waterLevel && 2 <= 2 * systemActive) && waterLevel <= pumpRunning + 1) && pumpRunning + systemActive <= 1) && splverifierCounter == 0)) || \old(pumpRunning) + 1 < \old(systemActive)) || 2 * \old(systemActive) < 2) || !(\old(waterLevel) == 1)) || ((((((((((0 <= pumpRunning + tmp___1 + 2147483648 && 1 <= systemActive + waterLevel) && pumpRunning + systemActive <= 0) && waterLevel + tmp___2 <= 2147483649) && 2 * tmp___0 <= 4294967294) && waterLevel <= systemActive + 2) && waterLevel + tmp___1 <= 2147483649) && 0 <= 2 * tmp___0 + 4294967296) && pumpRunning == 0) && 0 <= pumpRunning + tmp___2 + 2147483648) && splverifierCounter == 0)) || 0 < 2 * \old(pumpRunning) - StatisticsResult: Ultimate Automizer benchmark data CFG has 29 procedures, 153 locations, 1 error locations. SAFE Result, 429.6s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 178.7s AutomataDifference, 0.0s DeadEndRemovalTime, 30.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 3312 SDtfs, 6283 SDslu, 17005 SDs, 0 SdLazy, 13604 SolverSat, 2721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 122.5s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 792 GetRequests, 413 SyntacticMatches, 20 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7910 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1995occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 145.7s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.9935439008960599 AbsIntWeakeningRatio, 0.9291044776119403 AbsIntAvgWeakeningVarsNumRemoved, 5857.925373134329 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2159 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 4853 PreInvPairs, 4910 NumberOfFragments, 3789 HoareAnnotationTreeSize, 4853 FomulaSimplifications, 3126359 FormulaSimplificationTreeSizeReduction, 10.3s HoareSimplificationTime, 63 FomulaSimplificationsInter, 1556914 FormulaSimplificationTreeSizeReductionInter, 19.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1979 NumberOfCodeBlocks, 1979 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1962 ConstructedInterpolants, 0 QuantifiedInterpolants, 338915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 509/522 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...