./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5667765c016e1c72bafcc0c365d87d7652cb3eb1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:34:16,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:34:16,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:34:16,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:34:16,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:34:16,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:34:16,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:34:16,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:34:16,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:34:16,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:34:16,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:34:16,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:34:16,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:34:16,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:34:16,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:34:16,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:34:16,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:34:16,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:34:16,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:34:16,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:34:16,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:34:16,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:34:16,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:34:16,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:34:16,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:34:16,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:34:16,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:34:16,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:34:16,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:34:16,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:34:16,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:34:16,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:34:16,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:34:16,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:34:16,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:34:16,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:34:16,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:34:16,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:34:16,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:34:16,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:34:16,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:34:16,481 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:34:16,511 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:34:16,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:34:16,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:34:16,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:34:16,514 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:34:16,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:34:16,514 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:34:16,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:34:16,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:34:16,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:34:16,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:34:16,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:34:16,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:34:16,516 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:34:16,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:34:16,516 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:34:16,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:34:16,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:34:16,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:34:16,517 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:34:16,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:34:16,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:34:16,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:34:16,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:34:16,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:34:16,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:34:16,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:34:16,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:34:16,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5667765c016e1c72bafcc0c365d87d7652cb3eb1 [2019-11-15 23:34:16,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:34:16,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:34:16,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:34:16,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:34:16,602 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:34:16,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c [2019-11-15 23:34:16,667 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/data/2476d14ea/320da1db94654449b48ba6b21e2c9efd/FLAGc45209135 [2019-11-15 23:34:17,208 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:34:17,211 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c [2019-11-15 23:34:17,228 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/data/2476d14ea/320da1db94654449b48ba6b21e2c9efd/FLAGc45209135 [2019-11-15 23:34:17,505 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/data/2476d14ea/320da1db94654449b48ba6b21e2c9efd [2019-11-15 23:34:17,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:34:17,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:34:17,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:34:17,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:34:17,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:34:17,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:34:17" (1/1) ... [2019-11-15 23:34:17,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e37240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:17, skipping insertion in model container [2019-11-15 23:34:17,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:34:17" (1/1) ... [2019-11-15 23:34:17,525 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:34:17,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:34:17,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:34:17,940 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:34:18,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:34:18,061 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:34:18,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18 WrapperNode [2019-11-15 23:34:18,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:34:18,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:34:18,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:34:18,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:34:18,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... [2019-11-15 23:34:18,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... [2019-11-15 23:34:18,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:34:18,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:34:18,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:34:18,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:34:18,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... [2019-11-15 23:34:18,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... [2019-11-15 23:34:18,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... [2019-11-15 23:34:18,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... [2019-11-15 23:34:18,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... [2019-11-15 23:34:18,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... [2019-11-15 23:34:18,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... [2019-11-15 23:34:18,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:34:18,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:34:18,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:34:18,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:34:18,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:34:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:34:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 23:34:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:34:18,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:34:19,031 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:34:19,031 INFO L284 CfgBuilder]: Removed 102 assume(true) statements. [2019-11-15 23:34:19,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:19 BoogieIcfgContainer [2019-11-15 23:34:19,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:34:19,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:34:19,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:34:19,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:34:19,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:34:17" (1/3) ... [2019-11-15 23:34:19,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a77108a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:19, skipping insertion in model container [2019-11-15 23:34:19,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:18" (2/3) ... [2019-11-15 23:34:19,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a77108a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:19, skipping insertion in model container [2019-11-15 23:34:19,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:19" (3/3) ... [2019-11-15 23:34:19,043 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product33.cil.c [2019-11-15 23:34:19,054 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:34:19,064 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:34:19,078 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:34:19,105 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:34:19,106 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:34:19,106 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:34:19,106 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:34:19,106 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:34:19,106 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:34:19,106 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:34:19,107 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:34:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-15 23:34:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:34:19,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:19,133 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:19,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:19,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1284074395, now seen corresponding path program 1 times [2019-11-15 23:34:19,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:19,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582303747] [2019-11-15 23:34:19,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:19,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:19,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:19,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582303747] [2019-11-15 23:34:19,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:19,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:34:19,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357062175] [2019-11-15 23:34:19,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:34:19,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:19,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:34:19,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:34:19,434 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-11-15 23:34:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:19,468 INFO L93 Difference]: Finished difference Result 162 states and 245 transitions. [2019-11-15 23:34:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:34:19,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-15 23:34:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:19,484 INFO L225 Difference]: With dead ends: 162 [2019-11-15 23:34:19,484 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 23:34:19,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:34:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 23:34:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-15 23:34:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 23:34:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2019-11-15 23:34:19,541 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 18 [2019-11-15 23:34:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:19,542 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2019-11-15 23:34:19,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:34:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2019-11-15 23:34:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:34:19,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:19,544 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:19,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:19,549 INFO L82 PathProgramCache]: Analyzing trace with hash 373043642, now seen corresponding path program 1 times [2019-11-15 23:34:19,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:19,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034494907] [2019-11-15 23:34:19,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:19,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:19,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:19,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034494907] [2019-11-15 23:34:19,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:19,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:19,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225691859] [2019-11-15 23:34:19,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:19,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:19,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:19,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:19,676 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand 3 states. [2019-11-15 23:34:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:19,690 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2019-11-15 23:34:19,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:19,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:34:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:19,692 INFO L225 Difference]: With dead ends: 80 [2019-11-15 23:34:19,692 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 23:34:19,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 23:34:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-15 23:34:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 23:34:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-15 23:34:19,699 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-11-15 23:34:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:19,699 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-15 23:34:19,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-15 23:34:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:34:19,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:19,701 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:19,701 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash -196588044, now seen corresponding path program 1 times [2019-11-15 23:34:19,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:19,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349553925] [2019-11-15 23:34:19,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:19,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:19,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:19,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349553925] [2019-11-15 23:34:19,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:19,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:34:19,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731645160] [2019-11-15 23:34:19,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:19,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:19,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:19,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:19,838 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-11-15 23:34:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:19,846 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-11-15 23:34:19,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:19,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:34:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:19,848 INFO L225 Difference]: With dead ends: 66 [2019-11-15 23:34:19,848 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 23:34:19,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 23:34:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-15 23:34:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 23:34:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-11-15 23:34:19,855 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-11-15 23:34:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:19,855 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-11-15 23:34:19,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-11-15 23:34:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:34:19,857 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:19,857 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:19,857 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:19,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:19,858 INFO L82 PathProgramCache]: Analyzing trace with hash 961211503, now seen corresponding path program 1 times [2019-11-15 23:34:19,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:19,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354002661] [2019-11-15 23:34:19,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:19,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:19,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:19,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354002661] [2019-11-15 23:34:19,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:19,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:34:19,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528334961] [2019-11-15 23:34:19,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:19,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:19,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:19,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:19,968 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-11-15 23:34:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:20,020 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-15 23:34:20,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:20,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:34:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:20,022 INFO L225 Difference]: With dead ends: 89 [2019-11-15 23:34:20,022 INFO L226 Difference]: Without dead ends: 59 [2019-11-15 23:34:20,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-15 23:34:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-11-15 23:34:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-15 23:34:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-11-15 23:34:20,031 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 25 [2019-11-15 23:34:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:20,031 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-11-15 23:34:20,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-11-15 23:34:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:34:20,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:20,033 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:20,033 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:20,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1128412896, now seen corresponding path program 1 times [2019-11-15 23:34:20,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:20,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494655434] [2019-11-15 23:34:20,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:20,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:20,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:20,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494655434] [2019-11-15 23:34:20,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:20,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:34:20,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653129452] [2019-11-15 23:34:20,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:20,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:20,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:20,140 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 5 states. [2019-11-15 23:34:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:20,237 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2019-11-15 23:34:20,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:34:20,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-15 23:34:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:20,241 INFO L225 Difference]: With dead ends: 149 [2019-11-15 23:34:20,241 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 23:34:20,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:34:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 23:34:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-11-15 23:34:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 23:34:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2019-11-15 23:34:20,262 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 31 [2019-11-15 23:34:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:20,263 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2019-11-15 23:34:20,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2019-11-15 23:34:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:34:20,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:20,270 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:20,271 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:20,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:20,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1016803, now seen corresponding path program 1 times [2019-11-15 23:34:20,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:20,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534900095] [2019-11-15 23:34:20,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:20,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:20,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:20,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534900095] [2019-11-15 23:34:20,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:20,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:34:20,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659006412] [2019-11-15 23:34:20,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:20,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:20,408 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand 5 states. [2019-11-15 23:34:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:20,571 INFO L93 Difference]: Finished difference Result 314 states and 451 transitions. [2019-11-15 23:34:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:34:20,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-15 23:34:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:20,574 INFO L225 Difference]: With dead ends: 314 [2019-11-15 23:34:20,574 INFO L226 Difference]: Without dead ends: 260 [2019-11-15 23:34:20,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:34:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-15 23:34:20,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2019-11-15 23:34:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 23:34:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-11-15 23:34:20,595 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 31 [2019-11-15 23:34:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:20,595 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-11-15 23:34:20,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-11-15 23:34:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:34:20,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:20,597 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:20,598 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2111743067, now seen corresponding path program 1 times [2019-11-15 23:34:20,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:20,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109444043] [2019-11-15 23:34:20,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:20,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:20,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:20,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109444043] [2019-11-15 23:34:20,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:20,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:34:20,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891257135] [2019-11-15 23:34:20,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:20,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:20,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:20,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:20,683 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 5 states. [2019-11-15 23:34:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:20,845 INFO L93 Difference]: Finished difference Result 446 states and 629 transitions. [2019-11-15 23:34:20,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:34:20,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-15 23:34:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:20,850 INFO L225 Difference]: With dead ends: 446 [2019-11-15 23:34:20,851 INFO L226 Difference]: Without dead ends: 392 [2019-11-15 23:34:20,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:34:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-15 23:34:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 152. [2019-11-15 23:34:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 23:34:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-11-15 23:34:20,893 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 32 [2019-11-15 23:34:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:20,894 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-11-15 23:34:20,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-11-15 23:34:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:34:20,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:20,898 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:20,898 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1172106979, now seen corresponding path program 1 times [2019-11-15 23:34:20,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:20,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461477253] [2019-11-15 23:34:20,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:20,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:20,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:20,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461477253] [2019-11-15 23:34:20,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:20,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:34:20,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769111204] [2019-11-15 23:34:20,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:34:20,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:20,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:34:20,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:34:20,953 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 4 states. [2019-11-15 23:34:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:21,002 INFO L93 Difference]: Finished difference Result 352 states and 487 transitions. [2019-11-15 23:34:21,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:34:21,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 23:34:21,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:21,005 INFO L225 Difference]: With dead ends: 352 [2019-11-15 23:34:21,005 INFO L226 Difference]: Without dead ends: 250 [2019-11-15 23:34:21,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-15 23:34:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2019-11-15 23:34:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 23:34:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2019-11-15 23:34:21,032 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 32 [2019-11-15 23:34:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:21,033 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2019-11-15 23:34:21,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:34:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2019-11-15 23:34:21,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:34:21,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:21,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:21,036 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:21,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:21,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1737298786, now seen corresponding path program 1 times [2019-11-15 23:34:21,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:21,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115451257] [2019-11-15 23:34:21,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:21,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:21,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:21,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115451257] [2019-11-15 23:34:21,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:21,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:34:21,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658044379] [2019-11-15 23:34:21,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:34:21,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:21,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:34:21,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:34:21,120 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 6 states. [2019-11-15 23:34:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:21,327 INFO L93 Difference]: Finished difference Result 383 states and 531 transitions. [2019-11-15 23:34:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:34:21,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-15 23:34:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:21,329 INFO L225 Difference]: With dead ends: 383 [2019-11-15 23:34:21,329 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:34:21,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:34:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:34:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 60. [2019-11-15 23:34:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 23:34:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2019-11-15 23:34:21,337 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 32 [2019-11-15 23:34:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:21,337 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2019-11-15 23:34:21,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:34:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2019-11-15 23:34:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:34:21,338 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:21,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:21,339 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:21,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1430272417, now seen corresponding path program 1 times [2019-11-15 23:34:21,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:21,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58649541] [2019-11-15 23:34:21,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:21,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:21,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:21,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58649541] [2019-11-15 23:34:21,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:21,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:34:21,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877681820] [2019-11-15 23:34:21,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:21,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:21,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:21,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:21,393 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 5 states. [2019-11-15 23:34:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:21,434 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-11-15 23:34:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:34:21,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-15 23:34:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:21,435 INFO L225 Difference]: With dead ends: 103 [2019-11-15 23:34:21,435 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:34:21,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:34:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:34:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:34:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:34:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:34:21,436 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-11-15 23:34:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:21,436 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:34:21,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:34:21,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:34:21,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:34:22,301 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 13 [2019-11-15 23:34:22,570 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-11-15 23:34:22,707 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 20 [2019-11-15 23:34:22,884 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2019-11-15 23:34:23,076 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2019-11-15 23:34:23,227 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 19 [2019-11-15 23:34:23,490 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-11-15 23:34:23,499 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 832) no Hoare annotation was computed. [2019-11-15 23:34:23,499 INFO L443 ceAbstractionStarter]: For program point L828-2(lines 828 832) no Hoare annotation was computed. [2019-11-15 23:34:23,499 INFO L443 ceAbstractionStarter]: For program point L828-3(lines 828 832) no Hoare annotation was computed. [2019-11-15 23:34:23,499 INFO L443 ceAbstractionStarter]: For program point L828-5(lines 828 832) no Hoare annotation was computed. [2019-11-15 23:34:23,499 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-15 23:34:23,499 INFO L443 ceAbstractionStarter]: For program point L828-6(lines 828 832) no Hoare annotation was computed. [2019-11-15 23:34:23,499 INFO L443 ceAbstractionStarter]: For program point L828-8(lines 828 832) no Hoare annotation was computed. [2019-11-15 23:34:23,500 INFO L439 ceAbstractionStarter]: At program point L779(lines 774 782) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (not (= |ULTIMATE.start_isPumpRunning_#res| 0)) (not (= ~pumpRunning~0 0)) (= 0 ULTIMATE.start_test_~splverifierCounter~0)) [2019-11-15 23:34:23,500 INFO L439 ceAbstractionStarter]: At program point L779-1(lines 774 782) the Hoare annotation is: false [2019-11-15 23:34:23,500 INFO L439 ceAbstractionStarter]: At program point L779-2(lines 774 782) the Hoare annotation is: false [2019-11-15 23:34:23,500 INFO L439 ceAbstractionStarter]: At program point L135(lines 126 139) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) (and .cse0 .cse1 .cse2)) (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2))) [2019-11-15 23:34:23,500 INFO L439 ceAbstractionStarter]: At program point L135-1(lines 126 139) the Hoare annotation is: false [2019-11-15 23:34:23,500 INFO L439 ceAbstractionStarter]: At program point L135-2(lines 126 139) the Hoare annotation is: false [2019-11-15 23:34:23,500 INFO L439 ceAbstractionStarter]: At program point L895(lines 1 906) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-15 23:34:23,501 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:34:23,501 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 738) no Hoare annotation was computed. [2019-11-15 23:34:23,501 INFO L443 ceAbstractionStarter]: For program point L730-1(lines 730 738) no Hoare annotation was computed. [2019-11-15 23:34:23,501 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-15 23:34:23,501 INFO L443 ceAbstractionStarter]: For program point L730-2(lines 730 738) no Hoare annotation was computed. [2019-11-15 23:34:23,501 INFO L443 ceAbstractionStarter]: For program point L664-2(lines 694 700) no Hoare annotation was computed. [2019-11-15 23:34:23,501 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 57) no Hoare annotation was computed. [2019-11-15 23:34:23,501 INFO L443 ceAbstractionStarter]: For program point L53-3(lines 53 57) no Hoare annotation was computed. [2019-11-15 23:34:23,501 INFO L443 ceAbstractionStarter]: For program point L53-6(lines 53 57) no Hoare annotation was computed. [2019-11-15 23:34:23,501 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 204) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-15 23:34:23,502 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 654) no Hoare annotation was computed. [2019-11-15 23:34:23,502 INFO L439 ceAbstractionStarter]: At program point L648-1(lines 648 654) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1))) [2019-11-15 23:34:23,504 INFO L439 ceAbstractionStarter]: At program point L153-2(lines 153 167) the Hoare annotation is: false [2019-11-15 23:34:23,504 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 23:34:23,504 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 868) no Hoare annotation was computed. [2019-11-15 23:34:23,504 INFO L443 ceAbstractionStarter]: For program point L848-2(lines 848 868) no Hoare annotation was computed. [2019-11-15 23:34:23,505 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-11-15 23:34:23,505 INFO L443 ceAbstractionStarter]: For program point L848-4(lines 848 868) no Hoare annotation was computed. [2019-11-15 23:34:23,505 INFO L439 ceAbstractionStarter]: At program point L122(lines 117 125) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~5) (<= |ULTIMATE.start_getWaterLevel_#res| 1) (<= ~waterLevel~0 1) .cse1 .cse2) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (not .cse1) .cse2))) [2019-11-15 23:34:23,506 INFO L439 ceAbstractionStarter]: At program point L122-1(lines 117 125) the Hoare annotation is: false [2019-11-15 23:34:23,506 INFO L439 ceAbstractionStarter]: At program point L122-2(lines 117 125) the Hoare annotation is: false [2019-11-15 23:34:23,506 INFO L446 ceAbstractionStarter]: At program point L238(lines 219 241) the Hoare annotation is: true [2019-11-15 23:34:23,507 INFO L439 ceAbstractionStarter]: At program point L701(lines 701 707) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1) (not .cse2)) (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~5) (<= ~waterLevel~0 1) .cse2 .cse1))) [2019-11-15 23:34:23,507 INFO L439 ceAbstractionStarter]: At program point L701-1(lines 701 707) the Hoare annotation is: false [2019-11-15 23:34:23,507 INFO L439 ceAbstractionStarter]: At program point L701-2(lines 701 707) the Hoare annotation is: false [2019-11-15 23:34:23,507 INFO L439 ceAbstractionStarter]: At program point L90(lines 85 93) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (and .cse0 .cse1)) (not .cse2)) (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~5) (<= ~waterLevel~0 1) .cse2 .cse1))) [2019-11-15 23:34:23,507 INFO L439 ceAbstractionStarter]: At program point L90-1(lines 85 93) the Hoare annotation is: false [2019-11-15 23:34:23,507 INFO L439 ceAbstractionStarter]: At program point L90-2(lines 85 93) the Hoare annotation is: false [2019-11-15 23:34:23,508 INFO L439 ceAbstractionStarter]: At program point L834(lines 819 837) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 1)) (.cse3 (= ~pumpRunning~0 0)) (.cse4 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) .cse0 (and .cse1 .cse3 .cse4)) (= 1 |ULTIMATE.start_isHighWaterLevel_#res|) (= 1 ULTIMATE.start_isHighWaterLevel_~tmp___0~1)) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse2 .cse3 .cse4))) [2019-11-15 23:34:23,508 INFO L439 ceAbstractionStarter]: At program point L834-1(lines 819 837) the Hoare annotation is: false [2019-11-15 23:34:23,508 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:34:23,508 INFO L439 ceAbstractionStarter]: At program point L834-2(lines 819 837) the Hoare annotation is: false [2019-11-15 23:34:23,508 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 161) no Hoare annotation was computed. [2019-11-15 23:34:23,509 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 694 700) no Hoare annotation was computed. [2019-11-15 23:34:23,509 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-11-15 23:34:23,509 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-15 23:34:23,509 INFO L439 ceAbstractionStarter]: At program point L638-1(lines 638 644) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1))) [2019-11-15 23:34:23,509 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-15 23:34:23,510 INFO L439 ceAbstractionStarter]: At program point L903(lines 898 906) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-15 23:34:23,510 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:34:23,510 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 867) no Hoare annotation was computed. [2019-11-15 23:34:23,510 INFO L439 ceAbstractionStarter]: At program point L854-1(lines 1 906) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0)) (.cse1 (= ~pumpRunning~0 0))) (or (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2) (and (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (and .cse0 .cse2)) (not .cse1)))) [2019-11-15 23:34:23,510 INFO L443 ceAbstractionStarter]: For program point L854-2(lines 854 867) no Hoare annotation was computed. [2019-11-15 23:34:23,510 INFO L439 ceAbstractionStarter]: At program point L854-3(lines 1 906) the Hoare annotation is: false [2019-11-15 23:34:23,511 INFO L443 ceAbstractionStarter]: For program point L854-4(lines 854 867) no Hoare annotation was computed. [2019-11-15 23:34:23,511 INFO L439 ceAbstractionStarter]: At program point L854-5(lines 1 906) the Hoare annotation is: false [2019-11-15 23:34:23,511 INFO L439 ceAbstractionStarter]: At program point L674(lines 627 675) the Hoare annotation is: false [2019-11-15 23:34:23,511 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 669) no Hoare annotation was computed. [2019-11-15 23:34:23,511 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 236) no Hoare annotation was computed. [2019-11-15 23:34:23,511 INFO L446 ceAbstractionStarter]: At program point L229-1(lines 229 236) the Hoare annotation is: true [2019-11-15 23:34:23,512 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 136) no Hoare annotation was computed. [2019-11-15 23:34:23,512 INFO L443 ceAbstractionStarter]: For program point L130-1(lines 130 136) no Hoare annotation was computed. [2019-11-15 23:34:23,512 INFO L443 ceAbstractionStarter]: For program point L130-2(lines 130 136) no Hoare annotation was computed. [2019-11-15 23:34:23,513 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-11-15 23:34:23,513 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 69) no Hoare annotation was computed. [2019-11-15 23:34:23,513 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:34:23,513 INFO L443 ceAbstractionStarter]: For program point L858(lines 858 864) no Hoare annotation was computed. [2019-11-15 23:34:23,513 INFO L443 ceAbstractionStarter]: For program point L858-2(lines 858 864) no Hoare annotation was computed. [2019-11-15 23:34:23,514 INFO L443 ceAbstractionStarter]: For program point L726(lines 726 743) no Hoare annotation was computed. [2019-11-15 23:34:23,514 INFO L443 ceAbstractionStarter]: For program point L858-4(lines 858 864) no Hoare annotation was computed. [2019-11-15 23:34:23,514 INFO L443 ceAbstractionStarter]: For program point L726-1(lines 726 743) no Hoare annotation was computed. [2019-11-15 23:34:23,514 INFO L443 ceAbstractionStarter]: For program point L726-2(lines 726 743) no Hoare annotation was computed. [2019-11-15 23:34:23,514 INFO L439 ceAbstractionStarter]: At program point L694(lines 693 712) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1))) [2019-11-15 23:34:23,514 INFO L443 ceAbstractionStarter]: For program point L694-1(lines 694 700) no Hoare annotation was computed. [2019-11-15 23:34:23,515 INFO L439 ceAbstractionStarter]: At program point L694-2(lines 693 712) the Hoare annotation is: false [2019-11-15 23:34:23,515 INFO L439 ceAbstractionStarter]: At program point L694-3(lines 693 712) the Hoare annotation is: false [2019-11-15 23:34:23,515 INFO L443 ceAbstractionStarter]: For program point L629(lines 628 673) no Hoare annotation was computed. [2019-11-15 23:34:23,515 INFO L443 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2019-11-15 23:34:23,515 INFO L443 ceAbstractionStarter]: For program point L613-1(line 613) no Hoare annotation was computed. [2019-11-15 23:34:23,515 INFO L443 ceAbstractionStarter]: For program point L613-2(line 613) no Hoare annotation was computed. [2019-11-15 23:34:23,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:34:23 BoogieIcfgContainer [2019-11-15 23:34:23,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:34:23,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:34:23,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:34:23,553 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:34:23,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:19" (3/4) ... [2019-11-15 23:34:23,557 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:34:23,583 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-11-15 23:34:23,584 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-15 23:34:23,585 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-15 23:34:23,588 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:34:23,589 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:34:23,589 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:34:23,645 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) [2019-11-15 23:34:23,647 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == systemActive && 0 == tmp) && \result <= 1) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && !(pumpRunning == 0)) && 0 == splverifierCounter) [2019-11-15 23:34:23,647 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == tmp && 1 == systemActive) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((((\result == 0 && 0 == tmp) && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) [2019-11-15 23:34:23,651 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && 0 == tmp) && !(\result == 0)) && !(pumpRunning == 0)) && 0 == splverifierCounter [2019-11-15 23:34:23,732 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7c1dc1c3-19ff-49ed-bf5d-0d46edf65b96/bin/uautomizer/witness.graphml [2019-11-15 23:34:23,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:34:23,734 INFO L168 Benchmark]: Toolchain (without parser) took 6225.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:23,734 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:34:23,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:23,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:23,736 INFO L168 Benchmark]: Boogie Preprocessor took 63.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:23,736 INFO L168 Benchmark]: RCFGBuilder took 836.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:23,737 INFO L168 Benchmark]: TraceAbstraction took 4517.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.1 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:23,737 INFO L168 Benchmark]: Witness Printer took 180.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:23,739 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 552.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 836.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4517.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.1 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. * Witness Printer took 180.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((1 == systemActive && 0 == tmp) && \result <= 1) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && !(pumpRunning == 0)) && 0 == splverifierCounter) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (\result == 0 && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) - InvariantResult [Line: 898]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((0 == tmp && 1 == systemActive && 0 == splverifierCounter) && !(pumpRunning == 0)) || ((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: (((((0 == tmp && 1 == systemActive) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((((\result == 0 && 0 == tmp) && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((1 == systemActive && 0 == tmp) && !(\result == 0)) && !(pumpRunning == 0)) && 0 == splverifierCounter - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive && 0 == splverifierCounter) && !(pumpRunning == 0)) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: (((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) && !(pumpRunning == 0)) || ((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, HoareTripleCheckerStatistics: 751 SDtfs, 863 SDslu, 1100 SDs, 0 SdLazy, 178 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 595 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 94 NumberOfFragments, 348 HoareAnnotationTreeSize, 33 FomulaSimplifications, 23600 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 33 FomulaSimplificationsInter, 5002 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 13265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...