./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label22.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/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 03d2eba0c96e405e42abc242d8ae37d66c66f111 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:09:52,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:09:52,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:09:52,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:09:52,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:09:52,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:09:52,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:09:52,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:09:52,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:09:52,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:09:52,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:09:52,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:09:52,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:09:52,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:09:52,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:09:52,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:09:52,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:09:52,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:09:52,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:09:52,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:09:52,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:09:52,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:09:52,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:09:52,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:09:52,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:09:52,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:09:52,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:09:52,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:09:52,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:09:52,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:09:52,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:09:52,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:09:52,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:09:52,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:09:52,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:09:52,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:09:52,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:09:52,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:09:52,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:09:52,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:09:52,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:09:52,385 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:09:52,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:09:52,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:09:52,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:09:52,397 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:09:52,397 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:09:52,397 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:09:52,397 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:09:52,397 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:09:52,397 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:09:52,398 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:09:52,398 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:09:52,398 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:09:52,398 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:09:52,398 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:09:52,398 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:09:52,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:09:52,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:09:52,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:09:52,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:09:52,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:09:52,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:09:52,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:09:52,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:09:52,400 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:09:52,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:09:52,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:09:52,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:09:52,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:09:52,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:09:52,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:09:52,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:09:52,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:09:52,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:09:52,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:09:52,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:09:52,401 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:09:52,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:09:52,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:09:52,401 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:09:52,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:09:52,402 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_cccce67f-c03f-48f8-9460-939d0a75e005/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 -> 03d2eba0c96e405e42abc242d8ae37d66c66f111 [2019-12-07 13:09:52,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:09:52,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:09:52,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:09:52,508 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:09:52,509 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:09:52,509 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2019-12-07 13:09:52,544 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/data/36f675573/b680242f52f2460bbac9cb5f80e3a248/FLAG051d3e2a2 [2019-12-07 13:09:52,995 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:09:52,996 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2019-12-07 13:09:53,006 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/data/36f675573/b680242f52f2460bbac9cb5f80e3a248/FLAG051d3e2a2 [2019-12-07 13:09:53,018 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/data/36f675573/b680242f52f2460bbac9cb5f80e3a248 [2019-12-07 13:09:53,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:09:53,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:09:53,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:09:53,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:09:53,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:09:53,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c1cac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53, skipping insertion in model container [2019-12-07 13:09:53,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:09:53,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:09:53,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:09:53,359 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:09:53,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:09:53,423 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:09:53,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53 WrapperNode [2019-12-07 13:09:53,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:09:53,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:09:53,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:09:53,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:09:53,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:09:53,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:09:53,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:09:53,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:09:53,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... [2019-12-07 13:09:53,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:09:53,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:09:53,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:09:53,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:09:53,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/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-12-07 13:09:53,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:09:53,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:09:54,710 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:09:54,711 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:09:54,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:09:54 BoogieIcfgContainer [2019-12-07 13:09:54,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:09:54,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:09:54,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:09:54,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:09:54,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:09:53" (1/3) ... [2019-12-07 13:09:54,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4624e792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:09:54, skipping insertion in model container [2019-12-07 13:09:54,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:53" (2/3) ... [2019-12-07 13:09:54,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4624e792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:09:54, skipping insertion in model container [2019-12-07 13:09:54,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:09:54" (3/3) ... [2019-12-07 13:09:54,717 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label22.c [2019-12-07 13:09:54,723 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:09:54,728 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:09:54,736 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:09:54,751 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:09:54,752 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:09:54,752 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:09:54,752 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:09:54,752 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:09:54,752 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:09:54,752 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:09:54,752 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:09:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-12-07 13:09:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 13:09:54,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:54,782 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 13:09:54,782 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:54,791 INFO L82 PathProgramCache]: Analyzing trace with hash 925946761, now seen corresponding path program 1 times [2019-12-07 13:09:54,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:54,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527014723] [2019-12-07 13:09:54,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:09:55,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527014723] [2019-12-07 13:09:55,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:55,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:09:55,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777475068] [2019-12-07 13:09:55,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:55,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:55,036 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-12-07 13:09:55,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:55,426 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-12-07 13:09:55,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:09:55,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 13:09:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:55,437 INFO L225 Difference]: With dead ends: 333 [2019-12-07 13:09:55,438 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 13:09:55,440 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-12-07 13:09:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 13:09:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-12-07 13:09:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 13:09:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-12-07 13:09:55,485 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-12-07 13:09:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:55,485 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-12-07 13:09:55,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-12-07 13:09:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 13:09:55,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:55,489 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:55,490 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:55,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:55,490 INFO L82 PathProgramCache]: Analyzing trace with hash 221747240, now seen corresponding path program 1 times [2019-12-07 13:09:55,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:55,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045492592] [2019-12-07 13:09:55,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:09:55,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045492592] [2019-12-07 13:09:55,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:55,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:09:55,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743056609] [2019-12-07 13:09:55,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:55,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:55,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:55,553 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-12-07 13:09:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:55,874 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-12-07 13:09:55,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:09:55,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 13:09:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:55,878 INFO L225 Difference]: With dead ends: 807 [2019-12-07 13:09:55,878 INFO L226 Difference]: Without dead ends: 565 [2019-12-07 13:09:55,880 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-12-07 13:09:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-12-07 13:09:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-12-07 13:09:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-12-07 13:09:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-12-07 13:09:55,901 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-12-07 13:09:55,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:55,902 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-12-07 13:09:55,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-12-07 13:09:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 13:09:55,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:55,905 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:55,905 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:55,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:55,905 INFO L82 PathProgramCache]: Analyzing trace with hash -875197987, now seen corresponding path program 1 times [2019-12-07 13:09:55,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:55,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266559874] [2019-12-07 13:09:55,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:09:55,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266559874] [2019-12-07 13:09:55,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:55,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:09:55,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090429532] [2019-12-07 13:09:55,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:55,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:55,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:55,957 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-12-07 13:09:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:56,362 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-12-07 13:09:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:09:56,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 13:09:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:56,369 INFO L225 Difference]: With dead ends: 1445 [2019-12-07 13:09:56,369 INFO L226 Difference]: Without dead ends: 1043 [2019-12-07 13:09:56,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 13:09:56,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-07 13:09:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-12-07 13:09:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 13:09:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1446 transitions. [2019-12-07 13:09:56,401 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1446 transitions. Word has length 102 [2019-12-07 13:09:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:56,401 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1446 transitions. [2019-12-07 13:09:56,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1446 transitions. [2019-12-07 13:09:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 13:09:56,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:56,405 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:56,405 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:56,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:56,406 INFO L82 PathProgramCache]: Analyzing trace with hash 11612466, now seen corresponding path program 1 times [2019-12-07 13:09:56,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:56,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107533564] [2019-12-07 13:09:56,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:09:56,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107533564] [2019-12-07 13:09:56,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:56,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:09:56,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549568242] [2019-12-07 13:09:56,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:09:56,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:09:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:56,450 INFO L87 Difference]: Start difference. First operand 883 states and 1446 transitions. Second operand 3 states. [2019-12-07 13:09:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:56,702 INFO L93 Difference]: Finished difference Result 2165 states and 3502 transitions. [2019-12-07 13:09:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:56,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-12-07 13:09:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:56,709 INFO L225 Difference]: With dead ends: 2165 [2019-12-07 13:09:56,709 INFO L226 Difference]: Without dead ends: 1283 [2019-12-07 13:09:56,711 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-12-07 13:09:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-07 13:09:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-07 13:09:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-07 13:09:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1842 transitions. [2019-12-07 13:09:56,733 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1842 transitions. Word has length 102 [2019-12-07 13:09:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:56,734 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1842 transitions. [2019-12-07 13:09:56,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:09:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1842 transitions. [2019-12-07 13:09:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 13:09:56,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:56,736 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:56,736 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2118178421, now seen corresponding path program 1 times [2019-12-07 13:09:56,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:56,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263371017] [2019-12-07 13:09:56,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 13:09:56,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263371017] [2019-12-07 13:09:56,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:56,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:09:56,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525185771] [2019-12-07 13:09:56,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:09:56,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:56,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:09:56,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:56,797 INFO L87 Difference]: Start difference. First operand 1283 states and 1842 transitions. Second operand 3 states. [2019-12-07 13:09:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:57,062 INFO L93 Difference]: Finished difference Result 3045 states and 4319 transitions. [2019-12-07 13:09:57,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:57,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-12-07 13:09:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:57,071 INFO L225 Difference]: With dead ends: 3045 [2019-12-07 13:09:57,071 INFO L226 Difference]: Without dead ends: 1443 [2019-12-07 13:09:57,073 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-12-07 13:09:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-12-07 13:09:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1123. [2019-12-07 13:09:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-12-07 13:09:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1463 transitions. [2019-12-07 13:09:57,096 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1463 transitions. Word has length 107 [2019-12-07 13:09:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:57,096 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1463 transitions. [2019-12-07 13:09:57,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:09:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1463 transitions. [2019-12-07 13:09:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 13:09:57,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:57,098 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:57,098 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:57,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1735821681, now seen corresponding path program 1 times [2019-12-07 13:09:57,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:57,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558040149] [2019-12-07 13:09:57,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 13:09:57,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558040149] [2019-12-07 13:09:57,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:57,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:09:57,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794489025] [2019-12-07 13:09:57,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:57,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:57,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:57,165 INFO L87 Difference]: Start difference. First operand 1123 states and 1463 transitions. Second operand 4 states. [2019-12-07 13:09:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:57,541 INFO L93 Difference]: Finished difference Result 2725 states and 3556 transitions. [2019-12-07 13:09:57,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:09:57,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 13:09:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:57,547 INFO L225 Difference]: With dead ends: 2725 [2019-12-07 13:09:57,547 INFO L226 Difference]: Without dead ends: 1363 [2019-12-07 13:09:57,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 13:09:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-12-07 13:09:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 963. [2019-12-07 13:09:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 13:09:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1224 transitions. [2019-12-07 13:09:57,567 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1224 transitions. Word has length 118 [2019-12-07 13:09:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:57,567 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1224 transitions. [2019-12-07 13:09:57,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1224 transitions. [2019-12-07 13:09:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 13:09:57,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:57,569 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:57,569 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:57,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1692477197, now seen corresponding path program 1 times [2019-12-07 13:09:57,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:57,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814346142] [2019-12-07 13:09:57,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:09:57,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814346142] [2019-12-07 13:09:57,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:57,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:09:57,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439814689] [2019-12-07 13:09:57,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:09:57,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:57,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:09:57,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:57,612 INFO L87 Difference]: Start difference. First operand 963 states and 1224 transitions. Second operand 3 states. [2019-12-07 13:09:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:57,826 INFO L93 Difference]: Finished difference Result 2005 states and 2525 transitions. [2019-12-07 13:09:57,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:57,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-12-07 13:09:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:57,830 INFO L225 Difference]: With dead ends: 2005 [2019-12-07 13:09:57,830 INFO L226 Difference]: Without dead ends: 1043 [2019-12-07 13:09:57,831 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-12-07 13:09:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-07 13:09:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-12-07 13:09:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-07 13:09:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1236 transitions. [2019-12-07 13:09:57,849 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1236 transitions. Word has length 131 [2019-12-07 13:09:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:57,849 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1236 transitions. [2019-12-07 13:09:57,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:09:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1236 transitions. [2019-12-07 13:09:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-12-07 13:09:57,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:57,852 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:57,852 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1881565628, now seen corresponding path program 1 times [2019-12-07 13:09:57,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:57,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919583715] [2019-12-07 13:09:57,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-12-07 13:09:57,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919583715] [2019-12-07 13:09:57,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559521990] [2019-12-07 13:09:57,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/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-12-07 13:09:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:58,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 13:09:58,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:09:58,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:09:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-12-07 13:09:58,151 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:09:58,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:09:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-12-07 13:09:58,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:09:58,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 6 [2019-12-07 13:09:58,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577177101] [2019-12-07 13:09:58,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:09:58,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:58,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:09:58,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:09:58,208 INFO L87 Difference]: Start difference. First operand 1043 states and 1236 transitions. Second operand 5 states. [2019-12-07 13:09:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:58,637 INFO L93 Difference]: Finished difference Result 2121 states and 2507 transitions. [2019-12-07 13:09:58,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:09:58,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-12-07 13:09:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:58,641 INFO L225 Difference]: With dead ends: 2121 [2019-12-07 13:09:58,641 INFO L226 Difference]: Without dead ends: 1079 [2019-12-07 13:09:58,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:09:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-12-07 13:09:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1043. [2019-12-07 13:09:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-07 13:09:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1223 transitions. [2019-12-07 13:09:58,662 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1223 transitions. Word has length 223 [2019-12-07 13:09:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:58,662 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1223 transitions. [2019-12-07 13:09:58,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:09:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1223 transitions. [2019-12-07 13:09:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-12-07 13:09:58,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:58,665 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:58,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:09:58,866 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:58,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1701280113, now seen corresponding path program 1 times [2019-12-07 13:09:58,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:58,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061635170] [2019-12-07 13:09:58,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-12-07 13:09:58,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061635170] [2019-12-07 13:09:58,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:58,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:09:58,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049945966] [2019-12-07 13:09:58,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:09:58,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:09:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:58,945 INFO L87 Difference]: Start difference. First operand 1043 states and 1223 transitions. Second operand 3 states. [2019-12-07 13:09:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:59,183 INFO L93 Difference]: Finished difference Result 2485 states and 2935 transitions. [2019-12-07 13:09:59,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:59,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-12-07 13:09:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:59,189 INFO L225 Difference]: With dead ends: 2485 [2019-12-07 13:09:59,189 INFO L226 Difference]: Without dead ends: 1363 [2019-12-07 13:09:59,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-12-07 13:09:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1203. [2019-12-07 13:09:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-07 13:09:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1381 transitions. [2019-12-07 13:09:59,215 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1381 transitions. Word has length 251 [2019-12-07 13:09:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:59,215 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1381 transitions. [2019-12-07 13:09:59,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:09:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1381 transitions. [2019-12-07 13:09:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-07 13:09:59,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:59,218 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:59,218 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:59,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash 916985848, now seen corresponding path program 1 times [2019-12-07 13:09:59,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:59,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596678327] [2019-12-07 13:09:59,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 250 proven. 9 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-12-07 13:09:59,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596678327] [2019-12-07 13:09:59,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815839229] [2019-12-07 13:09:59,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/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-12-07 13:09:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:59,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:09:59,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:09:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-12-07 13:09:59,535 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:09:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-12-07 13:09:59,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:09:59,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 10 [2019-12-07 13:09:59,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271551739] [2019-12-07 13:09:59,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:59,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:09:59,579 INFO L87 Difference]: Start difference. First operand 1203 states and 1381 transitions. Second operand 4 states. [2019-12-07 13:09:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:59,923 INFO L93 Difference]: Finished difference Result 2483 states and 2835 transitions. [2019-12-07 13:09:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:09:59,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-12-07 13:09:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:59,924 INFO L225 Difference]: With dead ends: 2483 [2019-12-07 13:09:59,924 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:09:59,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:09:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:09:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:09:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:09:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:09:59,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2019-12-07 13:09:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:59,926 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:09:59,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:09:59,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:10:00,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:10:00,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 13:10:00,599 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-12-07 13:10:00,955 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-12-07 13:10:00,958 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-12-07 13:10:00,958 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-12-07 13:10:00,958 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-12-07 13:10:00,958 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-12-07 13:10:00,958 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-12-07 13:10:00,958 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-12-07 13:10:00,958 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-12-07 13:10:00,958 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-12-07 13:10:00,958 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-12-07 13:10:00,959 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 13:10:00,960 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 463) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L463(line 463) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-12-07 13:10:00,961 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-12-07 13:10:00,962 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse6 (= ~a25~0 1))) (let ((.cse5 (not .cse6)) (.cse3 (not (= ~a28~0 11))) (.cse9 (= ~a11~0 1)) (.cse10 (= ~a19~0 1))) (let ((.cse7 (not .cse10)) (.cse4 (<= ~a19~0 0)) (.cse12 (= ~a28~0 7)) (.cse0 (<= 10 ~a28~0)) (.cse11 (or (and .cse5 .cse9 .cse3) (and .cse10 .cse9))) (.cse8 (= ~a28~0 9)) (.cse1 (= ~a17~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1) (and .cse1 .cse6 .cse3) (and .cse7 .cse5 .cse1 .cse3) (and .cse8 .cse4) (and .cse8 .cse7 .cse9) (and .cse0 .cse10 .cse6) (and .cse4 .cse11) (and .cse1 .cse12 .cse2) (and .cse12 .cse6 .cse11) (and .cse5 .cse1 .cse9 .cse3) (and .cse0 .cse11) (and .cse8 .cse1 .cse2))))) [2019-12-07 13:10:00,962 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-12-07 13:10:00,962 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-12-07 13:10:00,962 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-12-07 13:10:00,962 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-12-07 13:10:00,962 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-12-07 13:10:00,962 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-12-07 13:10:00,962 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse6 (= ~a25~0 1))) (let ((.cse5 (not .cse6)) (.cse3 (not (= ~a28~0 11))) (.cse9 (= ~a11~0 1)) (.cse10 (= ~a19~0 1))) (let ((.cse7 (not .cse10)) (.cse4 (<= ~a19~0 0)) (.cse12 (= ~a28~0 7)) (.cse0 (<= 10 ~a28~0)) (.cse11 (or (and .cse5 .cse9 .cse3) (and .cse10 .cse9))) (.cse8 (= ~a28~0 9)) (.cse1 (= ~a17~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1) (and .cse1 .cse6 .cse3) (and .cse7 .cse5 .cse1 .cse3) (and .cse8 .cse4) (and .cse8 .cse7 .cse9) (and .cse0 .cse10 .cse6) (and .cse4 .cse11) (and .cse1 .cse12 .cse2) (and .cse12 .cse6 .cse11) (and .cse5 .cse1 .cse9 .cse3) (and .cse0 .cse11) (and .cse8 .cse1 .cse2))))) [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-12-07 13:10:00,963 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-12-07 13:10:00,964 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-12-07 13:10:00,965 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-12-07 13:10:00,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:10:00 BoogieIcfgContainer [2019-12-07 13:10:00,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:10:00,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:10:00,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:10:00,986 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:10:00,986 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:09:54" (3/4) ... [2019-12-07 13:10:00,989 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:10:01,009 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 110 nodes and edges [2019-12-07 13:10:01,011 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 13:10:01,012 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 13:10:01,013 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 13:10:01,114 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cccce67f-c03f-48f8-9460-939d0a75e005/bin/utaipan/witness.graphml [2019-12-07 13:10:01,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:10:01,116 INFO L168 Benchmark]: Toolchain (without parser) took 8094.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.6 MB). Free memory was 934.0 MB in the beginning and 991.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 278.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:10:01,116 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:10:01,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:10:01,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:10:01,117 INFO L168 Benchmark]: Boogie Preprocessor took 39.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:10:01,117 INFO L168 Benchmark]: RCFGBuilder took 1195.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 847.8 MB in the end (delta: 220.4 MB). Peak memory consumption was 220.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:10:01,118 INFO L168 Benchmark]: TraceAbstraction took 6272.85 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 847.8 MB in the beginning and 1.0 GB in the end (delta: -167.9 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:10:01,118 INFO L168 Benchmark]: Witness Printer took 129.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 991.8 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:10:01,119 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1195.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 847.8 MB in the end (delta: 220.4 MB). Peak memory consumption was 220.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6272.85 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 847.8 MB in the beginning and 1.0 GB in the end (delta: -167.9 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. * Witness Printer took 129.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 991.8 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 463]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((10 <= a28 && a17 == 8) && a21 == 1) && !(a28 == 11)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || (a28 == 9 && a19 <= 0)) || ((a28 == 9 && !(a19 == 1)) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a25 == 1)) || (a19 <= 0 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((a28 == 7 && a25 == 1) && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11))) || (10 <= a28 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || ((a28 == 9 && a17 == 8) && a21 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((10 <= a28 && a17 == 8) && a21 == 1) && !(a28 == 11)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || (a28 == 9 && a19 <= 0)) || ((a28 == 9 && !(a19 == 1)) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a25 == 1)) || (a19 <= 0 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((a28 == 7 && a25 == 1) && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11))) || (10 <= a28 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || (a19 == 1 && a11 == 1)))) || ((a28 == 9 && a17 == 8) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 5.3s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 737 SDtfs, 1212 SDslu, 125 SDs, 0 SdLazy, 3527 SolverSat, 837 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 997 GetRequests, 964 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1283occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1238 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 54 NumberOfFragments, 383 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1710 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1640 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1947 NumberOfCodeBlocks, 1947 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2412 ConstructedInterpolants, 0 QuantifiedInterpolants, 1193848 SizeOfPredicates, 8 NumberOfNonLiveVariables, 847 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2601/2613 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...