./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label36.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_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label36.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/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 c5d4c7b38a296f79910d0f6d17d9b88307731454 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:06,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:22:06,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:22:06,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:22:06,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:22:06,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:22:06,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:22:06,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:22:06,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:22:06,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:22:06,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:22:06,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:22:06,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:22:06,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:22:06,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:22:06,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:22:06,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:22:06,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:22:06,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:22:06,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:22:06,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:22:06,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:22:06,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:22:06,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:22:06,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:22:06,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:22:06,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:22:06,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:22:06,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:22:06,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:22:06,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:22:06,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:22:06,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:22:06,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:22:06,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:22:06,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:22:06,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:22:06,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:22:06,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:22:06,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:22:06,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:22:06,602 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:22:06,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:22:06,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:22:06,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:22:06,616 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:22:06,616 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:22:06,616 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:22:06,617 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:22:06,617 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:22:06,617 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:22:06,617 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:22:06,617 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:22:06,618 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:22:06,618 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:22:06,618 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:22:06,618 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:22:06,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:22:06,619 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:22:06,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:22:06,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:22:06,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:22:06,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:22:06,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:22:06,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:22:06,620 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:22:06,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:22:06,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:22:06,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:22:06,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:22:06,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:22:06,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:22:06,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:22:06,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:22:06,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:22:06,622 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:22:06,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:22:06,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:22:06,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:22:06,623 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_5f221930-ace1-4992-8e5d-95cd46c270d0/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 -> c5d4c7b38a296f79910d0f6d17d9b88307731454 [2019-11-26 02:22:06,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:22:06,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:22:06,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:22:06,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:22:06,821 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:22:06,821 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label36.c [2019-11-26 02:22:06,868 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/data/3538c950d/0a11b820f1d94703a486fd16ee3fd2eb/FLAGb74998c0d [2019-11-26 02:22:07,303 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:22:07,305 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/sv-benchmarks/c/eca-rers2012/Problem01_label36.c [2019-11-26 02:22:07,327 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/data/3538c950d/0a11b820f1d94703a486fd16ee3fd2eb/FLAGb74998c0d [2019-11-26 02:22:07,597 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/data/3538c950d/0a11b820f1d94703a486fd16ee3fd2eb [2019-11-26 02:22:07,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:22:07,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:22:07,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:22:07,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:22:07,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:22:07,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:22:07" (1/1) ... [2019-11-26 02:22:07,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227633a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:07, skipping insertion in model container [2019-11-26 02:22:07,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:22:07" (1/1) ... [2019-11-26 02:22:07,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:22:07,659 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:22:08,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:22:08,096 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:22:08,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:22:08,215 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:22:08,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08 WrapperNode [2019-11-26 02:22:08,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:22:08,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:22:08,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:22:08,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:22:08,225 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:22:08" (1/1) ... [2019-11-26 02:22:08,249 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:22:08" (1/1) ... [2019-11-26 02:22:08,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:22:08,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:22:08,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:22:08,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:22:08,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08" (1/1) ... [2019-11-26 02:22:08,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08" (1/1) ... [2019-11-26 02:22:08,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08" (1/1) ... [2019-11-26 02:22:08,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08" (1/1) ... [2019-11-26 02:22:08,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08" (1/1) ... [2019-11-26 02:22:08,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08" (1/1) ... [2019-11-26 02:22:08,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08" (1/1) ... [2019-11-26 02:22:08,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:22:08,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:22:08,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:22:08,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:22:08,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/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:22:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:22:08,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:22:10,169 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:22:10,169 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:22:10,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:22:10 BoogieIcfgContainer [2019-11-26 02:22:10,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:22:10,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:22:10,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:22:10,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:22:10,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:22:07" (1/3) ... [2019-11-26 02:22:10,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714afd82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:22:10, skipping insertion in model container [2019-11-26 02:22:10,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:22:08" (2/3) ... [2019-11-26 02:22:10,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714afd82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:22:10, skipping insertion in model container [2019-11-26 02:22:10,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:22:10" (3/3) ... [2019-11-26 02:22:10,179 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label36.c [2019-11-26 02:22:10,188 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:22:10,194 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:22:10,205 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:22:10,228 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:22:10,229 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:22:10,229 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:22:10,229 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:22:10,229 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:22:10,229 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:22:10,229 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:22:10,229 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:22:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:22:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:22:10,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:22:10,254 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:22:10,254 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:22:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:22:10,260 INFO L82 PathProgramCache]: Analyzing trace with hash -839566688, now seen corresponding path program 1 times [2019-11-26 02:22:10,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:22:10,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086244291] [2019-11-26 02:22:10,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:22:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:22:10,697 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:22:10,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086244291] [2019-11-26 02:22:10,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:22:10,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:22:10,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238580850] [2019-11-26 02:22:10,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:22:10,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:22:10,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:22:10,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:22:10,721 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:22:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:22:11,425 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:22:11,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:22:11,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:22:11,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:22:11,438 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:22:11,439 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:22:11,442 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:22:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:22:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-26 02:22:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:22:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:22:11,485 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:22:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:22:11,486 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:22:11,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:22:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:22:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-26 02:22:11,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:22:11,490 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-26 02:22:11,490 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:22:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:22:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1061927437, now seen corresponding path program 1 times [2019-11-26 02:22:11,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:22:11,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125737289] [2019-11-26 02:22:11,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:22:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:22:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:22:11,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125737289] [2019-11-26 02:22:11,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:22:11,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:22:11,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114254204] [2019-11-26 02:22:11,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:22:11,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:22:11,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:22:11,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:22:11,550 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:22:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:22:12,213 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-26 02:22:12,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:22:12,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-26 02:22:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:22:12,218 INFO L225 Difference]: With dead ends: 573 [2019-11-26 02:22:12,218 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:22:12,220 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:22:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:22:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:22:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:22:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-26 02:22:12,255 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-26 02:22:12,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:22:12,255 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-26 02:22:12,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:22:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-26 02:22:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:22:12,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:22:12,260 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:22:12,260 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:22:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:22:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1752151157, now seen corresponding path program 1 times [2019-11-26 02:22:12,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:22:12,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343078824] [2019-11-26 02:22:12,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:22:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:22:12,337 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:22:12,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343078824] [2019-11-26 02:22:12,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:22:12,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:22:12,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960752864] [2019-11-26 02:22:12,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:22:12,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:22:12,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:22:12,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:22:12,340 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 3 states. [2019-11-26 02:22:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:22:12,728 INFO L93 Difference]: Finished difference Result 1141 states and 1891 transitions. [2019-11-26 02:22:12,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:22:12,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-26 02:22:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:22:12,734 INFO L225 Difference]: With dead ends: 1141 [2019-11-26 02:22:12,735 INFO L226 Difference]: Without dead ends: 642 [2019-11-26 02:22:12,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:22:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-26 02:22:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 571. [2019-11-26 02:22:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-26 02:22:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 838 transitions. [2019-11-26 02:22:12,798 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 838 transitions. Word has length 78 [2019-11-26 02:22:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:22:12,799 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 838 transitions. [2019-11-26 02:22:12,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:22:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 838 transitions. [2019-11-26 02:22:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:22:12,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:22:12,806 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:22:12,806 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:22:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:22:12,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2038002531, now seen corresponding path program 1 times [2019-11-26 02:22:12,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:22:12,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399957953] [2019-11-26 02:22:12,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:22:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:22:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:22:12,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399957953] [2019-11-26 02:22:12,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:22:12,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:22:12,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573085891] [2019-11-26 02:22:12,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:22:12,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:22:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:22:12,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:22:12,908 INFO L87 Difference]: Start difference. First operand 571 states and 838 transitions. Second operand 3 states. [2019-11-26 02:22:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:22:13,300 INFO L93 Difference]: Finished difference Result 1496 states and 2219 transitions. [2019-11-26 02:22:13,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:22:13,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-26 02:22:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:22:13,305 INFO L225 Difference]: With dead ends: 1496 [2019-11-26 02:22:13,306 INFO L226 Difference]: Without dead ends: 855 [2019-11-26 02:22:13,307 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:22:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-26 02:22:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-11-26 02:22:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:22:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 977 transitions. [2019-11-26 02:22:13,340 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 977 transitions. Word has length 86 [2019-11-26 02:22:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:22:13,341 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 977 transitions. [2019-11-26 02:22:13,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:22:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 977 transitions. [2019-11-26 02:22:13,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-26 02:22:13,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:22:13,344 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,344 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:22:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:22:13,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1861169841, now seen corresponding path program 1 times [2019-11-26 02:22:13,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:22:13,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823777094] [2019-11-26 02:22:13,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:22:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:22:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:22:13,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823777094] [2019-11-26 02:22:13,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:22:13,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:22:13,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709426389] [2019-11-26 02:22:13,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:22:13,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:22:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:22:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:22:13,464 INFO L87 Difference]: Start difference. First operand 784 states and 977 transitions. Second operand 4 states. [2019-11-26 02:22:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:22:13,876 INFO L93 Difference]: Finished difference Result 1667 states and 2064 transitions. [2019-11-26 02:22:13,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:22:13,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-26 02:22:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:22:13,881 INFO L225 Difference]: With dead ends: 1667 [2019-11-26 02:22:13,882 INFO L226 Difference]: Without dead ends: 884 [2019-11-26 02:22:13,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:22:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-11-26 02:22:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 855. [2019-11-26 02:22:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:22:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1051 transitions. [2019-11-26 02:22:13,910 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1051 transitions. Word has length 94 [2019-11-26 02:22:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:22:13,912 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1051 transitions. [2019-11-26 02:22:13,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:22:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1051 transitions. [2019-11-26 02:22:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-26 02:22:13,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:22:13,917 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:22:13,917 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:22:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:22:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash 791588759, now seen corresponding path program 1 times [2019-11-26 02:22:13,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:22:13,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031721598] [2019-11-26 02:22:13,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:22:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:22:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:22:13,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031721598] [2019-11-26 02:22:13,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:22:13,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:22:13,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105009485] [2019-11-26 02:22:13,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:22:13,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:22:13,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:22:13,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:22:13,994 INFO L87 Difference]: Start difference. First operand 855 states and 1051 transitions. Second operand 4 states. [2019-11-26 02:22:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:22:14,417 INFO L93 Difference]: Finished difference Result 1993 states and 2503 transitions. [2019-11-26 02:22:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:22:14,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-26 02:22:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:22:14,424 INFO L225 Difference]: With dead ends: 1993 [2019-11-26 02:22:14,424 INFO L226 Difference]: Without dead ends: 1210 [2019-11-26 02:22:14,427 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:22:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-26 02:22:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 997. [2019-11-26 02:22:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:22:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1183 transitions. [2019-11-26 02:22:14,458 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1183 transitions. Word has length 98 [2019-11-26 02:22:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:22:14,462 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1183 transitions. [2019-11-26 02:22:14,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:22:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1183 transitions. [2019-11-26 02:22:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-26 02:22:14,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:22:14,466 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,466 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:22:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:22:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2122852108, now seen corresponding path program 1 times [2019-11-26 02:22:14,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:22:14,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997457909] [2019-11-26 02:22:14,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:22:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:22:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:22:14,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997457909] [2019-11-26 02:22:14,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:22:14,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:22:14,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249038776] [2019-11-26 02:22:14,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:22:14,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:22:14,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:22:14,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:22:14,679 INFO L87 Difference]: Start difference. First operand 997 states and 1183 transitions. Second operand 8 states. [2019-11-26 02:22:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:22:15,347 INFO L93 Difference]: Finished difference Result 2180 states and 2588 transitions. [2019-11-26 02:22:15,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:22:15,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-11-26 02:22:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:22:15,354 INFO L225 Difference]: With dead ends: 2180 [2019-11-26 02:22:15,354 INFO L226 Difference]: Without dead ends: 1255 [2019-11-26 02:22:15,356 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:22:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-11-26 02:22:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1068. [2019-11-26 02:22:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:22:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1255 transitions. [2019-11-26 02:22:15,386 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1255 transitions. Word has length 112 [2019-11-26 02:22:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:22:15,386 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1255 transitions. [2019-11-26 02:22:15,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:22:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1255 transitions. [2019-11-26 02:22:15,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-26 02:22:15,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:22:15,389 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:15,389 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:22:15,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:22:15,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1614100254, now seen corresponding path program 1 times [2019-11-26 02:22:15,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:22:15,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99429094] [2019-11-26 02:22:15,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:22:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:22:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:22:15,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99429094] [2019-11-26 02:22:15,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:22:15,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:22:15,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355793316] [2019-11-26 02:22:15,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:22:15,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:22:15,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:22:15,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:22:15,539 INFO L87 Difference]: Start difference. First operand 1068 states and 1255 transitions. Second operand 6 states. [2019-11-26 02:22:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:22:16,067 INFO L93 Difference]: Finished difference Result 2286 states and 2680 transitions. [2019-11-26 02:22:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:22:16,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-11-26 02:22:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:22:16,074 INFO L225 Difference]: With dead ends: 2286 [2019-11-26 02:22:16,074 INFO L226 Difference]: Without dead ends: 1290 [2019-11-26 02:22:16,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:22:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-26 02:22:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 997. [2019-11-26 02:22:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:22:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1131 transitions. [2019-11-26 02:22:16,101 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1131 transitions. Word has length 145 [2019-11-26 02:22:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:22:16,101 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1131 transitions. [2019-11-26 02:22:16,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:22:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1131 transitions. [2019-11-26 02:22:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-26 02:22:16,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:22:16,106 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:22:16,106 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:22:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:22:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash 954077146, now seen corresponding path program 1 times [2019-11-26 02:22:16,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:22:16,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400428839] [2019-11-26 02:22:16,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:22:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:22:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-26 02:22:16,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400428839] [2019-11-26 02:22:16,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:22:16,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:22:16,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817149563] [2019-11-26 02:22:16,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:22:16,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:22:16,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:22:16,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:22:16,297 INFO L87 Difference]: Start difference. First operand 997 states and 1131 transitions. Second operand 6 states. [2019-11-26 02:22:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:22:16,737 INFO L93 Difference]: Finished difference Result 2023 states and 2310 transitions. [2019-11-26 02:22:16,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:22:16,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 243 [2019-11-26 02:22:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:22:16,738 INFO L225 Difference]: With dead ends: 2023 [2019-11-26 02:22:16,738 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:22:16,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:22:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:22:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:22:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:22:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:22:16,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2019-11-26 02:22:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:22:16,741 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:22:16,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:22:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:22:16,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:22:16,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:22:16,914 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 66 [2019-11-26 02:22:17,035 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 70 [2019-11-26 02:22:17,227 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 26 [2019-11-26 02:22:17,435 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 26 [2019-11-26 02:22:17,438 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:22:17,438 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:22:17,438 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:22:17,438 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:22:17,439 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:22:17,440 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:22:17,440 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:22:17,440 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:22:17,440 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a16~0 6)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 1)) (.cse4 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse3 .cse4) (= 1 ~a7~0) (and .cse0 .cse1 .cse2 .cse4) (= ~a16~0 4) (and .cse4 (= ~a16~0 5)))) [2019-11-26 02:22:17,440 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:22:17,440 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:22:17,441 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:22:17,441 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:22:17,441 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:22:17,441 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:22:17,441 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:22:17,441 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:22:17,441 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:22:17,441 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:22:17,441 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:22:17,442 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:22:17,442 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:22:17,442 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:22:17,442 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:22:17,442 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:22:17,442 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:22:17,442 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:22:17,442 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-26 02:22:17,442 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:22:17,443 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:22:17,443 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:22:17,443 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:22:17,443 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:22:17,443 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:22:17,443 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:22:17,443 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a16~0 6)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 1)) (.cse4 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse3 .cse4) (= 1 ~a7~0) (and .cse0 .cse1 .cse2 .cse4) (= ~a16~0 4) (and .cse4 (= ~a16~0 5)))) [2019-11-26 02:22:17,443 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:22:17,443 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:22:17,443 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:22:17,444 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:22:17,445 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:22:17,446 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 482) no Hoare annotation was computed. [2019-11-26 02:22:17,446 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:22:17,446 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:22:17,446 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:22:17,446 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:22:17,446 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:22:17,446 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:22:17,446 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:22:17,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:22:17 BoogieIcfgContainer [2019-11-26 02:22:17,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:22:17,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:22:17,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:22:17,465 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:22:17,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:22:10" (3/4) ... [2019-11-26 02:22:17,468 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:22:17,503 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:22:17,506 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:22:17,508 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:22:17,509 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:22:17,669 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5f221930-ace1-4992-8e5d-95cd46c270d0/bin/utaipan/witness.graphml [2019-11-26 02:22:17,670 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:22:17,671 INFO L168 Benchmark]: Toolchain (without parser) took 10070.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 943.5 MB in the beginning and 927.1 MB in the end (delta: 16.4 MB). Peak memory consumption was 296.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:22:17,671 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 965.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:22:17,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:22:17,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:22:17,672 INFO L168 Benchmark]: Boogie Preprocessor took 52.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:22:17,672 INFO L168 Benchmark]: RCFGBuilder took 1808.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 901.3 MB in the end (delta: 206.2 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:22:17,673 INFO L168 Benchmark]: TraceAbstraction took 7292.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 896.0 MB in the beginning and 946.8 MB in the end (delta: -50.9 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:22:17,673 INFO L168 Benchmark]: Witness Printer took 205.34 ms. Allocated memory is still 1.3 GB. Free memory was 946.8 MB in the beginning and 927.1 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:22:17,676 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 965.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 614.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1808.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 901.3 MB in the end (delta: 206.2 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7292.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 896.0 MB in the beginning and 946.8 MB in the end (delta: -50.9 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. * Witness Printer took 205.34 ms. Allocated memory is still 1.3 GB. Free memory was 946.8 MB in the beginning and 927.1 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 482]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 == 6) || (a16 == 6 && !(13 == a8))) || 1 == a7) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(13 == a8))) || a16 == 4) || (!(13 == a8) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 == 6) || (a16 == 6 && !(13 == a8))) || 1 == a7) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(13 == a8))) || a16 == 4) || (!(13 == a8) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.2s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 452 SDtfs, 1296 SDslu, 81 SDs, 0 SdLazy, 3263 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 935 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 61 NumberOfFragments, 101 HoareAnnotationTreeSize, 3 FomulaSimplifications, 13795 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2233 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1004 NumberOfCodeBlocks, 1004 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 995 ConstructedInterpolants, 0 QuantifiedInterpolants, 363320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 627/627 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...