./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/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 dc08a0b643f05bf554ed8bba095ffb3efc1cc232 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:33:03,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:33:03,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:33:03,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:33:03,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:33:03,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:33:03,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:33:03,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:33:03,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:33:03,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:33:03,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:33:03,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:33:03,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:33:03,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:33:03,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:33:03,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:33:03,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:33:03,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:33:03,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:33:03,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:33:03,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:33:03,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:33:03,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:33:03,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:33:03,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:33:03,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:33:03,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:33:03,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:33:03,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:33:03,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:33:03,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:33:03,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:33:03,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:33:03,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:33:03,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:33:03,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:33:03,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:33:03,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:33:03,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:33:03,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:33:03,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:33:03,418 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:33:03,443 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:33:03,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:33:03,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:33:03,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:33:03,454 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:33:03,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:33:03,454 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:33:03,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:33:03,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:33:03,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:33:03,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:33:03,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:33:03,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:33:03,456 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:33:03,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:33:03,456 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:33:03,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:33:03,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:33:03,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:33:03,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:33:03,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:33:03,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:33:03,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:33:03,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:33:03,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:33:03,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:33:03,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:33:03,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:33:03,460 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_3927e141-cbc6-4f45-8970-119a20a9b945/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 -> dc08a0b643f05bf554ed8bba095ffb3efc1cc232 [2019-11-20 03:33:03,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:33:03,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:33:03,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:33:03,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:33:03,647 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:33:03,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c [2019-11-20 03:33:03,707 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/data/03e658e07/ab02e01551be4cd4b92fd7aa6a4c8c50/FLAG4ac3d28dc [2019-11-20 03:33:04,185 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:33:04,187 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c [2019-11-20 03:33:04,203 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/data/03e658e07/ab02e01551be4cd4b92fd7aa6a4c8c50/FLAG4ac3d28dc [2019-11-20 03:33:04,507 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/data/03e658e07/ab02e01551be4cd4b92fd7aa6a4c8c50 [2019-11-20 03:33:04,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:33:04,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:33:04,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:33:04,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:33:04,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:33:04,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:33:04" (1/1) ... [2019-11-20 03:33:04,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e1ca53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:04, skipping insertion in model container [2019-11-20 03:33:04,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:33:04" (1/1) ... [2019-11-20 03:33:04,525 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:33:04,579 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:33:04,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:33:04,988 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:33:05,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:33:05,130 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:33:05,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05 WrapperNode [2019-11-20 03:33:05,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:33:05,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:33:05,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:33:05,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:33:05,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... [2019-11-20 03:33:05,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... [2019-11-20 03:33:05,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:33:05,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:33:05,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:33:05,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:33:05,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... [2019-11-20 03:33:05,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... [2019-11-20 03:33:05,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... [2019-11-20 03:33:05,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... [2019-11-20 03:33:05,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... [2019-11-20 03:33:05,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... [2019-11-20 03:33:05,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... [2019-11-20 03:33:05,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:33:05,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:33:05,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:33:05,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:33:05,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/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-20 03:33:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:33:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 03:33:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:33:05,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:33:06,012 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:33:06,012 INFO L285 CfgBuilder]: Removed 100 assume(true) statements. [2019-11-20 03:33:06,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:33:06 BoogieIcfgContainer [2019-11-20 03:33:06,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:33:06,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:33:06,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:33:06,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:33:06,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:33:04" (1/3) ... [2019-11-20 03:33:06,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6021e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:33:06, skipping insertion in model container [2019-11-20 03:33:06,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:05" (2/3) ... [2019-11-20 03:33:06,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6021e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:33:06, skipping insertion in model container [2019-11-20 03:33:06,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:33:06" (3/3) ... [2019-11-20 03:33:06,020 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product35.cil.c [2019-11-20 03:33:06,030 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:33:06,036 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-20 03:33:06,046 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-20 03:33:06,071 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:33:06,071 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:33:06,071 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:33:06,071 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:33:06,071 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:33:06,072 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:33:06,072 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:33:06,072 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:33:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-20 03:33:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 03:33:06,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:06,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:06,092 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:06,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1355288485, now seen corresponding path program 1 times [2019-11-20 03:33:06,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:06,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509803667] [2019-11-20 03:33:06,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:06,288 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-20 03:33:06,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509803667] [2019-11-20 03:33:06,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:06,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:33:06,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54034970] [2019-11-20 03:33:06,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 03:33:06,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:06,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 03:33:06,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 03:33:06,309 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2019-11-20 03:33:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:06,331 INFO L93 Difference]: Finished difference Result 154 states and 233 transitions. [2019-11-20 03:33:06,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 03:33:06,332 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 03:33:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:06,341 INFO L225 Difference]: With dead ends: 154 [2019-11-20 03:33:06,341 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 03:33:06,345 INFO L630 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-20 03:33:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 03:33:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-20 03:33:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 03:33:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2019-11-20 03:33:06,381 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 16 [2019-11-20 03:33:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:06,384 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2019-11-20 03:33:06,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 03:33:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2019-11-20 03:33:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:33:06,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:06,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:06,386 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1892921914, now seen corresponding path program 1 times [2019-11-20 03:33:06,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:06,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734599006] [2019-11-20 03:33:06,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:06,509 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-20 03:33:06,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734599006] [2019-11-20 03:33:06,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:06,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:06,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205636246] [2019-11-20 03:33:06,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:06,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:06,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:06,513 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand 3 states. [2019-11-20 03:33:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:06,522 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-11-20 03:33:06,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:06,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 03:33:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:06,524 INFO L225 Difference]: With dead ends: 76 [2019-11-20 03:33:06,524 INFO L226 Difference]: Without dead ends: 36 [2019-11-20 03:33:06,525 INFO L630 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-20 03:33:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-20 03:33:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-20 03:33:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 03:33:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-20 03:33:06,530 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 17 [2019-11-20 03:33:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:06,530 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-20 03:33:06,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-20 03:33:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:33:06,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:06,532 INFO L410 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] [2019-11-20 03:33:06,532 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1160602350, now seen corresponding path program 1 times [2019-11-20 03:33:06,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:06,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736873932] [2019-11-20 03:33:06,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:06,638 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-20 03:33:06,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736873932] [2019-11-20 03:33:06,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:06,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:33:06,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741554426] [2019-11-20 03:33:06,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:33:06,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:33:06,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:33:06,641 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 6 states. [2019-11-20 03:33:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:06,865 INFO L93 Difference]: Finished difference Result 119 states and 175 transitions. [2019-11-20 03:33:06,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:33:06,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-20 03:33:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:06,867 INFO L225 Difference]: With dead ends: 119 [2019-11-20 03:33:06,867 INFO L226 Difference]: Without dead ends: 89 [2019-11-20 03:33:06,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:33:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-20 03:33:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2019-11-20 03:33:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-20 03:33:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-20 03:33:06,878 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 22 [2019-11-20 03:33:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:06,879 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-20 03:33:06,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:33:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-20 03:33:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 03:33:06,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:06,880 INFO L410 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] [2019-11-20 03:33:06,881 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1572373846, now seen corresponding path program 1 times [2019-11-20 03:33:06,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:06,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439520916] [2019-11-20 03:33:06,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:06,938 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-20 03:33:06,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439520916] [2019-11-20 03:33:06,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:06,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:33:06,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923271442] [2019-11-20 03:33:06,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:06,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:06,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:06,940 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 3 states. [2019-11-20 03:33:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:06,993 INFO L93 Difference]: Finished difference Result 125 states and 184 transitions. [2019-11-20 03:33:06,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:06,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 03:33:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:06,995 INFO L225 Difference]: With dead ends: 125 [2019-11-20 03:33:06,995 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 03:33:06,995 INFO L630 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-20 03:33:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 03:33:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-11-20 03:33:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 03:33:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-11-20 03:33:07,006 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 23 [2019-11-20 03:33:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:07,007 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-11-20 03:33:07,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-11-20 03:33:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:33:07,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:07,008 INFO L410 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-20 03:33:07,008 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1956458727, now seen corresponding path program 1 times [2019-11-20 03:33:07,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:07,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160878391] [2019-11-20 03:33:07,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:07,122 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-20 03:33:07,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160878391] [2019-11-20 03:33:07,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:07,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:33:07,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317466108] [2019-11-20 03:33:07,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:33:07,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:07,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:33:07,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:33:07,124 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 5 states. [2019-11-20 03:33:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:07,230 INFO L93 Difference]: Finished difference Result 354 states and 517 transitions. [2019-11-20 03:33:07,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:33:07,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-20 03:33:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:07,234 INFO L225 Difference]: With dead ends: 354 [2019-11-20 03:33:07,234 INFO L226 Difference]: Without dead ends: 286 [2019-11-20 03:33:07,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:33:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-20 03:33:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 134. [2019-11-20 03:33:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-20 03:33:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 188 transitions. [2019-11-20 03:33:07,273 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 188 transitions. Word has length 25 [2019-11-20 03:33:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:07,274 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 188 transitions. [2019-11-20 03:33:07,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:33:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 188 transitions. [2019-11-20 03:33:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 03:33:07,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:07,283 INFO L410 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] [2019-11-20 03:33:07,284 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:07,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1752651633, now seen corresponding path program 1 times [2019-11-20 03:33:07,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:07,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704401936] [2019-11-20 03:33:07,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:07,401 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-20 03:33:07,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704401936] [2019-11-20 03:33:07,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:07,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:33:07,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617493051] [2019-11-20 03:33:07,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:33:07,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:33:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:33:07,404 INFO L87 Difference]: Start difference. First operand 134 states and 188 transitions. Second operand 5 states. [2019-11-20 03:33:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:07,548 INFO L93 Difference]: Finished difference Result 368 states and 521 transitions. [2019-11-20 03:33:07,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:33:07,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-20 03:33:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:07,551 INFO L225 Difference]: With dead ends: 368 [2019-11-20 03:33:07,552 INFO L226 Difference]: Without dead ends: 366 [2019-11-20 03:33:07,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:33:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-20 03:33:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 134. [2019-11-20 03:33:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-20 03:33:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 186 transitions. [2019-11-20 03:33:07,587 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 186 transitions. Word has length 26 [2019-11-20 03:33:07,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:07,588 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 186 transitions. [2019-11-20 03:33:07,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:33:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 186 transitions. [2019-11-20 03:33:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 03:33:07,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:07,592 INFO L410 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] [2019-11-20 03:33:07,595 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1960990159, now seen corresponding path program 1 times [2019-11-20 03:33:07,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:07,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269531744] [2019-11-20 03:33:07,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:07,685 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-20 03:33:07,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269531744] [2019-11-20 03:33:07,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:07,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:33:07,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046554676] [2019-11-20 03:33:07,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:33:07,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:33:07,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:33:07,687 INFO L87 Difference]: Start difference. First operand 134 states and 186 transitions. Second operand 5 states. [2019-11-20 03:33:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:07,750 INFO L93 Difference]: Finished difference Result 398 states and 551 transitions. [2019-11-20 03:33:07,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:33:07,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-20 03:33:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:07,753 INFO L225 Difference]: With dead ends: 398 [2019-11-20 03:33:07,753 INFO L226 Difference]: Without dead ends: 270 [2019-11-20 03:33:07,754 INFO L630 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-20 03:33:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-20 03:33:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 140. [2019-11-20 03:33:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-20 03:33:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2019-11-20 03:33:07,780 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 30 [2019-11-20 03:33:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:07,780 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2019-11-20 03:33:07,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:33:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2019-11-20 03:33:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 03:33:07,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:07,782 INFO L410 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] [2019-11-20 03:33:07,782 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1940950127, now seen corresponding path program 1 times [2019-11-20 03:33:07,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:07,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760712865] [2019-11-20 03:33:07,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:07,857 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-20 03:33:07,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760712865] [2019-11-20 03:33:07,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:07,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 03:33:07,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301221864] [2019-11-20 03:33:07,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:33:07,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:33:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:33:07,859 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand 6 states. [2019-11-20 03:33:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:07,953 INFO L93 Difference]: Finished difference Result 432 states and 590 transitions. [2019-11-20 03:33:07,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:33:07,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-20 03:33:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:07,957 INFO L225 Difference]: With dead ends: 432 [2019-11-20 03:33:07,957 INFO L226 Difference]: Without dead ends: 298 [2019-11-20 03:33:07,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:33:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-20 03:33:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 144. [2019-11-20 03:33:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-20 03:33:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 196 transitions. [2019-11-20 03:33:07,979 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 196 transitions. Word has length 30 [2019-11-20 03:33:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:07,980 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 196 transitions. [2019-11-20 03:33:07,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:33:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 196 transitions. [2019-11-20 03:33:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 03:33:07,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:07,981 INFO L410 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] [2019-11-20 03:33:07,981 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:07,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2095851731, now seen corresponding path program 1 times [2019-11-20 03:33:07,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:07,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385184757] [2019-11-20 03:33:07,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:08,025 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-20 03:33:08,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385184757] [2019-11-20 03:33:08,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:08,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:33:08,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813582609] [2019-11-20 03:33:08,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:08,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:08,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:08,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:08,027 INFO L87 Difference]: Start difference. First operand 144 states and 196 transitions. Second operand 3 states. [2019-11-20 03:33:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:08,075 INFO L93 Difference]: Finished difference Result 368 states and 500 transitions. [2019-11-20 03:33:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:08,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-20 03:33:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:08,077 INFO L225 Difference]: With dead ends: 368 [2019-11-20 03:33:08,077 INFO L226 Difference]: Without dead ends: 230 [2019-11-20 03:33:08,078 INFO L630 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-20 03:33:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-20 03:33:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-20 03:33:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 03:33:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 304 transitions. [2019-11-20 03:33:08,109 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 304 transitions. Word has length 30 [2019-11-20 03:33:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:08,110 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 304 transitions. [2019-11-20 03:33:08,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 304 transitions. [2019-11-20 03:33:08,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 03:33:08,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:08,113 INFO L410 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-20 03:33:08,114 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:08,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:08,114 INFO L82 PathProgramCache]: Analyzing trace with hash 191299371, now seen corresponding path program 1 times [2019-11-20 03:33:08,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:08,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337488466] [2019-11-20 03:33:08,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:33:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:33:08,294 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:33:08,294 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 03:33:08,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:33:08 BoogieIcfgContainer [2019-11-20 03:33:08,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:33:08,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:33:08,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:33:08,443 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:33:08,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:33:06" (3/4) ... [2019-11-20 03:33:08,446 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 03:33:08,528 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3927e141-cbc6-4f45-8970-119a20a9b945/bin/uautomizer/witness.graphml [2019-11-20 03:33:08,528 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:33:08,530 INFO L168 Benchmark]: Toolchain (without parser) took 4019.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -227.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:33:08,530 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:33:08,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:33:08,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.47 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:33:08,531 INFO L168 Benchmark]: Boogie Preprocessor took 45.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:33:08,534 INFO L168 Benchmark]: RCFGBuilder took 777.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:33:08,534 INFO L168 Benchmark]: TraceAbstraction took 2428.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -149.6 MB). Peak memory consumption was 270.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:33:08,534 INFO L168 Benchmark]: Witness Printer took 85.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:33:08,536 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.47 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 777.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2428.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -149.6 MB). Peak memory consumption was 270.5 MB. Max. memory is 11.5 GB. * Witness Printer took 85.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 145]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L250] int pumpRunning = 0; [L251] int systemActive = 1; [L455] int cleanupTimeShifts = 4; [L720] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L528] int retValue_acc ; [L529] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] int retValue_acc ; [L449] retValue_acc = 1 [L450] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L535] tmp = valid_product() [L537] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L181] int splverifierCounter ; [L182] int tmp ; [L183] int tmp___0 ; [L184] int tmp___1 ; [L185] int tmp___2 ; [L188] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L190] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L192] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L198] tmp = __VERIFIER_nondet_int() [L200] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L208] tmp___0 = __VERIFIER_nondet_int() [L210] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L218] tmp___2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L257] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L264] COND TRUE \read(systemActive) [L286] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L289] COND TRUE ! pumpRunning [L383] int retValue_acc ; [L384] int tmp ; [L385] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L389] tmp = isHighWaterSensorDry() [L391] COND FALSE !(\read(tmp)) [L394] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L396] retValue_acc = tmp___0 [L397] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L291] tmp = isHighWaterLevel() [L293] COND TRUE \read(tmp) [L314] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L152] int tmp ; [L153] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L157] tmp = isMethaneLevelCritical() [L159] COND TRUE \read(tmp) [L338] int retValue_acc ; [L341] retValue_acc = pumpRunning [L342] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L161] tmp___0 = isPumpRunning() [L163] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L145] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 624 SDtfs, 977 SDslu, 1094 SDs, 0 SdLazy, 129 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 704 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 10475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 incorrect! Received shutdown request...