./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label03.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_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label03.c -s /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/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 79d76b935496dc6a959c1e4984dc143bd47f9882 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:47:27,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:47:27,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:47:27,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:47:27,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:47:27,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:47:27,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:47:27,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:47:27,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:47:27,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:47:27,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:47:27,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:47:27,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:47:27,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:47:27,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:47:27,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:47:27,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:47:27,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:47:27,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:47:27,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:47:27,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:47:27,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:47:27,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:47:27,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:47:27,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:47:27,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:47:27,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:47:27,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:47:27,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:47:27,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:47:27,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:47:27,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:47:27,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:47:27,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:47:27,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:47:27,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:47:27,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:47:27,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:47:27,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:47:27,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:47:27,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:47:27,214 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:47:27,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:47:27,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:47:27,239 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:47:27,239 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:47:27,239 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:47:27,239 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:47:27,240 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:47:27,240 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:47:27,240 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:47:27,240 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:47:27,240 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:47:27,240 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:47:27,241 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:47:27,241 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:47:27,241 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:47:27,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:47:27,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:47:27,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:47:27,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:47:27,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:47:27,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:47:27,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:47:27,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:47:27,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:47:27,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:47:27,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:47:27,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:47:27,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:47:27,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:47:27,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:47:27,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:47:27,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:47:27,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:47:27,245 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:47:27,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:47:27,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:47:27,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:47:27,255 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_05697afd-cce3-4827-b29d-2ee329a36459/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 -> 79d76b935496dc6a959c1e4984dc143bd47f9882 [2019-11-26 02:47:27,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:47:27,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:47:27,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:47:27,443 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:47:27,444 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:47:27,444 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label03.c [2019-11-26 02:47:27,503 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/data/6f071f5e2/3f3891247894462e9cf5390b7f3a77bd/FLAGb6dc4fe32 [2019-11-26 02:47:28,020 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:47:28,020 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/sv-benchmarks/c/eca-rers2012/Problem02_label03.c [2019-11-26 02:47:28,035 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/data/6f071f5e2/3f3891247894462e9cf5390b7f3a77bd/FLAGb6dc4fe32 [2019-11-26 02:47:28,310 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/data/6f071f5e2/3f3891247894462e9cf5390b7f3a77bd [2019-11-26 02:47:28,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:47:28,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:47:28,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:47:28,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:47:28,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:47:28,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:47:28" (1/1) ... [2019-11-26 02:47:28,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613b6a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28, skipping insertion in model container [2019-11-26 02:47:28,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:47:28" (1/1) ... [2019-11-26 02:47:28,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:47:28,393 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:47:28,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:47:28,806 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:47:28,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:47:28,913 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:47:28,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28 WrapperNode [2019-11-26 02:47:28,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:47:28,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:47:28,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:47:28,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:47:28,923 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:47:28" (1/1) ... [2019-11-26 02:47:28,941 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:47:28" (1/1) ... [2019-11-26 02:47:29,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:47:29,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:47:29,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:47:29,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:47:29,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28" (1/1) ... [2019-11-26 02:47:29,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28" (1/1) ... [2019-11-26 02:47:29,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28" (1/1) ... [2019-11-26 02:47:29,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28" (1/1) ... [2019-11-26 02:47:29,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28" (1/1) ... [2019-11-26 02:47:29,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28" (1/1) ... [2019-11-26 02:47:29,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28" (1/1) ... [2019-11-26 02:47:29,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:47:29,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:47:29,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:47:29,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:47:29,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/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:47:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:47:29,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:47:31,411 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:47:31,411 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:47:31,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:47:31 BoogieIcfgContainer [2019-11-26 02:47:31,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:47:31,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:47:31,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:47:31,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:47:31,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:47:28" (1/3) ... [2019-11-26 02:47:31,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbf9d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:47:31, skipping insertion in model container [2019-11-26 02:47:31,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:47:28" (2/3) ... [2019-11-26 02:47:31,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbf9d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:47:31, skipping insertion in model container [2019-11-26 02:47:31,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:47:31" (3/3) ... [2019-11-26 02:47:31,424 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label03.c [2019-11-26 02:47:31,432 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:47:31,438 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:47:31,448 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:47:31,478 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:47:31,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:47:31,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:47:31,478 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:47:31,478 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:47:31,478 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:47:31,478 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:47:31,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:47:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-26 02:47:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:47:31,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:31,506 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:31,507 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:47:31,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:31,512 INFO L82 PathProgramCache]: Analyzing trace with hash 925960719, now seen corresponding path program 1 times [2019-11-26 02:47:31,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:47:31,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638269022] [2019-11-26 02:47:31,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:47:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:31,882 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:47:31,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638269022] [2019-11-26 02:47:31,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:31,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:47:31,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65580285] [2019-11-26 02:47:31,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:47:31,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:47:31,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:47:31,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:47:31,904 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-26 02:47:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:32,771 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-26 02:47:32,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:47:32,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:47:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:32,786 INFO L225 Difference]: With dead ends: 333 [2019-11-26 02:47:32,786 INFO L226 Difference]: Without dead ends: 243 [2019-11-26 02:47:32,789 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:47:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-26 02:47:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-26 02:47:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-26 02:47:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 393 transitions. [2019-11-26 02:47:32,864 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 393 transitions. Word has length 80 [2019-11-26 02:47:32,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:32,865 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 393 transitions. [2019-11-26 02:47:32,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:47:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 393 transitions. [2019-11-26 02:47:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-26 02:47:32,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:32,876 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:32,876 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:47:32,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2137931357, now seen corresponding path program 1 times [2019-11-26 02:47:32,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:47:32,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598391413] [2019-11-26 02:47:32,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:47:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:32,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598391413] [2019-11-26 02:47:32,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:32,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:47:32,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198206422] [2019-11-26 02:47:32,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:47:32,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:47:32,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:47:32,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:47:32,974 INFO L87 Difference]: Start difference. First operand 243 states and 393 transitions. Second operand 3 states. [2019-11-26 02:47:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:33,391 INFO L93 Difference]: Finished difference Result 565 states and 925 transitions. [2019-11-26 02:47:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:47:33,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-26 02:47:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:33,393 INFO L225 Difference]: With dead ends: 565 [2019-11-26 02:47:33,394 INFO L226 Difference]: Without dead ends: 323 [2019-11-26 02:47:33,396 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:47:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-26 02:47:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-11-26 02:47:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-26 02:47:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 488 transitions. [2019-11-26 02:47:33,426 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 488 transitions. Word has length 89 [2019-11-26 02:47:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:33,428 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 488 transitions. [2019-11-26 02:47:33,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:47:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 488 transitions. [2019-11-26 02:47:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-26 02:47:33,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:33,433 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:47:33,433 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:47:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:33,434 INFO L82 PathProgramCache]: Analyzing trace with hash 606394791, now seen corresponding path program 1 times [2019-11-26 02:47:33,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:47:33,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567777710] [2019-11-26 02:47:33,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:47:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:33,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567777710] [2019-11-26 02:47:33,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:33,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:47:33,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425390953] [2019-11-26 02:47:33,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:47:33,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:47:33,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:47:33,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:47:33,515 INFO L87 Difference]: Start difference. First operand 323 states and 488 transitions. Second operand 3 states. [2019-11-26 02:47:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:33,917 INFO L93 Difference]: Finished difference Result 725 states and 1115 transitions. [2019-11-26 02:47:33,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:47:33,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-26 02:47:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:33,920 INFO L225 Difference]: With dead ends: 725 [2019-11-26 02:47:33,920 INFO L226 Difference]: Without dead ends: 403 [2019-11-26 02:47:33,923 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:47:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-11-26 02:47:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2019-11-26 02:47:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-26 02:47:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 578 transitions. [2019-11-26 02:47:33,943 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 578 transitions. Word has length 93 [2019-11-26 02:47:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:33,944 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 578 transitions. [2019-11-26 02:47:33,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:47:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 578 transitions. [2019-11-26 02:47:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-26 02:47:33,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:33,946 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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:47:33,946 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:47:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash -275155947, now seen corresponding path program 1 times [2019-11-26 02:47:33,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:47:33,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463028074] [2019-11-26 02:47:33,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:47:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:47:34,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463028074] [2019-11-26 02:47:34,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:34,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:47:34,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484665734] [2019-11-26 02:47:34,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:47:34,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:47:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:47:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:47:34,027 INFO L87 Difference]: Start difference. First operand 403 states and 578 transitions. Second operand 3 states. [2019-11-26 02:47:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:34,404 INFO L93 Difference]: Finished difference Result 1125 states and 1641 transitions. [2019-11-26 02:47:34,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:47:34,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-26 02:47:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:34,409 INFO L225 Difference]: With dead ends: 1125 [2019-11-26 02:47:34,409 INFO L226 Difference]: Without dead ends: 723 [2019-11-26 02:47:34,410 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:47:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-26 02:47:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-11-26 02:47:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-26 02:47:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1004 transitions. [2019-11-26 02:47:34,439 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1004 transitions. Word has length 99 [2019-11-26 02:47:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:34,440 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1004 transitions. [2019-11-26 02:47:34,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:47:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1004 transitions. [2019-11-26 02:47:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-26 02:47:34,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:34,442 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, 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:47:34,442 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:47:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash 40634828, now seen corresponding path program 1 times [2019-11-26 02:47:34,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:47:34,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405917519] [2019-11-26 02:47:34,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:47:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:47:34,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405917519] [2019-11-26 02:47:34,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:34,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:47:34,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884668235] [2019-11-26 02:47:34,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:47:34,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:47:34,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:47:34,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:47:34,548 INFO L87 Difference]: Start difference. First operand 723 states and 1004 transitions. Second operand 3 states. [2019-11-26 02:47:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:35,008 INFO L93 Difference]: Finished difference Result 2005 states and 2784 transitions. [2019-11-26 02:47:35,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:47:35,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-26 02:47:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:35,015 INFO L225 Difference]: With dead ends: 2005 [2019-11-26 02:47:35,015 INFO L226 Difference]: Without dead ends: 1283 [2019-11-26 02:47:35,016 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:47:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-26 02:47:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1123. [2019-11-26 02:47:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-26 02:47:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1534 transitions. [2019-11-26 02:47:35,046 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1534 transitions. Word has length 110 [2019-11-26 02:47:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:35,047 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1534 transitions. [2019-11-26 02:47:35,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:47:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1534 transitions. [2019-11-26 02:47:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-26 02:47:35,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:35,050 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, 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:47:35,050 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:47:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash -279230399, now seen corresponding path program 1 times [2019-11-26 02:47:35,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:47:35,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618480667] [2019-11-26 02:47:35,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:47:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:47:35,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618480667] [2019-11-26 02:47:35,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:35,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:47:35,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667420101] [2019-11-26 02:47:35,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:47:35,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:47:35,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:47:35,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:47:35,180 INFO L87 Difference]: Start difference. First operand 1123 states and 1534 transitions. Second operand 4 states. [2019-11-26 02:47:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:35,785 INFO L93 Difference]: Finished difference Result 2885 states and 3953 transitions. [2019-11-26 02:47:35,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:47:35,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-26 02:47:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:35,798 INFO L225 Difference]: With dead ends: 2885 [2019-11-26 02:47:35,799 INFO L226 Difference]: Without dead ends: 1763 [2019-11-26 02:47:35,801 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:47:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-11-26 02:47:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 963. [2019-11-26 02:47:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-26 02:47:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1308 transitions. [2019-11-26 02:47:35,834 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1308 transitions. Word has length 114 [2019-11-26 02:47:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:35,838 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1308 transitions. [2019-11-26 02:47:35,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:47:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1308 transitions. [2019-11-26 02:47:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-26 02:47:35,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:47:35,845 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, 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, 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] [2019-11-26 02:47:35,845 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:47:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:47:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1296450620, now seen corresponding path program 1 times [2019-11-26 02:47:35,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:47:35,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658845281] [2019-11-26 02:47:35,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:47:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:47:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-26 02:47:36,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658845281] [2019-11-26 02:47:36,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:47:36,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:47:36,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409396931] [2019-11-26 02:47:36,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:47:36,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:47:36,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:47:36,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:47:36,047 INFO L87 Difference]: Start difference. First operand 963 states and 1308 transitions. Second operand 4 states. [2019-11-26 02:47:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:47:36,631 INFO L93 Difference]: Finished difference Result 2163 states and 2934 transitions. [2019-11-26 02:47:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:47:36,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-26 02:47:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:47:36,633 INFO L225 Difference]: With dead ends: 2163 [2019-11-26 02:47:36,633 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:47:36,635 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:47:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:47:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:47:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:47:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:47:36,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2019-11-26 02:47:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:47:36,636 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:47:36,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:47:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:47:36,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:47:36,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:47:36,875 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-26 02:47:36,876 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-26 02:47:36,877 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-26 02:47:36,878 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-26 02:47:36,878 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-26 02:47:36,878 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-26 02:47:36,878 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-26 02:47:36,878 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:47:36,878 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-26 02:47:36,878 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-26 02:47:36,878 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-26 02:47:36,878 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-26 02:47:36,879 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-26 02:47:36,879 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-26 02:47:36,879 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-26 02:47:36,879 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-26 02:47:36,879 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-26 02:47:36,879 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-26 02:47:36,879 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 559) no Hoare annotation was computed. [2019-11-26 02:47:36,879 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-26 02:47:36,879 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-26 02:47:36,880 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-26 02:47:36,880 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-26 02:47:36,880 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a28~0 7)) (.cse2 (= ~a17~0 8)) (.cse0 (= ~a19~0 1)) (.cse3 (not (= ~a11~0 1))) (.cse4 (not (= ~a28~0 9)))) (or (and .cse0 .cse1) (<= ~a19~0 0) (and .cse2 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse0) (and (<= 10 ~a28~0) (not (= ~a25~0 1)) .cse0) (and .cse0 .cse3 .cse4))) [2019-11-26 02:47:36,880 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-26 02:47:36,880 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-26 02:47:36,880 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-26 02:47:36,880 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-26 02:47:36,881 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-26 02:47:36,881 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-26 02:47:36,881 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-26 02:47:36,881 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-26 02:47:36,881 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-26 02:47:36,881 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-26 02:47:36,881 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a28~0 7)) (.cse2 (= ~a17~0 8)) (.cse0 (= ~a19~0 1)) (.cse3 (not (= ~a11~0 1))) (.cse4 (not (= ~a28~0 9)))) (or (and .cse0 .cse1) (<= ~a19~0 0) (and .cse2 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse0) (and (<= 10 ~a28~0) (not (= ~a25~0 1)) .cse0) (and .cse0 .cse3 .cse4))) [2019-11-26 02:47:36,881 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-26 02:47:36,882 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-26 02:47:36,883 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-26 02:47:36,884 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-26 02:47:36,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:47:36 BoogieIcfgContainer [2019-11-26 02:47:36,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:47:36,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:47:36,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:47:36,901 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:47:36,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:47:31" (3/4) ... [2019-11-26 02:47:36,905 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:47:36,924 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-11-26 02:47:36,926 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:47:36,927 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:47:36,929 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:47:37,074 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_05697afd-cce3-4827-b29d-2ee329a36459/bin/utaipan/witness.graphml [2019-11-26 02:47:37,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:47:37,076 INFO L168 Benchmark]: Toolchain (without parser) took 8761.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 946.1 MB in the beginning and 906.3 MB in the end (delta: 39.8 MB). Peak memory consumption was 346.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:37,076 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:47:37,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:37,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.50 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:37,078 INFO L168 Benchmark]: Boogie Preprocessor took 89.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:37,078 INFO L168 Benchmark]: RCFGBuilder took 2322.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.8 MB in the end (delta: 227.8 MB). Peak memory consumption was 227.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:37,078 INFO L168 Benchmark]: TraceAbstraction took 5484.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 855.8 MB in the beginning and 928.7 MB in the end (delta: -72.8 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:37,079 INFO L168 Benchmark]: Witness Printer took 173.41 ms. Allocated memory is still 1.3 GB. Free memory was 928.7 MB in the beginning and 906.3 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:47:37,081 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 596.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.50 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2322.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.8 MB in the end (delta: 227.8 MB). Peak memory consumption was 227.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5484.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 855.8 MB in the beginning and 928.7 MB in the end (delta: -72.8 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. * Witness Printer took 173.41 ms. Allocated memory is still 1.3 GB. Free memory was 928.7 MB in the beginning and 906.3 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 559]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((a19 == 1 && a28 == 7) || a19 <= 0) || (a17 == 8 && a28 == 7)) || ((a17 == 8 && !(a11 == 1)) && !(a28 == 9))) || (a17 == 8 && a19 == 1)) || ((10 <= a28 && !(a25 == 1)) && a19 == 1)) || ((a19 == 1 && !(a11 == 1)) && !(a28 == 9)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((a19 == 1 && a28 == 7) || a19 <= 0) || (a17 == 8 && a28 == 7)) || ((a17 == 8 && !(a11 == 1)) && !(a28 == 9))) || (a17 == 8 && a19 == 1)) || ((10 <= a28 && !(a25 == 1)) && a19 == 1)) || ((a19 == 1 && !(a11 == 1)) && !(a28 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 5.4s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 546 SDtfs, 777 SDslu, 47 SDs, 0 SdLazy, 2168 SolverSat, 620 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1123occurred in iteration=5, 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, 7 MinimizatonAttempts, 960 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 121 HoareAnnotationTreeSize, 3 FomulaSimplifications, 668 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 756 ConstructedInterpolants, 0 QuantifiedInterpolants, 200350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 238/238 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...