./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/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 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:54:24,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:54:24,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:54:24,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:54:24,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:54:24,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:54:24,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:54:24,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:54:24,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:54:24,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:54:24,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:54:24,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:54:24,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:54:24,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:54:24,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:54:24,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:54:24,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:54:24,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:54:24,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:54:24,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:54:24,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:54:24,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:54:24,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:54:24,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:54:24,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:54:24,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:54:24,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:54:24,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:54:24,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:54:24,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:54:24,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:54:24,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:54:24,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:54:24,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:54:24,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:54:24,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:54:24,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:54:24,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:54:24,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:54:24,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:54:24,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:54:24,375 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:54:24,399 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:54:24,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:54:24,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:54:24,407 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:54:24,408 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:54:24,408 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:54:24,408 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:54:24,408 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:54:24,408 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:54:24,409 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:54:24,409 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:54:24,409 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:54:24,409 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:54:24,409 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:54:24,409 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:54:24,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:54:24,410 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:54:24,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:54:24,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:54:24,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:54:24,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:54:24,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:54:24,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:54:24,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:54:24,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:54:24,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:54:24,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:54:24,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:54:24,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:54:24,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:54:24,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:54:24,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:54:24,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:54:24,413 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:54:24,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:54:24,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:54:24,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:54:24,414 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_a21fa52b-2eeb-4358-8684-64de5ea662aa/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 -> 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 [2019-11-26 02:54:24,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:54:24,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:54:24,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:54:24,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:54:24,571 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:54:24,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-11-26 02:54:24,644 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/data/cf12df0e0/56b2c353dcf749c2a1805e4a75d72972/FLAG7328a5e0c [2019-11-26 02:54:25,181 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:54:25,182 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-11-26 02:54:25,194 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/data/cf12df0e0/56b2c353dcf749c2a1805e4a75d72972/FLAG7328a5e0c [2019-11-26 02:54:25,642 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/data/cf12df0e0/56b2c353dcf749c2a1805e4a75d72972 [2019-11-26 02:54:25,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:54:25,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:54:25,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:54:25,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:54:25,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:54:25,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:54:25" (1/1) ... [2019-11-26 02:54:25,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b4ff5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:25, skipping insertion in model container [2019-11-26 02:54:25,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:54:25" (1/1) ... [2019-11-26 02:54:25,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:54:25,723 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:54:26,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:54:26,214 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:54:26,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:54:26,339 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:54:26,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26 WrapperNode [2019-11-26 02:54:26,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:54:26,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:54:26,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:54:26,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:54:26,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... [2019-11-26 02:54:26,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... [2019-11-26 02:54:26,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:54:26,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:54:26,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:54:26,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:54:26,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... [2019-11-26 02:54:26,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... [2019-11-26 02:54:26,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... [2019-11-26 02:54:26,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... [2019-11-26 02:54:26,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... [2019-11-26 02:54:26,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... [2019-11-26 02:54:26,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... [2019-11-26 02:54:26,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:54:26,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:54:26,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:54:26,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:54:26,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:54:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:54:26,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:54:28,412 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:54:28,412 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:54:28,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:54:28 BoogieIcfgContainer [2019-11-26 02:54:28,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:54:28,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:54:28,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:54:28,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:54:28,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:54:25" (1/3) ... [2019-11-26 02:54:28,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2b25e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:54:28, skipping insertion in model container [2019-11-26 02:54:28,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:26" (2/3) ... [2019-11-26 02:54:28,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2b25e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:54:28, skipping insertion in model container [2019-11-26 02:54:28,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:54:28" (3/3) ... [2019-11-26 02:54:28,421 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label29.c [2019-11-26 02:54:28,430 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:54:28,436 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:54:28,447 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:54:28,469 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:54:28,470 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:54:28,470 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:54:28,470 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:54:28,470 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:54:28,470 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:54:28,471 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:54:28,471 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:54:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:54:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:54:28,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:28,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:28,503 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:28,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:28,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1323242271, now seen corresponding path program 1 times [2019-11-26 02:54:28,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:28,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2846918] [2019-11-26 02:54:28,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:28,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2846918] [2019-11-26 02:54:28,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:28,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:54:28,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539478774] [2019-11-26 02:54:28,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:54:28,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:54:28,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:54:28,890 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:54:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:29,559 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:54:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:54:29,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:54:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:29,577 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:54:29,577 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:54:29,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:54:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:54:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-26 02:54:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-26 02:54:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 372 transitions. [2019-11-26 02:54:29,653 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 372 transitions. Word has length 71 [2019-11-26 02:54:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:29,654 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 372 transitions. [2019-11-26 02:54:29,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:54:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 372 transitions. [2019-11-26 02:54:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:54:29,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:29,664 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:29,664 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2123299564, now seen corresponding path program 1 times [2019-11-26 02:54:29,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:29,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117719087] [2019-11-26 02:54:29,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:29,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117719087] [2019-11-26 02:54:29,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:29,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:54:29,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311364901] [2019-11-26 02:54:29,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:54:29,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:29,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:54:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:54:29,830 INFO L87 Difference]: Start difference. First operand 216 states and 372 transitions. Second operand 4 states. [2019-11-26 02:54:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:30,425 INFO L93 Difference]: Finished difference Result 786 states and 1358 transitions. [2019-11-26 02:54:30,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:54:30,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-26 02:54:30,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:30,430 INFO L225 Difference]: With dead ends: 786 [2019-11-26 02:54:30,430 INFO L226 Difference]: Without dead ends: 571 [2019-11-26 02:54:30,433 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-11-26 02:54:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-26 02:54:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 358. [2019-11-26 02:54:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-26 02:54:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2019-11-26 02:54:30,456 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 78 [2019-11-26 02:54:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:30,457 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2019-11-26 02:54:30,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:54:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2019-11-26 02:54:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-26 02:54:30,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:30,460 INFO L410 BasicCegarLoop]: trace histogram [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-11-26 02:54:30,460 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1800587057, now seen corresponding path program 1 times [2019-11-26 02:54:30,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:30,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930918095] [2019-11-26 02:54:30,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:30,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930918095] [2019-11-26 02:54:30,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:30,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:54:30,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869403237] [2019-11-26 02:54:30,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:54:30,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:30,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:54:30,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:54:30,522 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2019-11-26 02:54:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:31,040 INFO L93 Difference]: Finished difference Result 857 states and 1277 transitions. [2019-11-26 02:54:31,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:54:31,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-26 02:54:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:31,043 INFO L225 Difference]: With dead ends: 857 [2019-11-26 02:54:31,044 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:54:31,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:54:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:54:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:54:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:54:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2019-11-26 02:54:31,068 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 92 [2019-11-26 02:54:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:31,068 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2019-11-26 02:54:31,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:54:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2019-11-26 02:54:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-26 02:54:31,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:31,073 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] [2019-11-26 02:54:31,073 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1032091212, now seen corresponding path program 1 times [2019-11-26 02:54:31,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:31,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309967408] [2019-11-26 02:54:31,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:31,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309967408] [2019-11-26 02:54:31,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:31,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:54:31,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179965747] [2019-11-26 02:54:31,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:54:31,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:54:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:31,151 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand 3 states. [2019-11-26 02:54:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:31,491 INFO L93 Difference]: Finished difference Result 1212 states and 1622 transitions. [2019-11-26 02:54:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:54:31,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-26 02:54:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:31,496 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:54:31,496 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:54:31,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:54:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-26 02:54:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:54:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 832 transitions. [2019-11-26 02:54:31,517 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 832 transitions. Word has length 93 [2019-11-26 02:54:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:31,518 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 832 transitions. [2019-11-26 02:54:31,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:54:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 832 transitions. [2019-11-26 02:54:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-26 02:54:31,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:31,520 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-26 02:54:31,520 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:31,521 INFO L82 PathProgramCache]: Analyzing trace with hash 143196804, now seen corresponding path program 1 times [2019-11-26 02:54:31,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:31,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604273122] [2019-11-26 02:54:31,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:54:31,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604273122] [2019-11-26 02:54:31,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:31,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:54:31,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698387032] [2019-11-26 02:54:31,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:54:31,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:54:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:31,590 INFO L87 Difference]: Start difference. First operand 642 states and 832 transitions. Second operand 3 states. [2019-11-26 02:54:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:31,940 INFO L93 Difference]: Finished difference Result 1709 states and 2231 transitions. [2019-11-26 02:54:31,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:54:31,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-26 02:54:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:31,947 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:54:31,948 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:54:31,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:54:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-26 02:54:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:54:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1120 transitions. [2019-11-26 02:54:31,980 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1120 transitions. Word has length 97 [2019-11-26 02:54:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:31,981 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1120 transitions. [2019-11-26 02:54:31,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:54:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1120 transitions. [2019-11-26 02:54:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-26 02:54:31,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:31,984 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-26 02:54:31,984 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1126554846, now seen corresponding path program 1 times [2019-11-26 02:54:31,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:31,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007906740] [2019-11-26 02:54:31,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:54:32,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007906740] [2019-11-26 02:54:32,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:32,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:54:32,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754016028] [2019-11-26 02:54:32,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:54:32,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:54:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:32,046 INFO L87 Difference]: Start difference. First operand 855 states and 1120 transitions. Second operand 3 states. [2019-11-26 02:54:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:32,346 INFO L93 Difference]: Finished difference Result 1780 states and 2331 transitions. [2019-11-26 02:54:32,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:54:32,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-26 02:54:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:32,352 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:54:32,352 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:54:32,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:54:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 855. [2019-11-26 02:54:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:54:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1120 transitions. [2019-11-26 02:54:32,379 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1120 transitions. Word has length 99 [2019-11-26 02:54:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:32,382 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1120 transitions. [2019-11-26 02:54:32,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:54:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1120 transitions. [2019-11-26 02:54:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-26 02:54:32,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:32,385 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, 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] [2019-11-26 02:54:32,385 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash 397471261, now seen corresponding path program 1 times [2019-11-26 02:54:32,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:32,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687085310] [2019-11-26 02:54:32,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:32,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687085310] [2019-11-26 02:54:32,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:32,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:54:32,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160696723] [2019-11-26 02:54:32,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:54:32,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:32,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:54:32,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:32,483 INFO L87 Difference]: Start difference. First operand 855 states and 1120 transitions. Second operand 3 states. [2019-11-26 02:54:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:32,784 INFO L93 Difference]: Finished difference Result 1922 states and 2489 transitions. [2019-11-26 02:54:32,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:54:32,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-26 02:54:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:32,790 INFO L225 Difference]: With dead ends: 1922 [2019-11-26 02:54:32,791 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:54:32,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:54:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-26 02:54:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:54:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1283 transitions. [2019-11-26 02:54:32,815 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1283 transitions. Word has length 100 [2019-11-26 02:54:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:32,816 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1283 transitions. [2019-11-26 02:54:32,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:54:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1283 transitions. [2019-11-26 02:54:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-26 02:54:32,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:32,819 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:32,819 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:32,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2113450725, now seen corresponding path program 1 times [2019-11-26 02:54:32,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:32,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899539477] [2019-11-26 02:54:32,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:32,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899539477] [2019-11-26 02:54:32,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:32,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:54:32,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556775088] [2019-11-26 02:54:32,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:54:32,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:33,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:54:33,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:54:33,000 INFO L87 Difference]: Start difference. First operand 997 states and 1283 transitions. Second operand 8 states. [2019-11-26 02:54:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:33,729 INFO L93 Difference]: Finished difference Result 2106 states and 2697 transitions. [2019-11-26 02:54:33,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:54:33,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-11-26 02:54:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:33,737 INFO L225 Difference]: With dead ends: 2106 [2019-11-26 02:54:33,737 INFO L226 Difference]: Without dead ends: 1181 [2019-11-26 02:54:33,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:54:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-11-26 02:54:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 997. [2019-11-26 02:54:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:54:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1271 transitions. [2019-11-26 02:54:33,764 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1271 transitions. Word has length 104 [2019-11-26 02:54:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:33,764 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1271 transitions. [2019-11-26 02:54:33,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:54:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1271 transitions. [2019-11-26 02:54:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-26 02:54:33,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:33,768 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-26 02:54:33,768 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash 58783804, now seen corresponding path program 1 times [2019-11-26 02:54:33,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:33,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567907490] [2019-11-26 02:54:33,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-26 02:54:33,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567907490] [2019-11-26 02:54:33,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:33,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:54:33,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862659650] [2019-11-26 02:54:33,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:54:33,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:54:33,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:33,824 INFO L87 Difference]: Start difference. First operand 997 states and 1271 transitions. Second operand 3 states. [2019-11-26 02:54:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:34,110 INFO L93 Difference]: Finished difference Result 1993 states and 2539 transitions. [2019-11-26 02:54:34,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:54:34,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-26 02:54:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:34,115 INFO L225 Difference]: With dead ends: 1993 [2019-11-26 02:54:34,115 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:54:34,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:54:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-26 02:54:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:54:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1158 transitions. [2019-11-26 02:54:34,171 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1158 transitions. Word has length 127 [2019-11-26 02:54:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:34,172 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1158 transitions. [2019-11-26 02:54:34,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:54:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1158 transitions. [2019-11-26 02:54:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-26 02:54:34,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:34,175 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:34,175 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:34,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:34,175 INFO L82 PathProgramCache]: Analyzing trace with hash -681224459, now seen corresponding path program 1 times [2019-11-26 02:54:34,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:34,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127142583] [2019-11-26 02:54:34,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:54:34,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127142583] [2019-11-26 02:54:34,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:34,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-26 02:54:34,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516138205] [2019-11-26 02:54:34,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:54:34,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:34,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:54:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:54:34,803 INFO L87 Difference]: Start difference. First operand 997 states and 1158 transitions. Second operand 12 states. [2019-11-26 02:54:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:35,676 INFO L93 Difference]: Finished difference Result 2051 states and 2407 transitions. [2019-11-26 02:54:35,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:54:35,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-11-26 02:54:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:35,682 INFO L225 Difference]: With dead ends: 2051 [2019-11-26 02:54:35,682 INFO L226 Difference]: Without dead ends: 1126 [2019-11-26 02:54:35,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:54:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-11-26 02:54:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 984. [2019-11-26 02:54:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-26 02:54:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1135 transitions. [2019-11-26 02:54:35,710 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1135 transitions. Word has length 137 [2019-11-26 02:54:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:35,710 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1135 transitions. [2019-11-26 02:54:35,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:54:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1135 transitions. [2019-11-26 02:54:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-26 02:54:35,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:35,714 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-26 02:54:35,714 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:35,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1012111852, now seen corresponding path program 1 times [2019-11-26 02:54:35,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:35,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949752198] [2019-11-26 02:54:35,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-26 02:54:35,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949752198] [2019-11-26 02:54:35,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:35,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:54:35,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438420400] [2019-11-26 02:54:35,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:54:35,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:35,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:54:35,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:35,801 INFO L87 Difference]: Start difference. First operand 984 states and 1135 transitions. Second operand 3 states. [2019-11-26 02:54:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:36,051 INFO L93 Difference]: Finished difference Result 1967 states and 2269 transitions. [2019-11-26 02:54:36,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:54:36,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-26 02:54:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:36,056 INFO L225 Difference]: With dead ends: 1967 [2019-11-26 02:54:36,056 INFO L226 Difference]: Without dead ends: 984 [2019-11-26 02:54:36,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:54:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-11-26 02:54:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 913. [2019-11-26 02:54:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-11-26 02:54:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1041 transitions. [2019-11-26 02:54:36,078 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1041 transitions. Word has length 165 [2019-11-26 02:54:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:36,079 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1041 transitions. [2019-11-26 02:54:36,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:54:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1041 transitions. [2019-11-26 02:54:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-26 02:54:36,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:36,083 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:36,083 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:36,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:36,084 INFO L82 PathProgramCache]: Analyzing trace with hash -241783688, now seen corresponding path program 1 times [2019-11-26 02:54:36,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:36,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137480826] [2019-11-26 02:54:36,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-26 02:54:36,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137480826] [2019-11-26 02:54:36,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:36,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:54:36,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244329534] [2019-11-26 02:54:36,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:54:36,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:54:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:54:36,234 INFO L87 Difference]: Start difference. First operand 913 states and 1041 transitions. Second operand 6 states. [2019-11-26 02:54:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:36,692 INFO L93 Difference]: Finished difference Result 1922 states and 2203 transitions. [2019-11-26 02:54:36,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:54:36,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2019-11-26 02:54:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:36,696 INFO L225 Difference]: With dead ends: 1922 [2019-11-26 02:54:36,696 INFO L226 Difference]: Without dead ends: 1081 [2019-11-26 02:54:36,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:54:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-11-26 02:54:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1055. [2019-11-26 02:54:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-11-26 02:54:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1179 transitions. [2019-11-26 02:54:36,720 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1179 transitions. Word has length 209 [2019-11-26 02:54:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:36,720 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 1179 transitions. [2019-11-26 02:54:36,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:54:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1179 transitions. [2019-11-26 02:54:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-26 02:54:36,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:36,725 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:36,725 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:36,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:36,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1191094894, now seen corresponding path program 1 times [2019-11-26 02:54:36,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:36,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418276058] [2019-11-26 02:54:36,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-26 02:54:36,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418276058] [2019-11-26 02:54:36,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:36,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:54:36,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816365333] [2019-11-26 02:54:36,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:54:36,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:36,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:54:36,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:54:36,907 INFO L87 Difference]: Start difference. First operand 1055 states and 1179 transitions. Second operand 5 states. [2019-11-26 02:54:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:37,410 INFO L93 Difference]: Finished difference Result 2109 states and 2355 transitions. [2019-11-26 02:54:37,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:54:37,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-11-26 02:54:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:37,415 INFO L225 Difference]: With dead ends: 2109 [2019-11-26 02:54:37,416 INFO L226 Difference]: Without dead ends: 984 [2019-11-26 02:54:37,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:54:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-11-26 02:54:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2019-11-26 02:54:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-26 02:54:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1101 transitions. [2019-11-26 02:54:37,436 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1101 transitions. Word has length 232 [2019-11-26 02:54:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:37,436 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1101 transitions. [2019-11-26 02:54:37,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:54:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1101 transitions. [2019-11-26 02:54:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-26 02:54:37,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:54:37,441 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:54:37,441 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:54:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:54:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash 103089892, now seen corresponding path program 1 times [2019-11-26 02:54:37,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:54:37,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048912407] [2019-11-26 02:54:37,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:54:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:54:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-11-26 02:54:37,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048912407] [2019-11-26 02:54:37,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:54:37,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:54:37,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370178602] [2019-11-26 02:54:37,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:54:37,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:54:37,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:54:37,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:54:37,660 INFO L87 Difference]: Start difference. First operand 984 states and 1101 transitions. Second operand 4 states. [2019-11-26 02:54:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:54:37,971 INFO L93 Difference]: Finished difference Result 1965 states and 2208 transitions. [2019-11-26 02:54:37,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:54:37,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-26 02:54:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:54:37,972 INFO L225 Difference]: With dead ends: 1965 [2019-11-26 02:54:37,972 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:54:37,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:54:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:54:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:54:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:54:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:54:37,974 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2019-11-26 02:54:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:54:37,975 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:54:37,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:54:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:54:37,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:54:37,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:54:38,312 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-26 02:54:38,489 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-26 02:54:38,492 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:54:38,492 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:54:38,492 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:54:38,492 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:54:38,492 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:54:38,492 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:54:38,492 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:54:38,493 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:54:38,494 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a17~0 1)) (.cse6 (= ~a16~0 5)) (.cse3 (not (= 1 ~a7~0))) (.cse4 (= ~a12~0 8)) (.cse5 (<= ~a17~0 0)) (.cse8 (= ~a16~0 4)) (.cse0 (not (= 15 ~a8~0))) (.cse2 (= ~a21~0 1)) (.cse7 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse2) (and .cse4 .cse5 .cse2 .cse6) (and .cse0 .cse1 .cse7 .cse6) (and .cse0 .cse6 (not (= 13 ~a8~0))) (and .cse8 .cse4 .cse5 .cse2) (and .cse0 .cse5) (and .cse3 .cse4 .cse5 .cse2) (and .cse8 .cse0) (and .cse0 .cse2 .cse7))) [2019-11-26 02:54:38,494 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:54:38,494 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:54:38,494 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:54:38,494 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:54:38,494 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-26 02:54:38,495 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:54:38,496 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:54:38,497 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a17~0 1)) (.cse6 (= ~a16~0 5)) (.cse3 (not (= 1 ~a7~0))) (.cse4 (= ~a12~0 8)) (.cse5 (<= ~a17~0 0)) (.cse8 (= ~a16~0 4)) (.cse0 (not (= 15 ~a8~0))) (.cse2 (= ~a21~0 1)) (.cse7 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse2) (and .cse4 .cse5 .cse2 .cse6) (and .cse0 .cse1 .cse7 .cse6) (and .cse0 .cse6 (not (= 13 ~a8~0))) (and .cse8 .cse4 .cse5 .cse2) (and .cse0 .cse5) (and .cse3 .cse4 .cse5 .cse2) (and .cse8 .cse0) (and .cse0 .cse2 .cse7))) [2019-11-26 02:54:38,497 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:54:38,497 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:54:38,497 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:54:38,497 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:54:38,497 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:54:38,497 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:54:38,497 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:54:38,497 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:54:38,498 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:54:38,499 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:54:38,500 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:54:38,500 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:54:38,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:54:38 BoogieIcfgContainer [2019-11-26 02:54:38,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:54:38,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:54:38,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:54:38,536 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:54:38,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:54:28" (3/4) ... [2019-11-26 02:54:38,540 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:54:38,568 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 100 nodes and edges [2019-11-26 02:54:38,570 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-26 02:54:38,571 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:54:38,573 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:54:38,774 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a21fa52b-2eeb-4358-8684-64de5ea662aa/bin/utaipan/witness.graphml [2019-11-26 02:54:38,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:54:38,776 INFO L168 Benchmark]: Toolchain (without parser) took 13129.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 216.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:38,776 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:54:38,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:38,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:38,777 INFO L168 Benchmark]: Boogie Preprocessor took 77.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:54:38,778 INFO L168 Benchmark]: RCFGBuilder took 1901.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.9 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:38,778 INFO L168 Benchmark]: TraceAbstraction took 10121.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 283.6 MB). Free memory was 885.5 MB in the beginning and 1.2 GB in the end (delta: -283.4 MB). Peak memory consumption was 262.4 kB. Max. memory is 11.5 GB. [2019-11-26 02:54:38,779 INFO L168 Benchmark]: Witness Printer took 238.46 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:54:38,781 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 693.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1901.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.9 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10121.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 283.6 MB). Free memory was 885.5 MB in the beginning and 1.2 GB in the end (delta: -283.4 MB). Peak memory consumption was 262.4 kB. Max. memory is 11.5 GB. * Witness Printer took 238.46 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((!(15 == a8) && a17 == 1) && a21 == 1) || (((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((!(15 == a8) && a17 == 1) && a20 == 1) && a16 == 5)) || ((!(15 == a8) && a16 == 5) && !(13 == a8))) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (!(15 == a8) && a17 <= 0)) || (((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1)) || (a16 == 4 && !(15 == a8))) || ((!(15 == a8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((!(15 == a8) && a17 == 1) && a21 == 1) || (((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((!(15 == a8) && a17 == 1) && a20 == 1) && a16 == 5)) || ((!(15 == a8) && a16 == 5) && !(13 == a8))) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (!(15 == a8) && a17 <= 0)) || (((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1)) || (a16 == 4 && !(15 == a8))) || ((!(15 == a8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 10.0s, OverallIterations: 14, TraceHistogramMax: 8, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 704 SDtfs, 1611 SDslu, 124 SDs, 0 SdLazy, 4837 SolverSat, 846 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1055occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1133 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 239 HoareAnnotationTreeSize, 3 FomulaSimplifications, 17585 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 256 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1847 NumberOfCodeBlocks, 1847 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1833 ConstructedInterpolants, 0 QuantifiedInterpolants, 933466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1734/1734 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...