./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product49_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_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product49_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/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 712263c6c933aaef268a48b623f3b4ee6fd9ad4b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:51:59,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:51:59,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:51:59,947 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:51:59,948 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:51:59,948 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:51:59,950 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:51:59,951 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:51:59,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:51:59,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:51:59,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:51:59,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:51:59,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:51:59,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:51:59,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:51:59,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:51:59,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:51:59,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:51:59,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:51:59,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:51:59,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:51:59,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:51:59,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:51:59,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:51:59,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:51:59,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:51:59,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:51:59,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:51:59,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:51:59,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:51:59,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:51:59,972 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:51:59,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:51:59,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:51:59,973 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:51:59,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:51:59,974 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 11:51:59,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:51:59,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:51:59,988 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:51:59,988 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:51:59,988 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:51:59,988 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:51:59,989 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:51:59,989 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:51:59,989 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:51:59,989 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:51:59,989 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:51:59,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:51:59,990 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:51:59,990 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:51:59,991 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:51:59,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:51:59,991 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:51:59,991 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:51:59,991 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:51:59,991 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:51:59,992 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:51:59,992 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:51:59,992 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:51:59,992 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:51:59,992 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:51:59,992 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:51:59,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:51:59,993 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:51:59,993 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:51:59,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:51:59,995 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:51:59,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:51:59,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:51:59,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:51:59,996 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_6b72f39f-daa5-4c14-9460-b5f3618561f0/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 -> 712263c6c933aaef268a48b623f3b4ee6fd9ad4b [2018-11-10 11:52:00,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:52:00,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:52:00,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:52:00,042 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:52:00,043 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:52:00,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec4_product49_true-unreach-call_false-termination.cil.c [2018-11-10 11:52:00,096 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/data/f3d1caabb/0d16c2ec95cb402587b77be8895c7996/FLAG6c0da3deb [2018-11-10 11:52:00,490 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:52:00,491 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/sv-benchmarks/c/product-lines/minepump_spec4_product49_true-unreach-call_false-termination.cil.c [2018-11-10 11:52:00,499 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/data/f3d1caabb/0d16c2ec95cb402587b77be8895c7996/FLAG6c0da3deb [2018-11-10 11:52:00,509 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/data/f3d1caabb/0d16c2ec95cb402587b77be8895c7996 [2018-11-10 11:52:00,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:52:00,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:52:00,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:52:00,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:52:00,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:52:00,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:00,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397e60ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00, skipping insertion in model container [2018-11-10 11:52:00,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:00,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:52:00,574 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:52:00,819 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:52:00,829 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:52:00,897 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:52:00,917 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:52:00,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00 WrapperNode [2018-11-10 11:52:00,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:52:00,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:52:00,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:52:00,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:52:00,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:00,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:01,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:52:01,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:52:01,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:52:01,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:52:01,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:01,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:01,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:01,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:01,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:01,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:01,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... [2018-11-10 11:52:01,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:52:01,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:52:01,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:52:01,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:52:01,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/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 11:52:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2018-11-10 11:52:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2018-11-10 11:52:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification4_spec__1 [2018-11-10 11:52:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification4_spec__1 [2018-11-10 11:52:01,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:52:01,105 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:52:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure isLowWaterLevel [2018-11-10 11:52:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure isLowWaterLevel [2018-11-10 11:52:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2018-11-10 11:52:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2018-11-10 11:52:01,106 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterSensorDry [2018-11-10 11:52:01,106 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterSensorDry [2018-11-10 11:52:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment [2018-11-10 11:52:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment [2018-11-10 11:52:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2018-11-10 11:52:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2018-11-10 11:52:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure test [2018-11-10 11:52:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2018-11-10 11:52:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure isLowWaterSensorDry [2018-11-10 11:52:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure isLowWaterSensorDry [2018-11-10 11:52:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump [2018-11-10 11:52:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump [2018-11-10 11:52:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure getWaterLevel [2018-11-10 11:52:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure getWaterLevel [2018-11-10 11:52:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterLevel [2018-11-10 11:52:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterLevel [2018-11-10 11:52:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2018-11-10 11:52:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2018-11-10 11:52:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2018-11-10 11:52:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2018-11-10 11:52:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure lowerWaterLevel [2018-11-10 11:52:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure lowerWaterLevel [2018-11-10 11:52:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2018-11-10 11:52:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2018-11-10 11:52:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2018-11-10 11:52:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2018-11-10 11:52:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2018-11-10 11:52:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2018-11-10 11:52:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2018-11-10 11:52:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2018-11-10 11:52:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2018-11-10 11:52:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2018-11-10 11:52:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2018-11-10 11:52:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2018-11-10 11:52:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2018-11-10 11:52:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2018-11-10 11:52:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:52:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:52:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2018-11-10 11:52:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2018-11-10 11:52:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:52:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:52:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2018-11-10 11:52:01,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2018-11-10 11:52:01,778 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:52:01,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:52:01 BoogieIcfgContainer [2018-11-10 11:52:01,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:52:01,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:52:01,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:52:01,781 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:52:01,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:52:00" (1/3) ... [2018-11-10 11:52:01,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e61e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:52:01, skipping insertion in model container [2018-11-10 11:52:01,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:00" (2/3) ... [2018-11-10 11:52:01,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e61e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:52:01, skipping insertion in model container [2018-11-10 11:52:01,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:52:01" (3/3) ... [2018-11-10 11:52:01,784 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product49_true-unreach-call_false-termination.cil.c [2018-11-10 11:52:01,792 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:52:01,799 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:52:01,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:52:01,839 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:52:01,840 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:52:01,840 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:52:01,840 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:52:01,840 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:52:01,840 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:52:01,840 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:52:01,840 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:52:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-11-10 11:52:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 11:52:01,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:52:01,869 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 11:52:01,872 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:52:01,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:01,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2036697695, now seen corresponding path program 1 times [2018-11-10 11:52:01,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:52:01,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:01,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:01,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:01,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:52:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:52:02,129 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 11:52:02,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:52:02,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:52:02,131 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:52:02,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 11:52:02,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 11:52:02,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 11:52:02,147 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 2 states. [2018-11-10 11:52:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:52:02,182 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2018-11-10 11:52:02,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 11:52:02,184 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 46 [2018-11-10 11:52:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:52:02,194 INFO L225 Difference]: With dead ends: 260 [2018-11-10 11:52:02,194 INFO L226 Difference]: Without dead ends: 130 [2018-11-10 11:52:02,198 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 11:52:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-10 11:52:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-10 11:52:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 11:52:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-11-10 11:52:02,244 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 46 [2018-11-10 11:52:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:52:02,245 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-11-10 11:52:02,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 11:52:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-11-10 11:52:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 11:52:02,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:52:02,249 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 11:52:02,249 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:52:02,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash 347922663, now seen corresponding path program 1 times [2018-11-10 11:52:02,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:52:02,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:02,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:02,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:52:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:52:02,356 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 11:52:02,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:52:02,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:52:02,358 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:52:02,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:52:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:52:02,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:52:02,361 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 3 states. [2018-11-10 11:52:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:52:02,381 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2018-11-10 11:52:02,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:52:02,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 11:52:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:52:02,384 INFO L225 Difference]: With dead ends: 207 [2018-11-10 11:52:02,384 INFO L226 Difference]: Without dead ends: 120 [2018-11-10 11:52:02,386 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 11:52:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-10 11:52:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-10 11:52:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-10 11:52:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2018-11-10 11:52:02,399 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 48 [2018-11-10 11:52:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:52:02,400 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2018-11-10 11:52:02,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:52:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2018-11-10 11:52:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 11:52:02,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:52:02,402 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] [2018-11-10 11:52:02,402 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:52:02,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash 211104639, now seen corresponding path program 1 times [2018-11-10 11:52:02,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:52:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:02,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:02,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:52:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:52:02,521 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 11:52:02,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:52:02,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 11:52:02,522 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:52:02,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:52:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:52:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:52:02,523 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 7 states. [2018-11-10 11:52:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:52:02,814 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2018-11-10 11:52:02,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:52:02,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-10 11:52:02,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:52:02,816 INFO L225 Difference]: With dead ends: 216 [2018-11-10 11:52:02,816 INFO L226 Difference]: Without dead ends: 120 [2018-11-10 11:52:02,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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 11:52:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-10 11:52:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-10 11:52:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-10 11:52:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2018-11-10 11:52:02,826 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 52 [2018-11-10 11:52:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:52:02,827 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2018-11-10 11:52:02,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:52:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2018-11-10 11:52:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 11:52:02,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:52:02,829 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, 1, 1, 1] [2018-11-10 11:52:02,829 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:52:02,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:02,829 INFO L82 PathProgramCache]: Analyzing trace with hash 448016249, now seen corresponding path program 1 times [2018-11-10 11:52:02,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:52:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:02,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:02,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:02,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:52:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:52:02,921 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 11:52:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:52:02,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:52:02,922 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:52:02,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:52:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:52:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:52:02,923 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 5 states. [2018-11-10 11:52:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:52:03,591 INFO L93 Difference]: Finished difference Result 312 states and 375 transitions. [2018-11-10 11:52:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:52:03,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-10 11:52:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:52:03,594 INFO L225 Difference]: With dead ends: 312 [2018-11-10 11:52:03,594 INFO L226 Difference]: Without dead ends: 216 [2018-11-10 11:52:03,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 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 11:52:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-10 11:52:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2018-11-10 11:52:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-10 11:52:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2018-11-10 11:52:03,624 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 65 [2018-11-10 11:52:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:52:03,625 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2018-11-10 11:52:03,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:52:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2018-11-10 11:52:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 11:52:03,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:52:03,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:52:03,629 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:52:03,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1231635931, now seen corresponding path program 1 times [2018-11-10 11:52:03,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:52:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:03,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:03,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:03,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:52:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:52:03,771 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 11:52:03,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:52:03,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 11:52:03,772 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:52:03,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 11:52:03,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:52:03,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:52:03,773 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand 10 states. [2018-11-10 11:52:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:52:04,517 INFO L93 Difference]: Finished difference Result 626 states and 780 transitions. [2018-11-10 11:52:04,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 11:52:04,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-11-10 11:52:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:52:04,521 INFO L225 Difference]: With dead ends: 626 [2018-11-10 11:52:04,521 INFO L226 Difference]: Without dead ends: 453 [2018-11-10 11:52:04,523 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 11:52:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-11-10 11:52:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 443. [2018-11-10 11:52:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-10 11:52:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 523 transitions. [2018-11-10 11:52:04,560 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 523 transitions. Word has length 79 [2018-11-10 11:52:04,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:52:04,560 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 523 transitions. [2018-11-10 11:52:04,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 11:52:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 523 transitions. [2018-11-10 11:52:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 11:52:04,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:52:04,562 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, 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] [2018-11-10 11:52:04,563 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:52:04,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:04,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2106594680, now seen corresponding path program 1 times [2018-11-10 11:52:04,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:52:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:04,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:04,564 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:52:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:52:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 11:52:04,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:52:04,656 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:52:04,656 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-11-10 11:52:04,659 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [37], [38], [39], [41], [44], [48], [49], [50], [53], [54], [55], [58], [60], [61], [64], [66], [69], [76], [79], [81], [85], [91], [95], [99], [102], [107], [113], [115], [118], [133], [134], [135], [136], [137], [138], [139], [140], [141], [143], [146], [150], [151], [188], [191], [195], [201], [204], [208], [212], [213], [216], [218], [221], [231], [234], [238], [239], [242], [243], [244], [245], [246], [248], [249], [250], [251], [252], [253], [254], [255], [256], [258], [259], [260], [262], [263], [264], [265], [268], [269], [270], [271], [274], [275], [278], [279], [284], [285], [286], [287], [288], [289], [290], [291], [292], [294], [295], [296], [297] [2018-11-10 11:52:04,717 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:52:04,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:52:10,341 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:52:10,343 INFO L272 AbstractInterpreter]: Visited 53 different actions 53 times. Never merged. Never widened. Never found a fixpoint. Largest state had 132 variables. [2018-11-10 11:52:10,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:10,348 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:52:15,622 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 97.2% of their original sizes. [2018-11-10 11:52:15,622 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:52:15,890 INFO L415 sIntCurrentIteration]: We unified 137 AI predicates to 137 [2018-11-10 11:52:15,890 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:52:15,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:52:15,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-10 11:52:15,891 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:52:15,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 11:52:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 11:52:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:52:15,892 INFO L87 Difference]: Start difference. First operand 443 states and 523 transitions. Second operand 17 states. [2018-11-10 11:52:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:52:27,970 INFO L93 Difference]: Finished difference Result 957 states and 1164 transitions. [2018-11-10 11:52:27,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 11:52:27,970 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 138 [2018-11-10 11:52:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:52:27,974 INFO L225 Difference]: With dead ends: 957 [2018-11-10 11:52:27,974 INFO L226 Difference]: Without dead ends: 636 [2018-11-10 11:52:27,977 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 139 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-10 11:52:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-11-10 11:52:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 601. [2018-11-10 11:52:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-10 11:52:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 709 transitions. [2018-11-10 11:52:28,026 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 709 transitions. Word has length 138 [2018-11-10 11:52:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:52:28,026 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 709 transitions. [2018-11-10 11:52:28,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 11:52:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 709 transitions. [2018-11-10 11:52:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 11:52:28,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:52:28,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:28,030 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:52:28,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1451062305, now seen corresponding path program 1 times [2018-11-10 11:52:28,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:52:28,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:28,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:28,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:28,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:52:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:52:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:52:28,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:52:28,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:52:28,139 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-11-10 11:52:28,141 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [37], [38], [39], [41], [44], [48], [49], [50], [53], [54], [55], [59], [60], [61], [64], [66], [69], [76], [79], [81], [85], [91], [95], [99], [102], [105], [107], [113], [115], [118], [133], [134], [135], [136], [137], [138], [139], [140], [141], [143], [146], [150], [151], [188], [191], [195], [201], [204], [208], [212], [213], [216], [218], [221], [231], [234], [238], [239], [242], [243], [244], [245], [246], [248], [249], [250], [251], [252], [253], [254], [255], [256], [258], [259], [260], [262], [263], [264], [265], [268], [269], [270], [271], [274], [275], [278], [279], [284], [285], [286], [287], [288], [289], [290], [291], [292], [294], [295], [296], [297] [2018-11-10 11:52:28,148 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:52:28,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:52:37,580 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:52:37,580 INFO L272 AbstractInterpreter]: Visited 58 different actions 78 times. Merged at 5 different actions 5 times. Never widened. Never found a fixpoint. Largest state had 132 variables. [2018-11-10 11:52:37,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:37,588 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:52:52,698 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 97.21% of their original sizes. [2018-11-10 11:52:52,698 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:52:53,124 INFO L415 sIntCurrentIteration]: We unified 133 AI predicates to 133 [2018-11-10 11:52:53,124 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:52:53,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:52:53,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-11-10 11:52:53,125 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:52:53,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 11:52:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 11:52:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-11-10 11:52:53,125 INFO L87 Difference]: Start difference. First operand 601 states and 709 transitions. Second operand 21 states. [2018-11-10 11:53:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:17,418 INFO L93 Difference]: Finished difference Result 1453 states and 1862 transitions. [2018-11-10 11:53:17,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 11:53:17,418 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 134 [2018-11-10 11:53:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:53:17,422 INFO L225 Difference]: With dead ends: 1453 [2018-11-10 11:53:17,422 INFO L226 Difference]: Without dead ends: 1030 [2018-11-10 11:53:17,423 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 145 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 11:53:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-11-10 11:53:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 891. [2018-11-10 11:53:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-11-10 11:53:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1073 transitions. [2018-11-10 11:53:17,495 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1073 transitions. Word has length 134 [2018-11-10 11:53:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:53:17,495 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1073 transitions. [2018-11-10 11:53:17,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 11:53:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1073 transitions. [2018-11-10 11:53:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 11:53:17,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:53:17,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:17,499 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:53:17,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:17,500 INFO L82 PathProgramCache]: Analyzing trace with hash 308559839, now seen corresponding path program 1 times [2018-11-10 11:53:17,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:53:17,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:17,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:17,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:17,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:53:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 11:53:17,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:17,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:53:17,581 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:53:17,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:53:17,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:53:17,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:53:17,583 INFO L87 Difference]: Start difference. First operand 891 states and 1073 transitions. Second operand 6 states. [2018-11-10 11:53:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:17,665 INFO L93 Difference]: Finished difference Result 1222 states and 1475 transitions. [2018-11-10 11:53:17,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:53:17,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-10 11:53:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:53:17,669 INFO L225 Difference]: With dead ends: 1222 [2018-11-10 11:53:17,669 INFO L226 Difference]: Without dead ends: 901 [2018-11-10 11:53:17,671 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 11:53:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-11-10 11:53:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2018-11-10 11:53:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-11-10 11:53:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1083 transitions. [2018-11-10 11:53:17,730 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1083 transitions. Word has length 134 [2018-11-10 11:53:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:53:17,730 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1083 transitions. [2018-11-10 11:53:17,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:53:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1083 transitions. [2018-11-10 11:53:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 11:53:17,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:53:17,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:17,733 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:53:17,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:17,733 INFO L82 PathProgramCache]: Analyzing trace with hash 801687680, now seen corresponding path program 1 times [2018-11-10 11:53:17,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:53:17,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:17,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:17,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:17,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:53:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:53:17,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:53:17,807 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:53:17,807 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-11-10 11:53:17,808 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [37], [38], [39], [41], [46], [48], [49], [50], [53], [54], [55], [58], [60], [61], [64], [66], [69], [76], [79], [81], [85], [91], [95], [99], [102], [105], [107], [113], [115], [118], [133], [134], [135], [136], [137], [138], [139], [140], [141], [143], [146], [150], [151], [188], [191], [195], [201], [204], [208], [212], [213], [216], [218], [221], [231], [234], [238], [239], [242], [243], [244], [245], [246], [248], [249], [250], [251], [252], [253], [254], [255], [256], [258], [259], [260], [262], [263], [264], [265], [268], [269], [270], [271], [274], [275], [278], [279], [284], [285], [286], [287], [288], [289], [290], [291], [292], [294], [295], [296], [297] [2018-11-10 11:53:17,811 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:53:17,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:53:28,144 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:53:28,144 INFO L272 AbstractInterpreter]: Visited 63 different actions 92 times. Merged at 5 different actions 5 times. Never widened. Never found a fixpoint. Largest state had 132 variables. [2018-11-10 11:53:28,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:28,150 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:53:46,037 INFO L227 lantSequenceWeakener]: Weakened 74 states. On average, predicates are now at 97.24% of their original sizes. [2018-11-10 11:53:46,037 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:53:46,588 INFO L415 sIntCurrentIteration]: We unified 133 AI predicates to 133 [2018-11-10 11:53:46,588 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:53:46,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:53:46,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-10 11:53:46,588 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:53:46,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 11:53:46,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 11:53:46,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2018-11-10 11:53:46,589 INFO L87 Difference]: Start difference. First operand 901 states and 1083 transitions. Second operand 25 states. [2018-11-10 11:54:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:54:15,661 INFO L93 Difference]: Finished difference Result 1441 states and 1739 transitions. [2018-11-10 11:54:15,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 11:54:15,661 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 134 [2018-11-10 11:54:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:54:15,663 INFO L225 Difference]: With dead ends: 1441 [2018-11-10 11:54:15,664 INFO L226 Difference]: Without dead ends: 564 [2018-11-10 11:54:15,666 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 11:54:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-11-10 11:54:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 515. [2018-11-10 11:54:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-10 11:54:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 598 transitions. [2018-11-10 11:54:15,712 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 598 transitions. Word has length 134 [2018-11-10 11:54:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:54:15,712 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 598 transitions. [2018-11-10 11:54:15,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 11:54:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 598 transitions. [2018-11-10 11:54:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 11:54:15,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:54:15,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:54:15,714 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:54:15,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:54:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash -200913251, now seen corresponding path program 1 times [2018-11-10 11:54:15,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:54:15,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:54:15,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:54:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:54:15,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:54:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:54:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 11:54:15,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:54:15,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:54:15,799 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:54:15,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:54:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:54:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:54:15,800 INFO L87 Difference]: Start difference. First operand 515 states and 598 transitions. Second operand 6 states. [2018-11-10 11:54:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:54:15,956 INFO L93 Difference]: Finished difference Result 524 states and 607 transitions. [2018-11-10 11:54:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:54:15,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-10 11:54:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:54:15,958 INFO L225 Difference]: With dead ends: 524 [2018-11-10 11:54:15,958 INFO L226 Difference]: Without dead ends: 521 [2018-11-10 11:54:15,959 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 11:54:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-11-10 11:54:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 515. [2018-11-10 11:54:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-10 11:54:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 597 transitions. [2018-11-10 11:54:16,004 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 597 transitions. Word has length 134 [2018-11-10 11:54:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:54:16,004 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 597 transitions. [2018-11-10 11:54:16,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:54:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 597 transitions. [2018-11-10 11:54:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 11:54:16,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:54:16,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:54:16,007 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:54:16,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:54:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2094909526, now seen corresponding path program 1 times [2018-11-10 11:54:16,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:54:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:54:16,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:54:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:54:16,008 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:54:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:54:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 11:54:16,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:54:16,154 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:54:16,155 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-11-10 11:54:16,155 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [37], [38], [39], [41], [44], [48], [49], [50], [55], [59], [60], [61], [64], [66], [72], [76], [79], [80], [81], [85], [91], [95], [99], [102], [105], [107], [113], [115], [118], [133], [134], [135], [136], [137], [138], [139], [140], [141], [143], [148], [150], [151], [188], [191], [195], [201], [204], [208], [212], [213], [216], [218], [221], [228], [231], [234], [238], [239], [242], [243], [244], [245], [246], [248], [249], [250], [251], [252], [253], [254], [255], [256], [258], [259], [260], [262], [263], [266], [267], [268], [269], [270], [271], [274], [275], [278], [279], [284], [285], [286], [287], [288], [289], [290], [291], [292], [294], [295], [296], [297], [300], [301] [2018-11-10 11:54:16,160 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:54:16,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:54:53,745 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:54:53,745 INFO L272 AbstractInterpreter]: Visited 97 different actions 330 times. Merged at 17 different actions 31 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 132 variables. [2018-11-10 11:54:53,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:54:53,749 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:55:12,690 INFO L227 lantSequenceWeakener]: Weakened 116 states. On average, predicates are now at 97.39% of their original sizes. [2018-11-10 11:55:12,690 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:55:14,200 INFO L415 sIntCurrentIteration]: We unified 137 AI predicates to 137 [2018-11-10 11:55:14,200 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:55:14,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:55:14,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [10] total 50 [2018-11-10 11:55:14,201 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:14,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-10 11:55:14,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-10 11:55:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1520, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 11:55:14,202 INFO L87 Difference]: Start difference. First operand 515 states and 597 transitions. Second operand 42 states. [2018-11-10 11:55:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:55:49,986 INFO L93 Difference]: Finished difference Result 1233 states and 1532 transitions. [2018-11-10 11:55:49,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 11:55:49,987 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 138 [2018-11-10 11:55:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:55:49,989 INFO L225 Difference]: With dead ends: 1233 [2018-11-10 11:55:49,990 INFO L226 Difference]: Without dead ends: 800 [2018-11-10 11:55:49,992 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 88 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=519, Invalid=4037, Unknown=0, NotChecked=0, Total=4556 [2018-11-10 11:55:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-11-10 11:55:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 655. [2018-11-10 11:55:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-11-10 11:55:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 750 transitions. [2018-11-10 11:55:50,049 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 750 transitions. Word has length 138 [2018-11-10 11:55:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:55:50,049 INFO L481 AbstractCegarLoop]: Abstraction has 655 states and 750 transitions. [2018-11-10 11:55:50,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-10 11:55:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 750 transitions. [2018-11-10 11:55:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 11:55:50,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:55:50,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:55:50,051 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:55:50,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:50,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1925298156, now seen corresponding path program 1 times [2018-11-10 11:55:50,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:55:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:55:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:50,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:55:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:55:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 11:55:50,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:55:50,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 11:55:50,143 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:50,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:55:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:55:50,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:55:50,144 INFO L87 Difference]: Start difference. First operand 655 states and 750 transitions. Second operand 9 states. [2018-11-10 11:55:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:55:50,231 INFO L93 Difference]: Finished difference Result 1202 states and 1393 transitions. [2018-11-10 11:55:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:55:50,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-11-10 11:55:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:55:50,234 INFO L225 Difference]: With dead ends: 1202 [2018-11-10 11:55:50,234 INFO L226 Difference]: Without dead ends: 627 [2018-11-10 11:55:50,236 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 11:55:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-10 11:55:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-11-10 11:55:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-10 11:55:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 717 transitions. [2018-11-10 11:55:50,290 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 717 transitions. Word has length 138 [2018-11-10 11:55:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:55:50,290 INFO L481 AbstractCegarLoop]: Abstraction has 627 states and 717 transitions. [2018-11-10 11:55:50,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:55:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 717 transitions. [2018-11-10 11:55:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 11:55:50,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:55:50,292 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, 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 11:55:50,293 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:55:50,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:50,293 INFO L82 PathProgramCache]: Analyzing trace with hash 530958435, now seen corresponding path program 1 times [2018-11-10 11:55:50,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:55:50,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:50,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:55:50,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:50,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:55:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:55:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 11:55:50,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:55:50,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:55:50,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:50,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:55:50,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:55:50,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:55:50,399 INFO L87 Difference]: Start difference. First operand 627 states and 717 transitions. Second operand 6 states. [2018-11-10 11:55:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:55:50,484 INFO L93 Difference]: Finished difference Result 1189 states and 1383 transitions. [2018-11-10 11:55:50,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:55:50,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2018-11-10 11:55:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:55:50,486 INFO L225 Difference]: With dead ends: 1189 [2018-11-10 11:55:50,486 INFO L226 Difference]: Without dead ends: 642 [2018-11-10 11:55:50,487 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 11:55:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-10 11:55:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2018-11-10 11:55:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-11-10 11:55:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 733 transitions. [2018-11-10 11:55:50,519 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 733 transitions. Word has length 186 [2018-11-10 11:55:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:55:50,520 INFO L481 AbstractCegarLoop]: Abstraction has 642 states and 733 transitions. [2018-11-10 11:55:50,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:55:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 733 transitions. [2018-11-10 11:55:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 11:55:50,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:55:50,522 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, 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 11:55:50,523 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:55:50,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash 553590689, now seen corresponding path program 1 times [2018-11-10 11:55:50,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:55:50,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:50,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:55:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:50,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:55:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:55:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 11:55:50,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:55:50,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 11:55:50,599 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:50,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:55:50,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:55:50,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:55:50,599 INFO L87 Difference]: Start difference. First operand 642 states and 733 transitions. Second operand 8 states. [2018-11-10 11:55:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:55:50,633 INFO L93 Difference]: Finished difference Result 810 states and 925 transitions. [2018-11-10 11:55:50,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:55:50,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 186 [2018-11-10 11:55:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:55:50,634 INFO L225 Difference]: With dead ends: 810 [2018-11-10 11:55:50,634 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:55:50,635 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 11:55:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:55:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:55:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:55:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:55:50,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2018-11-10 11:55:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:55:50,636 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:55:50,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:55:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:55:50,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:55:50,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:55:50,889 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 233 [2018-11-10 11:55:50,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:55:51,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:55:51,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:55:51,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:55:51,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:55:51,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:55:51,192 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 245 [2018-11-10 11:55:51,731 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 236 [2018-11-10 11:55:51,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:55:52,308 WARN L179 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 268 [2018-11-10 11:55:52,670 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 56 [2018-11-10 11:55:52,843 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 41 [2018-11-10 11:55:53,365 WARN L179 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 49 [2018-11-10 11:55:54,208 WARN L179 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 67 [2018-11-10 11:55:54,331 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 33 [2018-11-10 11:55:54,572 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 55 [2018-11-10 11:55:54,906 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 41 [2018-11-10 11:55:55,045 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 48 [2018-11-10 11:55:55,198 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 43 [2018-11-10 11:55:55,381 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 54 [2018-11-10 11:55:55,555 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 33 [2018-11-10 11:55:56,564 WARN L179 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 57 [2018-11-10 11:55:57,401 WARN L179 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 314 DAG size of output: 57 [2018-11-10 11:55:57,517 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 35 [2018-11-10 11:55:57,712 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 40 [2018-11-10 11:55:57,961 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 43 [2018-11-10 11:55:58,070 INFO L428 ceAbstractionStarter]: At program point select_helpersFINAL(lines 546 552) the Hoare annotation is: true [2018-11-10 11:55:58,070 INFO L425 ceAbstractionStarter]: For program point select_helpersEXIT(lines 546 552) no Hoare annotation was computed. [2018-11-10 11:55:58,070 INFO L425 ceAbstractionStarter]: For program point valid_productEXIT(lines 553 561) no Hoare annotation was computed. [2018-11-10 11:55:58,070 INFO L428 ceAbstractionStarter]: At program point valid_productENTRY(lines 553 561) the Hoare annotation is: true [2018-11-10 11:55:58,070 INFO L425 ceAbstractionStarter]: For program point valid_productFINAL(lines 553 561) no Hoare annotation was computed. [2018-11-10 11:55:58,070 INFO L421 ceAbstractionStarter]: At program point L577(line 577) the Hoare annotation is: (let ((.cse0 (* 2 ~pumpRunning~0))) (and (or (< 3 (+ ~pumpRunning~0 ~waterLevel~0)) (< (+ ~systemActive~0 ~waterLevel~0) 3) (< .cse0 2) (< 2 (+ ~pumpRunning~0 ~systemActive~0))) (or (< (+ ~pumpRunning~0 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) (< 0 .cse0)))) [2018-11-10 11:55:58,070 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2018-11-10 11:55:58,070 INFO L428 ceAbstractionStarter]: At program point __utac_acc__Specification4_spec__1ENTRY(lines 563 587) the Hoare annotation is: true [2018-11-10 11:55:58,071 INFO L421 ceAbstractionStarter]: At program point L573(line 573) the Hoare annotation is: (let ((.cse0 (* 2 ~pumpRunning~0))) (and (or (< 3 (+ ~pumpRunning~0 ~waterLevel~0)) (< (+ ~systemActive~0 ~waterLevel~0) 3) (< .cse0 2) (< 2 (+ ~pumpRunning~0 ~systemActive~0))) (or (< (+ ~pumpRunning~0 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) (< 0 .cse0)))) [2018-11-10 11:55:58,071 INFO L425 ceAbstractionStarter]: For program point L573-1(line 573) no Hoare annotation was computed. [2018-11-10 11:55:58,071 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 584) no Hoare annotation was computed. [2018-11-10 11:55:58,071 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 563 587) no Hoare annotation was computed. [2018-11-10 11:55:58,071 INFO L428 ceAbstractionStarter]: At program point L569(line 569) the Hoare annotation is: true [2018-11-10 11:55:58,071 INFO L425 ceAbstractionStarter]: For program point L569-1(line 569) no Hoare annotation was computed. [2018-11-10 11:55:58,071 INFO L425 ceAbstractionStarter]: For program point __utac_acc__Specification4_spec__1EXIT(lines 563 587) no Hoare annotation was computed. [2018-11-10 11:55:58,071 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 238 260) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= (+ ~systemActive~0 ~waterLevel~0) 2) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 11:55:58,071 INFO L421 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (and (= main_~tmp~0 1) (= main_~tmp~0 ~waterLevel~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 11:55:58,071 INFO L421 ceAbstractionStarter]: At program point L250-1(line 250) the Hoare annotation is: (or (and (= main_~tmp~0 1) (= main_~tmp~0 ~waterLevel~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 11:55:58,071 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 238 260) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 255) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point L248-1(lines 248 255) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point L246(line 246) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L421 ceAbstractionStarter]: At program point L245(line 245) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= (+ ~systemActive~0 ~waterLevel~0) 2) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 11:55:58,072 INFO L421 ceAbstractionStarter]: At program point L244(line 244) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= (+ ~systemActive~0 ~waterLevel~0) 2) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 11:55:58,072 INFO L421 ceAbstractionStarter]: At program point L244-1(line 244) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= (+ ~systemActive~0 ~waterLevel~0) 2) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 238 260) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point isPumpRunningEXIT(lines 379 387) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L428 ceAbstractionStarter]: At program point isPumpRunningENTRY(lines 379 387) the Hoare annotation is: true [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point isPumpRunningFINAL(lines 379 387) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point L450-1(line 450) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L428 ceAbstractionStarter]: At program point isLowWaterLevelENTRY(lines 443 461) the Hoare annotation is: true [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point isLowWaterLevelEXIT(lines 443 461) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point L452(lines 452 456) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L428 ceAbstractionStarter]: At program point L450(line 450) the Hoare annotation is: true [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point L452-2(lines 452 456) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point isLowWaterLevelFINAL(lines 443 461) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L425 ceAbstractionStarter]: For program point select_featuresEXIT(lines 539 545) no Hoare annotation was computed. [2018-11-10 11:55:58,072 INFO L428 ceAbstractionStarter]: At program point select_featuresFINAL(lines 539 545) the Hoare annotation is: true [2018-11-10 11:55:58,073 INFO L421 ceAbstractionStarter]: At program point runTestENTRY(lines 225 234) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= (+ ~systemActive~0 ~waterLevel~0) 2) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point runTestEXIT(lines 225 234) no Hoare annotation was computed. [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point runTestFINAL(lines 225 234) no Hoare annotation was computed. [2018-11-10 11:55:58,073 INFO L421 ceAbstractionStarter]: At program point deactivatePumpENTRY(lines 360 367) the Hoare annotation is: (or (= |old(~pumpRunning~0)| ~pumpRunning~0) (< (* 2 ~systemActive~0) 2) (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point deactivatePumpEXIT(lines 360 367) no Hoare annotation was computed. [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point deactivatePumpFINAL(lines 360 367) no Hoare annotation was computed. [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 146) no Hoare annotation was computed. [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point isHighWaterSensorDryEXIT(lines 136 149) no Hoare annotation was computed. [2018-11-10 11:55:58,073 INFO L428 ceAbstractionStarter]: At program point isHighWaterSensorDryENTRY(lines 136 149) the Hoare annotation is: true [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point isHighWaterSensorDryFINAL(lines 136 149) no Hoare annotation was computed. [2018-11-10 11:55:58,073 INFO L421 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (.cse2 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 .cse1 (not (= ~waterLevel~0 1)) .cse2) (or .cse0 (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or .cse1 (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse2 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))))) [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point L346-1(lines 327 351) no Hoare annotation was computed. [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point processEnvironmentEXIT(lines 327 351) no Hoare annotation was computed. [2018-11-10 11:55:58,073 INFO L421 ceAbstractionStarter]: At program point L341(line 341) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or .cse0 (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 (not (= ~waterLevel~0 1)) .cse1) (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-11-10 11:55:58,073 INFO L421 ceAbstractionStarter]: At program point processEnvironmentENTRY(lines 327 351) the Hoare annotation is: (let ((.cse2 (< 0 (* 2 |old(~pumpRunning~0)|))) (.cse1 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (.cse0 (< (* 2 ~systemActive~0) 2))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 .cse1 (not (= ~waterLevel~0 1)) .cse2) (or .cse1 (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse2 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))) (or .cse1 .cse0 (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))))) [2018-11-10 11:55:58,073 INFO L421 ceAbstractionStarter]: At program point L337(line 337) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or .cse0 (and (= processEnvironment_~tmp~2 1) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 (not (= ~waterLevel~0 1)) .cse1) (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-11-10 11:55:58,073 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 343) no Hoare annotation was computed. [2018-11-10 11:55:58,074 INFO L421 ceAbstractionStarter]: At program point L333(line 333) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 (not (= ~waterLevel~0 1)) .cse1) (or (= |old(~pumpRunning~0)| ~pumpRunning~0) .cse0 (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-11-10 11:55:58,074 INFO L425 ceAbstractionStarter]: For program point L333-1(line 333) no Hoare annotation was computed. [2018-11-10 11:55:58,074 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 348) no Hoare annotation was computed. [2018-11-10 11:55:58,074 INFO L425 ceAbstractionStarter]: For program point processEnvironment__wrappee__baseEXIT(lines 293 299) no Hoare annotation was computed. [2018-11-10 11:55:58,074 INFO L428 ceAbstractionStarter]: At program point processEnvironment__wrappee__baseFINAL(lines 293 299) the Hoare annotation is: true [2018-11-10 11:55:58,074 INFO L421 ceAbstractionStarter]: At program point testENTRY(lines 463 526) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= (+ ~systemActive~0 ~waterLevel~0) 2) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 11:55:58,074 INFO L425 ceAbstractionStarter]: For program point L475(lines 475 479) no Hoare annotation was computed. [2018-11-10 11:55:58,074 INFO L425 ceAbstractionStarter]: For program point L473-1(lines 473 518) no Hoare annotation was computed. [2018-11-10 11:55:58,074 INFO L425 ceAbstractionStarter]: For program point testFINAL(lines 463 526) no Hoare annotation was computed. [2018-11-10 11:55:58,074 INFO L421 ceAbstractionStarter]: At program point L519(lines 472 520) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-11-10 11:55:58,074 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 513) no Hoare annotation was computed. [2018-11-10 11:55:58,074 INFO L421 ceAbstractionStarter]: At program point L509-2(lines 503 514) the Hoare annotation is: (let ((.cse2 (<= 2 (+ ~pumpRunning~0 ~waterLevel~0))) (.cse3 (+ ~systemActive~0 2147483646))) (let ((.cse0 (let ((.cse4 (+ ~pumpRunning~0 1))) (or (and (<= (+ test_~splverifierCounter~0 2) ~waterLevel~0) (<= ~waterLevel~0 (+ ~pumpRunning~0 2)) (<= .cse4 ~systemActive~0) (<= ~pumpRunning~0 test_~splverifierCounter~0) (<= 0 (+ ~waterLevel~0 test_~tmp___0~2 2147483646)) .cse2 (<= test_~tmp___0~2 (+ ~waterLevel~0 2147483645))) (let ((.cse5 (+ test_~splverifierCounter~0 1))) (and (<= .cse4 ~waterLevel~0) (<= (+ ~pumpRunning~0 test_~splverifierCounter~0) 1) (<= ~pumpRunning~0 .cse5) (<= .cse5 ~waterLevel~0) (<= 1 (+ ~waterLevel~0 test_~splverifierCounter~0)) (<= ~waterLevel~0 .cse4) (<= 0 (+ ~systemActive~0 test_~tmp___0~2 2147483647)) (<= test_~tmp___0~2 .cse3)))))) (.cse1 (and (<= test_~tmp___2~0 .cse3) (<= 0 (+ test_~splverifierCounter~0 test_~tmp___2~0 2147483648))))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= test_~splverifierCounter~0 (+ test_~tmp~5 2147483648)) (<= test_~tmp~5 (+ ~pumpRunning~0 2147483647))) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))))) [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point L474(lines 473 518) no Hoare annotation was computed. [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point L503(lines 503 514) no Hoare annotation was computed. [2018-11-10 11:55:58,075 INFO L421 ceAbstractionStarter]: At program point L495(line 495) the Hoare annotation is: (let ((.cse1 (<= (+ ~systemActive~0 ~waterLevel~0) 3)) (.cse2 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse4 (<= 0 (+ ~systemActive~0 test_~tmp___0~2 2147483647))) (.cse5 (<= test_~tmp___0~2 (+ ~systemActive~0 2147483646))) (.cse0 (= test_~splverifierCounter~0 0)) (.cse3 (= ~pumpRunning~0 0))) (or (and (and (<= 0 (+ ~waterLevel~0 test_~tmp___0~2 2147483646)) .cse0 (<= test_~tmp___0~2 (+ ~waterLevel~0 2147483645))) .cse1 (<= 2 .cse2) .cse3) (and (= ~pumpRunning~0 1) (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) .cse1 .cse4 .cse5) .cse0) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (and (<= 1 .cse2) (<= ~waterLevel~0 ~systemActive~0) .cse4 .cse5 .cse0) (<= test_~splverifierCounter~0 (+ test_~tmp~5 2147483648)) .cse3 (<= test_~tmp~5 (+ ~pumpRunning~0 2147483647))) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|)))) [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 499) no Hoare annotation was computed. [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 493 499) no Hoare annotation was computed. [2018-11-10 11:55:58,075 INFO L421 ceAbstractionStarter]: At program point L485(line 485) the Hoare annotation is: (let ((.cse0 (<= test_~splverifierCounter~0 (+ test_~tmp~5 2147483648))) (.cse1 (= test_~splverifierCounter~0 0))) (or (and (<= (* 2 test_~tmp~5) 4294967294) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= (+ ~waterLevel~0 test_~splverifierCounter~0) 1) .cse0 (= ~pumpRunning~0 0) .cse1) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (let ((.cse2 (+ ~systemActive~0 2147483646))) (and (and (<= 0 (+ ~systemActive~0 test_~tmp___0~2 2147483647)) (<= test_~tmp___0~2 .cse2)) (<= (+ ~pumpRunning~0 test_~tmp~5) 2147483648) (= ~pumpRunning~0 1) .cse0 (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (<= test_~tmp___2~0 .cse2) (<= 0 (+ test_~splverifierCounter~0 test_~tmp___2~0 2147483648))) .cse1)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|)))) [2018-11-10 11:55:58,075 INFO L421 ceAbstractionStarter]: At program point L516(lines 473 518) the Hoare annotation is: (let ((.cse0 (= test_~splverifierCounter~0 0))) (or (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= (+ ~waterLevel~0 test_~splverifierCounter~0) 1) (= ~pumpRunning~0 0) .cse0) (let ((.cse1 (+ ~systemActive~0 2147483646))) (and (and (<= 0 (+ ~systemActive~0 test_~tmp___0~2 2147483647)) (<= test_~tmp___0~2 .cse1)) (= ~pumpRunning~0 1) (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (<= test_~tmp___2~0 .cse1) (<= 0 (+ test_~splverifierCounter~0 test_~tmp___2~0 2147483648))) .cse0)) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|)))) [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point L483(lines 483 489) no Hoare annotation was computed. [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point testEXIT(lines 463 526) no Hoare annotation was computed. [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 483 489) no Hoare annotation was computed. [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point isLowWaterSensorDryFINAL(lines 150 158) no Hoare annotation was computed. [2018-11-10 11:55:58,075 INFO L428 ceAbstractionStarter]: At program point isLowWaterSensorDryENTRY(lines 150 158) the Hoare annotation is: true [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point isLowWaterSensorDryEXIT(lines 150 158) no Hoare annotation was computed. [2018-11-10 11:55:58,075 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~pumpRunning~0)| ~pumpRunning~0) [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point activatePumpFINAL(lines 352 359) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point activatePumpEXIT(lines 352 359) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L421 ceAbstractionStarter]: At program point activatePumpENTRY(lines 352 359) the Hoare annotation is: (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) (= |old(~pumpRunning~0)| ~pumpRunning~0)) [2018-11-10 11:55:58,076 INFO L428 ceAbstractionStarter]: At program point getWaterLevelENTRY(lines 127 135) the Hoare annotation is: true [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point getWaterLevelFINAL(lines 127 135) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point getWaterLevelEXIT(lines 127 135) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point L433(lines 433 437) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point isHighWaterLevelEXIT(lines 424 442) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L428 ceAbstractionStarter]: At program point L431(line 431) the Hoare annotation is: true [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point L433-2(lines 433 437) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point L431-1(line 431) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L428 ceAbstractionStarter]: At program point isHighWaterLevelENTRY(lines 424 442) the Hoare annotation is: true [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point isHighWaterLevelFINAL(lines 424 442) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L428 ceAbstractionStarter]: At program point changeMethaneLevelENTRY(lines 83 94) the Hoare annotation is: true [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 83 94) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point changeMethaneLevelEXIT(lines 83 94) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point cleanupEXIT(lines 162 191) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 180) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L428 ceAbstractionStarter]: At program point L176-1(lines 176 180) the Hoare annotation is: true [2018-11-10 11:55:58,076 INFO L425 ceAbstractionStarter]: For program point L172-1(lines 172 186) no Hoare annotation was computed. [2018-11-10 11:55:58,076 INFO L428 ceAbstractionStarter]: At program point L172-3(lines 172 186) the Hoare annotation is: true [2018-11-10 11:55:58,077 INFO L428 ceAbstractionStarter]: At program point L168(line 168) the Hoare annotation is: true [2018-11-10 11:55:58,077 INFO L425 ceAbstractionStarter]: For program point L168-1(line 168) no Hoare annotation was computed. [2018-11-10 11:55:58,077 INFO L428 ceAbstractionStarter]: At program point cleanupENTRY(lines 162 191) the Hoare annotation is: true [2018-11-10 11:55:58,077 INFO L428 ceAbstractionStarter]: At program point L187(lines 162 191) the Hoare annotation is: true [2018-11-10 11:55:58,077 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-10 11:55:58,077 INFO L425 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2018-11-10 11:55:58,077 INFO L421 ceAbstractionStarter]: At program point L282(line 282) the Hoare annotation is: (let ((.cse3 (* 2 |old(~pumpRunning~0)|)) (.cse4 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse7 (+ ~systemActive~0 ~waterLevel~0))) (let ((.cse1 (<= .cse7 2)) (.cse0 (<= 2 .cse4)) (.cse5 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (.cse2 (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3)) (.cse6 (< 0 .cse3))) (and (or (and .cse0 .cse1 (<= ~pumpRunning~0 ~systemActive~0)) (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) .cse2 (< .cse3 2) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0)))) (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (<= 1 .cse4) .cse1 .cse5) (not (= |old(~waterLevel~0)| 1)) .cse6) (or (and (<= .cse7 3) .cse0 .cse5) (or .cse2 (< |old(~waterLevel~0)| (+ ~systemActive~0 1)) .cse6 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|)))))) [2018-11-10 11:55:58,077 INFO L421 ceAbstractionStarter]: At program point L280(lines 280 286) the Hoare annotation is: (let ((.cse4 (* 2 |old(~pumpRunning~0)|)) (.cse5 (+ ~systemActive~0 ~waterLevel~0))) (let ((.cse0 (<= 1 (+ ~pumpRunning~0 ~waterLevel~0))) (.cse1 (<= .cse5 2)) (.cse3 (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3)) (.cse2 (< 0 .cse4))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and .cse0 .cse1 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (not (= |old(~waterLevel~0)| 1)) .cse2) (or (and .cse0 .cse1 (= ~pumpRunning~0 0)) (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) .cse3 (< .cse4 2) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0)))) (or (or .cse3 (< |old(~waterLevel~0)| (+ ~systemActive~0 1)) .cse2 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|)) (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) (<= .cse5 3) (= ~pumpRunning~0 1)))))) [2018-11-10 11:55:58,077 INFO L421 ceAbstractionStarter]: At program point L275(line 275) the Hoare annotation is: (let ((.cse1 (* 2 |old(~pumpRunning~0)|))) (let ((.cse0 (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3)) (.cse2 (< 0 .cse1))) (and (or (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) .cse0 (< .cse1 2) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0)))) (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) .cse2) (or .cse0 (< |old(~waterLevel~0)| (+ ~systemActive~0 1)) .cse2 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|))))) [2018-11-10 11:55:58,077 INFO L425 ceAbstractionStarter]: For program point L273(lines 272 291) no Hoare annotation was computed. [2018-11-10 11:55:58,078 INFO L421 ceAbstractionStarter]: At program point timeShiftENTRY(lines 269 292) the Hoare annotation is: (let ((.cse3 (* 2 |old(~pumpRunning~0)|)) (.cse5 (+ ~systemActive~0 ~waterLevel~0))) (let ((.cse0 (<= .cse5 3)) (.cse4 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse1 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (.cse2 (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3)) (.cse6 (< 0 .cse3))) (and (or (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) .cse0 .cse1) (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) .cse2 (< .cse3 2) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0)))) (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (<= 1 .cse4) (<= .cse5 2) .cse1) (not (= |old(~waterLevel~0)| 1)) .cse6) (or (and .cse0 (<= 2 .cse4) .cse1) (or .cse2 (< |old(~waterLevel~0)| (+ ~systemActive~0 1)) .cse6 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|)))))) [2018-11-10 11:55:58,078 INFO L425 ceAbstractionStarter]: For program point timeShiftEXIT(lines 269 292) no Hoare annotation was computed. [2018-11-10 11:55:58,078 INFO L425 ceAbstractionStarter]: For program point timeShiftFINAL(lines 269 292) no Hoare annotation was computed. [2018-11-10 11:55:58,078 INFO L421 ceAbstractionStarter]: At program point lowerWaterLevelENTRY(lines 59 70) the Hoare annotation is: (or (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) (<= (+ ~systemActive~0 ~waterLevel~0) 3)) (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 11:55:58,078 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 59 70) no Hoare annotation was computed. [2018-11-10 11:55:58,078 INFO L425 ceAbstractionStarter]: For program point lowerWaterLevelEXIT(lines 59 70) no Hoare annotation was computed. [2018-11-10 11:55:58,078 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:55:58,078 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= (+ ~pumpRunning~0 1) ~systemActive~0) (<= (+ ~systemActive~0 ~waterLevel~0) 2) (= ~pumpRunning~0 0)) [2018-11-10 11:55:58,078 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:55:58,078 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:55:58,078 INFO L425 ceAbstractionStarter]: For program point setupEXIT(lines 217 223) no Hoare annotation was computed. [2018-11-10 11:55:58,078 INFO L428 ceAbstractionStarter]: At program point setupFINAL(lines 217 223) the Hoare annotation is: true [2018-11-10 11:55:58,079 INFO L421 ceAbstractionStarter]: At program point processEnvironment__wrappee__highWaterSensorENTRY(lines 301 325) the Hoare annotation is: (let ((.cse0 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (.cse1 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) .cse0 (not (= ~waterLevel~0 1)) .cse1) (or .cse0 (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))))) [2018-11-10 11:55:58,079 INFO L421 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (let ((.cse0 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) .cse0) (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse0 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-11-10 11:55:58,079 INFO L425 ceAbstractionStarter]: For program point L320-1(lines 301 325) no Hoare annotation was computed. [2018-11-10 11:55:58,079 INFO L425 ceAbstractionStarter]: For program point processEnvironment__wrappee__highWaterSensorEXIT(lines 301 325) no Hoare annotation was computed. [2018-11-10 11:55:58,079 INFO L421 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse0 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) .cse0 (and (= 0 processEnvironment__wrappee__highWaterSensor_~tmp~1) (= |old(~pumpRunning~0)| ~pumpRunning~0))) (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse0 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-11-10 11:55:58,079 INFO L421 ceAbstractionStarter]: At program point L311(line 311) the Hoare annotation is: (let ((.cse0 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) .cse0) (or (and (<= 3 (+ processEnvironment__wrappee__highWaterSensor_~tmp~1 ~waterLevel~0)) (= 0 ~pumpRunning~0) (<= (+ processEnvironment__wrappee__highWaterSensor_~tmp~1 1) ~waterLevel~0)) (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse0 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))))) [2018-11-10 11:55:58,079 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 317) no Hoare annotation was computed. [2018-11-10 11:55:58,079 INFO L421 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse0 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (.cse1 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) .cse0 (not (= ~waterLevel~0 1)) .cse1) (or .cse0 (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) .cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))))) [2018-11-10 11:55:58,080 INFO L425 ceAbstractionStarter]: For program point L307-1(line 307) no Hoare annotation was computed. [2018-11-10 11:55:58,080 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 322) no Hoare annotation was computed. [2018-11-10 11:55:58,080 INFO L425 ceAbstractionStarter]: For program point waterRiseEXIT(lines 71 82) no Hoare annotation was computed. [2018-11-10 11:55:58,080 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 71 82) no Hoare annotation was computed. [2018-11-10 11:55:58,080 INFO L421 ceAbstractionStarter]: At program point waterRiseENTRY(lines 71 82) the Hoare annotation is: (let ((.cse1 (+ ~systemActive~0 ~waterLevel~0)) (.cse0 (+ ~pumpRunning~0 1)) (.cse2 (* 2 ~pumpRunning~0))) (and (or (and (<= .cse0 ~waterLevel~0) (<= .cse1 3)) (or (< 3 (+ ~pumpRunning~0 |old(~waterLevel~0)|)) (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3) (< .cse2 2) (< 2 (+ ~pumpRunning~0 ~systemActive~0)))) (or (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= .cse1 2)) (or (< .cse0 ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 .cse2))))) [2018-11-10 11:55:58,080 INFO L425 ceAbstractionStarter]: For program point __automaton_failFINAL(lines 40 47) no Hoare annotation was computed. [2018-11-10 11:55:58,080 INFO L428 ceAbstractionStarter]: At program point __automaton_failENTRY(lines 40 47) the Hoare annotation is: true [2018-11-10 11:55:58,080 INFO L425 ceAbstractionStarter]: For program point __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2018-11-10 11:55:58,080 INFO L425 ceAbstractionStarter]: For program point __automaton_failEXIT(lines 40 47) no Hoare annotation was computed. [2018-11-10 11:55:58,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:55:58 BoogieIcfgContainer [2018-11-10 11:55:58,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:55:58,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:55:58,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:55:58,090 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:55:58,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:52:01" (3/4) ... [2018-11-10 11:55:58,093 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:55:58,097 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_helpers [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure valid_product [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __utac_acc__Specification4_spec__1 [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isLowWaterLevel [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_features [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure runTest [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isHighWaterSensorDry [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure test [2018-11-10 11:55:58,098 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isLowWaterSensorDry [2018-11-10 11:55:58,099 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:55:58,099 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activatePump [2018-11-10 11:55:58,099 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getWaterLevel [2018-11-10 11:55:58,099 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isHighWaterLevel [2018-11-10 11:55:58,099 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2018-11-10 11:55:58,099 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2018-11-10 11:55:58,099 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2018-11-10 11:55:58,099 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure lowerWaterLevel [2018-11-10 11:55:58,099 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup [2018-11-10 11:55:58,100 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2018-11-10 11:55:58,100 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2018-11-10 11:55:58,100 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __automaton_fail [2018-11-10 11:55:58,107 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 139 nodes and edges [2018-11-10 11:55:58,107 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2018-11-10 11:55:58,107 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-10 11:55:58,127 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 <= pumpRunning + waterLevel && waterLevel + splverifierCounter <= 1) && pumpRunning == 0) && splverifierCounter == 0) || ((((0 <= systemActive + tmp___0 + 2147483647 && tmp___0 <= systemActive + 2147483646) && pumpRunning == 1) && ((pumpRunning + 1 <= waterLevel && systemActive + waterLevel <= 3) && tmp___2 <= systemActive + 2147483646) && 0 <= splverifierCounter + tmp___2 + 2147483648) && splverifierCounter == 0)) || \old(pumpRunning) + 1 < systemActive) || 2 * systemActive < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) [2018-11-10 11:55:58,127 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(pumpRunning) + 1 < systemActive || 2 * systemActive < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) [2018-11-10 11:55:58,165 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6b72f39f-daa5-4c14-9460-b5f3618561f0/bin-2019/utaipan/witness.graphml [2018-11-10 11:55:58,165 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:55:58,165 INFO L168 Benchmark]: Toolchain (without parser) took 237652.40 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 955.8 MB in the beginning and 1.5 GB in the end (delta: -562.0 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-11-10 11:55:58,166 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:55:58,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.45 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 928.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:55:58,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 928.9 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:55:58,166 INFO L168 Benchmark]: Boogie Preprocessor took 31.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:55:58,166 INFO L168 Benchmark]: RCFGBuilder took 735.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 93.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:55:58,167 INFO L168 Benchmark]: TraceAbstraction took 236310.58 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -456.0 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-11-10 11:55:58,167 INFO L168 Benchmark]: Witness Printer took 75.24 ms. Allocated memory is still 5.0 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:55:58,168 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 403.45 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 928.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 928.9 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 735.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 93.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 236310.58 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -456.0 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 75.24 ms. Allocated memory is still 5.0 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 162]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: (((((((1 <= pumpRunning + waterLevel && waterLevel + splverifierCounter <= 1) && pumpRunning == 0) && splverifierCounter == 0) || ((((0 <= systemActive + tmp___0 + 2147483647 && tmp___0 <= systemActive + 2147483646) && pumpRunning == 1) && ((pumpRunning + 1 <= waterLevel && systemActive + waterLevel <= 3) && tmp___2 <= systemActive + 2147483646) && 0 <= splverifierCounter + tmp___2 + 2147483648) && splverifierCounter == 0)) || \old(pumpRunning) + 1 < systemActive) || 2 * systemActive < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: ((\old(pumpRunning) + 1 < systemActive || 2 * systemActive < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 143 locations, 1 error locations. SAFE Result, 236.2s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 103.5s AutomataDifference, 0.0s DeadEndRemovalTime, 7.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2263 SDtfs, 2842 SDslu, 11466 SDs, 0 SdLazy, 5441 SolverSat, 856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 78.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 694 GetRequests, 464 SyntacticMatches, 16 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2367 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=901occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 63.0s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.9942798356280643 AbsIntWeakeningRatio, 0.9407407407407408 AbsIntAvgWeakeningVarsNumRemoved, 4015.738888888889 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 403 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 58 LocationsWithAnnotation, 1930 PreInvPairs, 1956 NumberOfFragments, 2238 HoareAnnotationTreeSize, 1930 FomulaSimplifications, 114386 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 58 FomulaSimplificationsInter, 85151 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1612 NumberOfCodeBlocks, 1612 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1598 ConstructedInterpolants, 0 QuantifiedInterpolants, 259922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 381/391 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...