./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c -s /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0efda15f8357629016064e69e444205aff537305 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:17:17,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:17:17,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:17:17,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:17:17,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:17:17,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:17:17,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:17:17,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:17:17,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:17:17,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:17:17,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:17:17,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:17:17,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:17:17,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:17:17,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:17:17,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:17:17,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:17:17,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:17:17,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:17:17,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:17:17,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:17:17,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:17:17,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:17:17,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:17:17,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:17:17,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:17:17,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:17:17,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:17:17,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:17:17,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:17:17,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:17:17,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:17:17,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:17:17,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:17:17,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:17:17,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:17:17,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:17:17,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:17:17,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:17:17,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:17:17,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:17:17,498 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:17:17,511 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:17:17,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:17:17,512 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:17:17,513 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:17:17,513 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:17:17,513 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:17:17,513 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:17:17,513 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:17:17,514 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:17:17,514 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:17:17,514 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:17:17,514 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:17:17,514 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:17:17,515 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:17:17,515 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:17:17,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:17:17,516 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:17:17,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:17:17,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:17:17,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:17:17,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:17:17,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:17:17,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:17:17,517 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:17:17,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:17:17,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:17:17,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:17:17,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:17:17,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:17:17,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:17:17,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:17:17,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:17:17,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:17:17,519 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:17:17,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:17:17,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:17:17,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:17:17,520 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0efda15f8357629016064e69e444205aff537305 [2019-11-26 02:17:17,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:17:17,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:17:17,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:17:17,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:17:17,666 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:17:17,666 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2019-11-26 02:17:17,714 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/data/f63b8bfe6/3f3fbad2f3f24c8e9467cd4321fa71a9/FLAGadadfdabd [2019-11-26 02:17:18,238 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:17:18,239 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2019-11-26 02:17:18,248 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/data/f63b8bfe6/3f3fbad2f3f24c8e9467cd4321fa71a9/FLAGadadfdabd [2019-11-26 02:17:18,733 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/data/f63b8bfe6/3f3fbad2f3f24c8e9467cd4321fa71a9 [2019-11-26 02:17:18,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:17:18,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:17:18,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:17:18,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:17:18,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:17:18,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:17:18" (1/1) ... [2019-11-26 02:17:18,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abcc8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:18, skipping insertion in model container [2019-11-26 02:17:18,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:17:18" (1/1) ... [2019-11-26 02:17:18,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:17:18,816 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:17:19,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:17:19,194 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:17:19,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:17:19,362 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:17:19,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19 WrapperNode [2019-11-26 02:17:19,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:17:19,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:17:19,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:17:19,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:17:19,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... [2019-11-26 02:17:19,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... [2019-11-26 02:17:19,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:17:19,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:17:19,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:17:19,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:17:19,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... [2019-11-26 02:17:19,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... [2019-11-26 02:17:19,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... [2019-11-26 02:17:19,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... [2019-11-26 02:17:19,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... [2019-11-26 02:17:19,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... [2019-11-26 02:17:19,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... [2019-11-26 02:17:19,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:17:19,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:17:19,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:17:19,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:17:19,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:17:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:17:19,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:17:21,582 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:17:21,583 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:17:21,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:17:21 BoogieIcfgContainer [2019-11-26 02:17:21,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:17:21,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:17:21,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:17:21,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:17:21,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:17:18" (1/3) ... [2019-11-26 02:17:21,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4ef475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:17:21, skipping insertion in model container [2019-11-26 02:17:21,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:19" (2/3) ... [2019-11-26 02:17:21,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4ef475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:17:21, skipping insertion in model container [2019-11-26 02:17:21,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:17:21" (3/3) ... [2019-11-26 02:17:21,596 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label48.c [2019-11-26 02:17:21,605 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:17:21,611 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:17:21,621 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:17:21,649 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:17:21,650 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:17:21,650 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:17:21,650 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:17:21,650 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:17:21,651 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:17:21,651 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:17:21,651 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:17:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:17:21,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:17:21,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:21,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 02:17:21,680 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1323231385, now seen corresponding path program 1 times [2019-11-26 02:17:21,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:21,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946872635] [2019-11-26 02:17:21,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:22,082 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-26 02:17:22,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946872635] [2019-11-26 02:17:22,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:22,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:22,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427435118] [2019-11-26 02:17:22,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:22,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:22,104 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:17:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:22,821 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:17:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:22,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:17:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:22,843 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:17:22,843 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:17:22,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:17:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-26 02:17:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-26 02:17:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 396 transitions. [2019-11-26 02:17:22,906 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 396 transitions. Word has length 71 [2019-11-26 02:17:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:22,907 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 396 transitions. [2019-11-26 02:17:22,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 396 transitions. [2019-11-26 02:17:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-26 02:17:22,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:22,911 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:22,912 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:22,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:22,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1566176565, now seen corresponding path program 1 times [2019-11-26 02:17:22,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:22,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654462016] [2019-11-26 02:17:22,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:22,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654462016] [2019-11-26 02:17:22,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:22,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:17:22,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797906874] [2019-11-26 02:17:22,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:17:22,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:22,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:17:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:17:22,979 INFO L87 Difference]: Start difference. First operand 216 states and 396 transitions. Second operand 3 states. [2019-11-26 02:17:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:23,416 INFO L93 Difference]: Finished difference Result 644 states and 1185 transitions. [2019-11-26 02:17:23,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:17:23,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-26 02:17:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:23,420 INFO L225 Difference]: With dead ends: 644 [2019-11-26 02:17:23,421 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:17:23,422 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-26 02:17:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:17:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-11-26 02:17:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-26 02:17:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-11-26 02:17:23,459 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 84 [2019-11-26 02:17:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:23,460 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-11-26 02:17:23,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:17:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-11-26 02:17:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-26 02:17:23,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:23,464 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:23,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash -81009251, now seen corresponding path program 1 times [2019-11-26 02:17:23,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:23,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161631294] [2019-11-26 02:17:23,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-26 02:17:23,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161631294] [2019-11-26 02:17:23,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:23,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:23,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046203570] [2019-11-26 02:17:23,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:23,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:23,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:23,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:23,562 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 4 states. [2019-11-26 02:17:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:24,222 INFO L93 Difference]: Finished difference Result 1212 states and 2013 transitions. [2019-11-26 02:17:24,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:24,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-26 02:17:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:24,229 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:17:24,229 INFO L226 Difference]: Without dead ends: 855 [2019-11-26 02:17:24,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-26 02:17:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-11-26 02:17:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:17:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1218 transitions. [2019-11-26 02:17:24,284 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1218 transitions. Word has length 93 [2019-11-26 02:17:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:24,285 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1218 transitions. [2019-11-26 02:17:24,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1218 transitions. [2019-11-26 02:17:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-26 02:17:24,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:24,295 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:24,295 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2009843212, now seen corresponding path program 1 times [2019-11-26 02:17:24,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:24,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370745105] [2019-11-26 02:17:24,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-26 02:17:24,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370745105] [2019-11-26 02:17:24,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:24,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:24,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437399806] [2019-11-26 02:17:24,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:24,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:24,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:24,442 INFO L87 Difference]: Start difference. First operand 784 states and 1218 transitions. Second operand 4 states. [2019-11-26 02:17:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:24,875 INFO L93 Difference]: Finished difference Result 1655 states and 2541 transitions. [2019-11-26 02:17:24,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:17:24,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-26 02:17:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:24,884 INFO L225 Difference]: With dead ends: 1655 [2019-11-26 02:17:24,884 INFO L226 Difference]: Without dead ends: 872 [2019-11-26 02:17:24,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-26 02:17:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-11-26 02:17:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 855. [2019-11-26 02:17:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:17:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1295 transitions. [2019-11-26 02:17:24,928 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1295 transitions. Word has length 99 [2019-11-26 02:17:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:24,929 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1295 transitions. [2019-11-26 02:17:24,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1295 transitions. [2019-11-26 02:17:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-26 02:17:24,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:24,931 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:24,931 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:24,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1788102724, now seen corresponding path program 1 times [2019-11-26 02:17:24,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:24,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442178207] [2019-11-26 02:17:24,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-26 02:17:25,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442178207] [2019-11-26 02:17:25,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:25,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:25,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18216791] [2019-11-26 02:17:25,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:25,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:25,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:25,050 INFO L87 Difference]: Start difference. First operand 855 states and 1295 transitions. Second operand 4 states. [2019-11-26 02:17:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:25,558 INFO L93 Difference]: Finished difference Result 1780 states and 2732 transitions. [2019-11-26 02:17:25,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:25,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-26 02:17:25,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:25,564 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:17:25,564 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:17:25,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:17:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-26 02:17:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:17:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1473 transitions. [2019-11-26 02:17:25,594 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1473 transitions. Word has length 103 [2019-11-26 02:17:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:25,594 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1473 transitions. [2019-11-26 02:17:25,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1473 transitions. [2019-11-26 02:17:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-26 02:17:25,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:25,597 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:25,597 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:25,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1752327103, now seen corresponding path program 1 times [2019-11-26 02:17:25,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:25,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879124225] [2019-11-26 02:17:25,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-26 02:17:25,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879124225] [2019-11-26 02:17:25,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:25,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:25,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784693710] [2019-11-26 02:17:25,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:17:25,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:17:25,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:17:25,658 INFO L87 Difference]: Start difference. First operand 997 states and 1473 transitions. Second operand 3 states. [2019-11-26 02:17:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:26,053 INFO L93 Difference]: Finished difference Result 2348 states and 3536 transitions. [2019-11-26 02:17:26,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:17:26,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-26 02:17:26,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:26,060 INFO L225 Difference]: With dead ends: 2348 [2019-11-26 02:17:26,060 INFO L226 Difference]: Without dead ends: 1281 [2019-11-26 02:17:26,062 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-26 02:17:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-26 02:17:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1068. [2019-11-26 02:17:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:17:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1345 transitions. [2019-11-26 02:17:26,087 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1345 transitions. Word has length 106 [2019-11-26 02:17:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:26,088 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1345 transitions. [2019-11-26 02:17:26,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:17:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1345 transitions. [2019-11-26 02:17:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-26 02:17:26,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:26,091 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 02:17:26,091 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:26,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:26,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1472781405, now seen corresponding path program 1 times [2019-11-26 02:17:26,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:26,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048625985] [2019-11-26 02:17:26,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:26,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048625985] [2019-11-26 02:17:26,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:26,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:26,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682234410] [2019-11-26 02:17:26,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:26,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:26,177 INFO L87 Difference]: Start difference. First operand 1068 states and 1345 transitions. Second operand 5 states. [2019-11-26 02:17:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:26,794 INFO L93 Difference]: Finished difference Result 2845 states and 3664 transitions. [2019-11-26 02:17:26,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:17:26,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-26 02:17:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:26,804 INFO L225 Difference]: With dead ends: 2845 [2019-11-26 02:17:26,804 INFO L226 Difference]: Without dead ends: 1849 [2019-11-26 02:17:26,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2019-11-26 02:17:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1494. [2019-11-26 02:17:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-11-26 02:17:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1818 transitions. [2019-11-26 02:17:26,844 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1818 transitions. Word has length 121 [2019-11-26 02:17:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:26,844 INFO L462 AbstractCegarLoop]: Abstraction has 1494 states and 1818 transitions. [2019-11-26 02:17:26,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1818 transitions. [2019-11-26 02:17:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-26 02:17:26,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:26,849 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:26,849 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:26,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:26,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1906081643, now seen corresponding path program 1 times [2019-11-26 02:17:26,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:26,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105940755] [2019-11-26 02:17:26,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-26 02:17:27,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105940755] [2019-11-26 02:17:27,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845024683] [2019-11-26 02:17:27,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:17:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:27,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:17:27,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:17:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-26 02:17:27,305 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:17:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-26 02:17:27,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:17:27,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-26 02:17:27,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565218511] [2019-11-26 02:17:27,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:17:27,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:27,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:17:27,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:17:27,354 INFO L87 Difference]: Start difference. First operand 1494 states and 1818 transitions. Second operand 3 states. [2019-11-26 02:17:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:27,675 INFO L93 Difference]: Finished difference Result 2987 states and 3655 transitions. [2019-11-26 02:17:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:17:27,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-26 02:17:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:27,684 INFO L225 Difference]: With dead ends: 2987 [2019-11-26 02:17:27,684 INFO L226 Difference]: Without dead ends: 1494 [2019-11-26 02:17:27,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 372 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:17:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-26 02:17:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1352. [2019-11-26 02:17:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-26 02:17:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1563 transitions. [2019-11-26 02:17:27,724 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1563 transitions. Word has length 187 [2019-11-26 02:17:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:27,726 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1563 transitions. [2019-11-26 02:17:27,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:17:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1563 transitions. [2019-11-26 02:17:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-26 02:17:27,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:27,730 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:27,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:17:27,934 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:27,935 INFO L82 PathProgramCache]: Analyzing trace with hash -495695403, now seen corresponding path program 1 times [2019-11-26 02:17:27,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:27,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378176519] [2019-11-26 02:17:27,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-26 02:17:28,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378176519] [2019-11-26 02:17:28,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:28,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:28,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198611429] [2019-11-26 02:17:28,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:28,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:28,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:28,088 INFO L87 Difference]: Start difference. First operand 1352 states and 1563 transitions. Second operand 4 states. [2019-11-26 02:17:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:28,431 INFO L93 Difference]: Finished difference Result 2845 states and 3320 transitions. [2019-11-26 02:17:28,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:17:28,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-26 02:17:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:28,439 INFO L225 Difference]: With dead ends: 2845 [2019-11-26 02:17:28,439 INFO L226 Difference]: Without dead ends: 1494 [2019-11-26 02:17:28,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-26 02:17:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1281. [2019-11-26 02:17:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-11-26 02:17:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1480 transitions. [2019-11-26 02:17:28,474 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1480 transitions. Word has length 190 [2019-11-26 02:17:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:28,474 INFO L462 AbstractCegarLoop]: Abstraction has 1281 states and 1480 transitions. [2019-11-26 02:17:28,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1480 transitions. [2019-11-26 02:17:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-26 02:17:28,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:28,479 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:28,479 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1290832554, now seen corresponding path program 1 times [2019-11-26 02:17:28,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:28,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810737745] [2019-11-26 02:17:28,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 233 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-26 02:17:28,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810737745] [2019-11-26 02:17:28,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151915629] [2019-11-26 02:17:28,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:17:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:28,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:17:28,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:17:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-26 02:17:28,885 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:17:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-26 02:17:28,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:17:28,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-26 02:17:28,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411124785] [2019-11-26 02:17:28,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:17:28,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:28,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:17:28,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:17:28,921 INFO L87 Difference]: Start difference. First operand 1281 states and 1480 transitions. Second operand 3 states. [2019-11-26 02:17:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:29,218 INFO L93 Difference]: Finished difference Result 2701 states and 3121 transitions. [2019-11-26 02:17:29,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:17:29,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-26 02:17:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:29,219 INFO L225 Difference]: With dead ends: 2701 [2019-11-26 02:17:29,219 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:17:29,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 424 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:17:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:17:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:17:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:17:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:17:29,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2019-11-26 02:17:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:29,222 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:17:29,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:17:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:17:29,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:17:29,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:17:29,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:17:30,196 WARN L192 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-26 02:17:30,642 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:17:30,645 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-26 02:17:30,646 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:17:30,647 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse7 (= 15 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse3 (<= ~a16~0 4)) (.cse4 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not (= 14 ~a8~0))) (.cse6 (= ~a16~0 5)) (.cse11 (<= 14 ~a8~0)) (.cse8 (not (= ~a16~0 6))) (.cse10 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse7 .cse6) (and .cse4 .cse3) (and .cse4 .cse8 .cse0 .cse9 .cse1) (and .cse10 .cse2 .cse3) (and .cse11 .cse0 .cse9 .cse1 .cse5) (and .cse11 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2) (and .cse2 .cse7 (not .cse0)) (and .cse7 .cse5) (and .cse4 .cse10 .cse9 .cse2) (and .cse5 .cse3) (and .cse4 .cse0 .cse9 .cse2 .cse6) (and .cse11 .cse8 .cse10 .cse2))) [2019-11-26 02:17:30,647 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:17:30,647 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:17:30,647 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:17:30,647 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:17:30,647 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:17:30,647 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:17:30,647 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:17:30,647 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:17:30,648 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:17:30,649 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:17:30,649 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:17:30,649 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse7 (= 15 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse3 (<= ~a16~0 4)) (.cse4 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not (= 14 ~a8~0))) (.cse6 (= ~a16~0 5)) (.cse11 (<= 14 ~a8~0)) (.cse8 (not (= ~a16~0 6))) (.cse10 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse7 .cse6) (and .cse4 .cse3) (and .cse4 .cse8 .cse0 .cse9 .cse1) (and .cse10 .cse2 .cse3) (and .cse11 .cse0 .cse9 .cse1 .cse5) (and .cse11 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2) (and .cse2 .cse7 (not .cse0)) (and .cse7 .cse5) (and .cse4 .cse10 .cse9 .cse2) (and .cse5 .cse3) (and .cse4 .cse0 .cse9 .cse2 .cse6) (and .cse11 .cse8 .cse10 .cse2))) [2019-11-26 02:17:30,649 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:17:30,649 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:17:30,649 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:17:30,649 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:17:30,649 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:17:30,649 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:17:30,650 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 539) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:17:30,651 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:17:30,652 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:17:30,652 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:17:30,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:17:30 BoogieIcfgContainer [2019-11-26 02:17:30,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:17:30,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:17:30,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:17:30,703 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:17:30,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:17:21" (3/4) ... [2019-11-26 02:17:30,706 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:17:30,737 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:17:30,739 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:17:30,740 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:17:30,742 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:17:30,947 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_534462c3-502f-4fd0-9624-70d2b260706d/bin/utaipan/witness.graphml [2019-11-26 02:17:30,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:17:30,949 INFO L168 Benchmark]: Toolchain (without parser) took 12209.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 942.0 MB in the beginning and 876.1 MB in the end (delta: 65.9 MB). Peak memory consumption was 348.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:30,949 INFO L168 Benchmark]: CDTParser took 0.21 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-26 02:17:30,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:30,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.48 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:30,951 INFO L168 Benchmark]: Boogie Preprocessor took 55.87 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-26 02:17:30,951 INFO L168 Benchmark]: RCFGBuilder took 2082.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.7 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:30,952 INFO L168 Benchmark]: TraceAbstraction took 9112.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 895.7 MB in the beginning and 904.2 MB in the end (delta: -8.5 MB). Peak memory consumption was 132.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:30,952 INFO L168 Benchmark]: Witness Printer took 246.20 ms. Allocated memory is still 1.3 GB. Free memory was 904.2 MB in the beginning and 876.1 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:30,955 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.21 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.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.48 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.87 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 2082.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.7 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9112.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 895.7 MB in the beginning and 904.2 MB in the end (delta: -8.5 MB). Peak memory consumption was 132.0 MB. Max. memory is 11.5 GB. * Witness Printer took 246.20 ms. Allocated memory is still 1.3 GB. Free memory was 904.2 MB in the beginning and 876.1 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4) || ((1 == a7 && a20 <= 0) && a16 == 5)) || ((1 == a7 && 15 == a8) && a16 == 5)) || (1 == a7 && a16 <= 4)) || ((((1 == a7 && !(a16 == 6)) && a17 == 1) && !(14 == a8)) && a21 == 1)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || ((((14 <= a8 && a17 == 1) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((14 <= a8 && a20 <= 0) && a16 == 5)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || (15 == a8 && a20 <= 0)) || (((1 == a7 && a17 <= 0) && !(14 == a8)) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4) || ((1 == a7 && a20 <= 0) && a16 == 5)) || ((1 == a7 && 15 == a8) && a16 == 5)) || (1 == a7 && a16 <= 4)) || ((((1 == a7 && !(a16 == 6)) && a17 == 1) && !(14 == a8)) && a21 == 1)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || ((((14 <= a8 && a17 == 1) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((14 <= a8 && a20 <= 0) && a16 == 5)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || (15 == a8 && a20 <= 0)) || (((1 == a7 && a17 <= 0) && !(14 == a8)) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 598 SDtfs, 1081 SDslu, 68 SDs, 0 SdLazy, 2845 SolverSat, 790 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 806 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1494occurred 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1082 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 361 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2485 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1300 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1667 NumberOfCodeBlocks, 1667 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2053 ConstructedInterpolants, 0 QuantifiedInterpolants, 678218 SizeOfPredicates, 2 NumberOfNonLiveVariables, 887 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2218/2272 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...