./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label02.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_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/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 addc9e4e4fc897318cfe4d26c9760729a73864e1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:49:24,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:49:24,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:49:24,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:49:24,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:49:24,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:49:24,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:49:24,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:49:24,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:49:24,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:49:24,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:49:24,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:49:24,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:49:24,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:49:24,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:49:24,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:49:24,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:49:24,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:49:24,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:49:24,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:49:24,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:49:24,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:49:24,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:49:24,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:49:24,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:49:24,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:49:24,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:49:24,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:49:24,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:49:24,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:49:24,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:49:24,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:49:24,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:49:24,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:49:24,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:49:24,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:49:24,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:49:24,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:49:24,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:49:24,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:49:24,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:49:24,369 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:49:24,381 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:49:24,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:49:24,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:49:24,382 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:49:24,382 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:49:24,382 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:49:24,383 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:49:24,383 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:49:24,383 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:49:24,383 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:49:24,383 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:49:24,383 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:49:24,384 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:49:24,384 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:49:24,384 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:49:24,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:49:24,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:49:24,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:49:24,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:49:24,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:49:24,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:49:24,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:49:24,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:49:24,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:49:24,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:49:24,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:49:24,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:49:24,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:49:24,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:49:24,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:49:24,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:49:24,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:49:24,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:49:24,388 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:49:24,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:49:24,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:49:24,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:49:24,388 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_16700a01-607c-4f92-adfb-bc8aaf0c2043/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 -> addc9e4e4fc897318cfe4d26c9760729a73864e1 [2019-11-26 02:49:24,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:49:24,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:49:24,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:49:24,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:49:24,558 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:49:24,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2019-11-26 02:49:24,613 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/data/cc2d8f3d2/ac72412881a447ceba0eb09f5369a656/FLAG208b9055f [2019-11-26 02:49:25,097 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:49:25,097 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2019-11-26 02:49:25,110 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/data/cc2d8f3d2/ac72412881a447ceba0eb09f5369a656/FLAG208b9055f [2019-11-26 02:49:25,408 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/data/cc2d8f3d2/ac72412881a447ceba0eb09f5369a656 [2019-11-26 02:49:25,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:49:25,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:49:25,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:49:25,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:49:25,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:49:25,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:49:25" (1/1) ... [2019-11-26 02:49:25,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59611e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:25, skipping insertion in model container [2019-11-26 02:49:25,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:49:25" (1/1) ... [2019-11-26 02:49:25,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:49:25,474 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:49:25,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:49:25,897 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:49:25,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:49:26,019 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:49:26,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26 WrapperNode [2019-11-26 02:49:26,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:49:26,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:49:26,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:49:26,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:49:26,028 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:49:26" (1/1) ... [2019-11-26 02:49:26,052 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:49:26" (1/1) ... [2019-11-26 02:49:26,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:49:26,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:49:26,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:49:26,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:49:26,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26" (1/1) ... [2019-11-26 02:49:26,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26" (1/1) ... [2019-11-26 02:49:26,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26" (1/1) ... [2019-11-26 02:49:26,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26" (1/1) ... [2019-11-26 02:49:26,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26" (1/1) ... [2019-11-26 02:49:26,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26" (1/1) ... [2019-11-26 02:49:26,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26" (1/1) ... [2019-11-26 02:49:26,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:49:26,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:49:26,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:49:26,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:49:26,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/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:49:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:49:26,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:49:28,182 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:49:28,183 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:49:28,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:49:28 BoogieIcfgContainer [2019-11-26 02:49:28,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:49:28,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:49:28,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:49:28,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:49:28,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:49:25" (1/3) ... [2019-11-26 02:49:28,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ade7158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:49:28, skipping insertion in model container [2019-11-26 02:49:28,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:26" (2/3) ... [2019-11-26 02:49:28,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ade7158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:49:28, skipping insertion in model container [2019-11-26 02:49:28,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:49:28" (3/3) ... [2019-11-26 02:49:28,194 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label02.c [2019-11-26 02:49:28,203 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:49:28,209 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:49:28,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:49:28,237 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:49:28,237 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:49:28,237 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:49:28,237 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:49:28,237 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:49:28,237 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:49:28,238 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:49:28,238 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:49:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:49:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:49:28,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:28,259 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:49:28,260 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1323245087, now seen corresponding path program 1 times [2019-11-26 02:49:28,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:28,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543467176] [2019-11-26 02:49:28,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:28,705 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:49:28,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543467176] [2019-11-26 02:49:28,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:28,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:49:28,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797339463] [2019-11-26 02:49:28,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:49:28,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:49:28,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:49:28,729 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:49:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:29,518 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:49:29,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:49:29,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:49:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:29,530 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:49:29,531 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:49:29,534 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:49:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:49:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-26 02:49:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:49:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:49:29,585 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:49:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:29,586 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:49:29,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:49:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:49:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-26 02:49:29,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:29,590 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:49:29,590 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:29,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:29,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1048397708, now seen corresponding path program 1 times [2019-11-26 02:49:29,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:29,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133300298] [2019-11-26 02:49:29,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:29,644 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:49:29,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133300298] [2019-11-26 02:49:29,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:29,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:49:29,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596727072] [2019-11-26 02:49:29,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:49:29,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:29,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:49:29,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:49:29,647 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:49:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:30,233 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-26 02:49:30,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:49:30,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-26 02:49:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:30,239 INFO L225 Difference]: With dead ends: 573 [2019-11-26 02:49:30,239 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:49:30,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:49:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:49:30,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:49:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:49:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-11-26 02:49:30,288 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 77 [2019-11-26 02:49:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:30,289 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-11-26 02:49:30,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:49:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-11-26 02:49:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:49:30,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:30,293 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:49:30,293 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2123302380, now seen corresponding path program 1 times [2019-11-26 02:49:30,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:30,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978210032] [2019-11-26 02:49:30,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:49:30,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978210032] [2019-11-26 02:49:30,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:30,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:49:30,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779686742] [2019-11-26 02:49:30,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:49:30,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:30,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:49:30,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:49:30,424 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 3 states. [2019-11-26 02:49:30,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:30,826 INFO L93 Difference]: Finished difference Result 1212 states and 2008 transitions. [2019-11-26 02:49:30,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:49:30,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-26 02:49:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:30,835 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:49:30,835 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:49:30,838 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:49:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:49:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-11-26 02:49:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:49:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1217 transitions. [2019-11-26 02:49:30,875 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1217 transitions. Word has length 78 [2019-11-26 02:49:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:30,876 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1217 transitions. [2019-11-26 02:49:30,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:49:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1217 transitions. [2019-11-26 02:49:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-26 02:49:30,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:30,881 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:30,882 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash 928579939, now seen corresponding path program 1 times [2019-11-26 02:49:30,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:30,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055976998] [2019-11-26 02:49:30,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:49:30,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055976998] [2019-11-26 02:49:30,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:30,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:49:30,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846085154] [2019-11-26 02:49:30,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:49:30,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:30,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:49:30,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:49:30,940 INFO L87 Difference]: Start difference. First operand 784 states and 1217 transitions. Second operand 3 states. [2019-11-26 02:49:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:31,299 INFO L93 Difference]: Finished difference Result 1709 states and 2678 transitions. [2019-11-26 02:49:31,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:49:31,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-26 02:49:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:31,307 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:49:31,307 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:49:31,313 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:49:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:49:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-11-26 02:49:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:49:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1212 transitions. [2019-11-26 02:49:31,346 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1212 transitions. Word has length 97 [2019-11-26 02:49:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:31,346 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1212 transitions. [2019-11-26 02:49:31,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:49:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1212 transitions. [2019-11-26 02:49:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-26 02:49:31,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:31,351 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-26 02:49:31,351 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1622554321, now seen corresponding path program 1 times [2019-11-26 02:49:31,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:31,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935729838] [2019-11-26 02:49:31,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:49:31,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935729838] [2019-11-26 02:49:31,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:31,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:49:31,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678975395] [2019-11-26 02:49:31,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:49:31,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:31,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:49:31,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:49:31,443 INFO L87 Difference]: Start difference. First operand 784 states and 1212 transitions. Second operand 3 states. [2019-11-26 02:49:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:31,802 INFO L93 Difference]: Finished difference Result 2064 states and 3149 transitions. [2019-11-26 02:49:31,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:49:31,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-26 02:49:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:31,810 INFO L225 Difference]: With dead ends: 2064 [2019-11-26 02:49:31,810 INFO L226 Difference]: Without dead ends: 1281 [2019-11-26 02:49:31,812 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:49:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-26 02:49:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 997. [2019-11-26 02:49:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:49:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1474 transitions. [2019-11-26 02:49:31,847 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1474 transitions. Word has length 114 [2019-11-26 02:49:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:31,848 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1474 transitions. [2019-11-26 02:49:31,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:49:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1474 transitions. [2019-11-26 02:49:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-26 02:49:31,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:31,851 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:49:31,851 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1943801690, now seen corresponding path program 1 times [2019-11-26 02:49:31,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:31,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293289049] [2019-11-26 02:49:31,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-26 02:49:31,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293289049] [2019-11-26 02:49:31,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:31,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:49:31,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470143395] [2019-11-26 02:49:31,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:49:31,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:31,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:49:31,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:49:31,928 INFO L87 Difference]: Start difference. First operand 997 states and 1474 transitions. Second operand 3 states. [2019-11-26 02:49:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:32,242 INFO L93 Difference]: Finished difference Result 2135 states and 3143 transitions. [2019-11-26 02:49:32,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:49:32,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-26 02:49:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:32,250 INFO L225 Difference]: With dead ends: 2135 [2019-11-26 02:49:32,250 INFO L226 Difference]: Without dead ends: 1139 [2019-11-26 02:49:32,252 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:49:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-26 02:49:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2019-11-26 02:49:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-26 02:49:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1634 transitions. [2019-11-26 02:49:32,284 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1634 transitions. Word has length 136 [2019-11-26 02:49:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:32,285 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1634 transitions. [2019-11-26 02:49:32,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:49:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1634 transitions. [2019-11-26 02:49:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-26 02:49:32,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:32,289 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:49:32,289 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:32,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1538199586, now seen corresponding path program 1 times [2019-11-26 02:49:32,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:32,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319661121] [2019-11-26 02:49:32,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-26 02:49:32,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319661121] [2019-11-26 02:49:32,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:32,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:49:32,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896029471] [2019-11-26 02:49:32,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:49:32,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:32,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:49:32,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:49:32,575 INFO L87 Difference]: Start difference. First operand 1139 states and 1634 transitions. Second operand 8 states. [2019-11-26 02:49:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:33,313 INFO L93 Difference]: Finished difference Result 2390 states and 3386 transitions. [2019-11-26 02:49:33,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:49:33,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 140 [2019-11-26 02:49:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:33,321 INFO L225 Difference]: With dead ends: 2390 [2019-11-26 02:49:33,322 INFO L226 Difference]: Without dead ends: 1252 [2019-11-26 02:49:33,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:49:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-11-26 02:49:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1139. [2019-11-26 02:49:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-26 02:49:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1622 transitions. [2019-11-26 02:49:33,359 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1622 transitions. Word has length 140 [2019-11-26 02:49:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:33,360 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1622 transitions. [2019-11-26 02:49:33,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:49:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1622 transitions. [2019-11-26 02:49:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-26 02:49:33,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:33,364 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:49:33,365 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash 756476978, now seen corresponding path program 1 times [2019-11-26 02:49:33,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:33,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556682640] [2019-11-26 02:49:33,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-26 02:49:33,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556682640] [2019-11-26 02:49:33,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:33,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:49:33,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328850330] [2019-11-26 02:49:33,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:49:33,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:33,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:49:33,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:49:33,540 INFO L87 Difference]: Start difference. First operand 1139 states and 1622 transitions. Second operand 4 states. [2019-11-26 02:49:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:34,113 INFO L93 Difference]: Finished difference Result 2350 states and 3333 transitions. [2019-11-26 02:49:34,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:49:34,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-26 02:49:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:34,120 INFO L225 Difference]: With dead ends: 2350 [2019-11-26 02:49:34,120 INFO L226 Difference]: Without dead ends: 1212 [2019-11-26 02:49:34,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:49:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-11-26 02:49:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1210. [2019-11-26 02:49:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-11-26 02:49:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1585 transitions. [2019-11-26 02:49:34,179 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1585 transitions. Word has length 173 [2019-11-26 02:49:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:34,179 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1585 transitions. [2019-11-26 02:49:34,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:49:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1585 transitions. [2019-11-26 02:49:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-26 02:49:34,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:34,183 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 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] [2019-11-26 02:49:34,183 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:34,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1219958691, now seen corresponding path program 1 times [2019-11-26 02:49:34,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:34,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751127620] [2019-11-26 02:49:34,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-26 02:49:34,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751127620] [2019-11-26 02:49:34,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:34,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:49:34,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422297315] [2019-11-26 02:49:34,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:49:34,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:49:34,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:49:34,366 INFO L87 Difference]: Start difference. First operand 1210 states and 1585 transitions. Second operand 3 states. [2019-11-26 02:49:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:34,671 INFO L93 Difference]: Finished difference Result 1496 states and 1924 transitions. [2019-11-26 02:49:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:49:34,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-26 02:49:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:34,680 INFO L225 Difference]: With dead ends: 1496 [2019-11-26 02:49:34,680 INFO L226 Difference]: Without dead ends: 1494 [2019-11-26 02:49:34,682 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:49:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-26 02:49:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1068. [2019-11-26 02:49:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:49:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1423 transitions. [2019-11-26 02:49:34,711 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1423 transitions. Word has length 175 [2019-11-26 02:49:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:34,712 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1423 transitions. [2019-11-26 02:49:34,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:49:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1423 transitions. [2019-11-26 02:49:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-26 02:49:34,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:34,717 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-26 02:49:34,717 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:34,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:34,718 INFO L82 PathProgramCache]: Analyzing trace with hash 546834224, now seen corresponding path program 1 times [2019-11-26 02:49:34,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:34,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145137564] [2019-11-26 02:49:34,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-26 02:49:34,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145137564] [2019-11-26 02:49:34,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:34,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:49:34,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205752033] [2019-11-26 02:49:34,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:49:34,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:34,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:49:34,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:49:34,840 INFO L87 Difference]: Start difference. First operand 1068 states and 1423 transitions. Second operand 4 states. [2019-11-26 02:49:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:35,330 INFO L93 Difference]: Finished difference Result 2419 states and 3183 transitions. [2019-11-26 02:49:35,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:49:35,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-26 02:49:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:35,340 INFO L225 Difference]: With dead ends: 2419 [2019-11-26 02:49:35,340 INFO L226 Difference]: Without dead ends: 1352 [2019-11-26 02:49:35,342 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:49:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-26 02:49:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-11-26 02:49:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:49:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1411 transitions. [2019-11-26 02:49:35,370 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1411 transitions. Word has length 179 [2019-11-26 02:49:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:35,370 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1411 transitions. [2019-11-26 02:49:35,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:49:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1411 transitions. [2019-11-26 02:49:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-26 02:49:35,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:35,376 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:35,377 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash 500058821, now seen corresponding path program 1 times [2019-11-26 02:49:35,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:35,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084966743] [2019-11-26 02:49:35,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-26 02:49:35,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084966743] [2019-11-26 02:49:35,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:35,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:49:35,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962911052] [2019-11-26 02:49:35,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:49:35,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:49:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:49:35,573 INFO L87 Difference]: Start difference. First operand 1068 states and 1411 transitions. Second operand 6 states. [2019-11-26 02:49:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:36,208 INFO L93 Difference]: Finished difference Result 2244 states and 2936 transitions. [2019-11-26 02:49:36,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:49:36,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 200 [2019-11-26 02:49:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:36,214 INFO L225 Difference]: With dead ends: 2244 [2019-11-26 02:49:36,214 INFO L226 Difference]: Without dead ends: 1177 [2019-11-26 02:49:36,216 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:49:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-11-26 02:49:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 997. [2019-11-26 02:49:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:49:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1261 transitions. [2019-11-26 02:49:36,241 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1261 transitions. Word has length 200 [2019-11-26 02:49:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:36,241 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1261 transitions. [2019-11-26 02:49:36,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:49:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1261 transitions. [2019-11-26 02:49:36,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-26 02:49:36,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:36,246 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:36,246 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:49:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:36,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1066084274, now seen corresponding path program 1 times [2019-11-26 02:49:36,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:49:36,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022918690] [2019-11-26 02:49:36,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:49:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-11-26 02:49:36,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022918690] [2019-11-26 02:49:36,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:36,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:49:36,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721048192] [2019-11-26 02:49:36,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:49:36,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:49:36,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:49:36,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:49:36,391 INFO L87 Difference]: Start difference. First operand 997 states and 1261 transitions. Second operand 3 states. [2019-11-26 02:49:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:36,747 INFO L93 Difference]: Finished difference Result 1991 states and 2520 transitions. [2019-11-26 02:49:36,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:49:36,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-11-26 02:49:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:36,748 INFO L225 Difference]: With dead ends: 1991 [2019-11-26 02:49:36,749 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:49:36,751 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:49:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:49:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:49:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:49:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:49:36,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 222 [2019-11-26 02:49:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:36,752 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:49:36,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:49:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:49:36,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:49:36,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:49:36,869 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 90 [2019-11-26 02:49:36,973 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 91 [2019-11-26 02:49:37,376 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2019-11-26 02:49:37,727 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2019-11-26 02:49:37,730 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:49:37,730 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:49:37,730 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:49:37,730 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:49:37,730 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:49:37,730 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:49:37,731 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:49:37,732 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a21~0 1))) (let ((.cse4 (<= ~a17~0 0)) (.cse1 (= ~a16~0 6)) (.cse3 (= ~a16~0 4)) (.cse0 (not (= 1 ~a7~0))) (.cse5 (not .cse7)) (.cse6 (= ~a17~0 1)) (.cse2 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse5 .cse1) (and .cse0 .cse6) (and .cse6 (= ~a20~0 1)) (and .cse3 .cse0 .cse7) (and .cse5 .cse6) (and .cse7 .cse2 (= ~a16~0 5))))) [2019-11-26 02:49:37,732 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:49:37,732 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:49:37,732 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:49:37,732 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:49:37,732 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:49:37,732 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:49:37,732 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:49:37,733 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:49:37,733 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:49:37,737 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:49:37,738 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:49:37,738 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:49:37,738 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:49:37,738 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:49:37,738 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-26 02:49:37,738 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:49:37,738 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:49:37,739 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:49:37,739 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:49:37,739 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:49:37,739 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:49:37,739 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:49:37,739 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:49:37,739 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:49:37,740 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:49:37,740 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:49:37,740 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a21~0 1))) (let ((.cse4 (<= ~a17~0 0)) (.cse1 (= ~a16~0 6)) (.cse3 (= ~a16~0 4)) (.cse0 (not (= 1 ~a7~0))) (.cse5 (not .cse7)) (.cse6 (= ~a17~0 1)) (.cse2 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse5 .cse1) (and .cse0 .cse6) (and .cse6 (= ~a20~0 1)) (and .cse3 .cse0 .cse7) (and .cse5 .cse6) (and .cse7 .cse2 (= ~a16~0 5))))) [2019-11-26 02:49:37,741 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:49:37,741 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:49:37,741 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:49:37,741 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:49:37,741 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:49:37,742 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:49:37,742 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:49:37,742 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:49:37,742 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:49:37,742 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:49:37,743 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:49:37,743 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:49:37,743 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:49:37,743 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:49:37,743 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:49:37,743 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:49:37,743 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:49:37,744 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:49:37,744 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:49:37,744 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:49:37,744 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:49:37,744 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:49:37,744 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:49:37,744 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 446) no Hoare annotation was computed. [2019-11-26 02:49:37,745 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:49:37,745 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:49:37,745 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:49:37,745 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:49:37,745 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:49:37,745 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:49:37,745 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:49:37,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:49:37 BoogieIcfgContainer [2019-11-26 02:49:37,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:49:37,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:49:37,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:49:37,790 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:49:37,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:49:28" (3/4) ... [2019-11-26 02:49:37,793 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:49:37,822 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:49:37,831 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:49:37,832 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:49:37,990 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_16700a01-607c-4f92-adfb-bc8aaf0c2043/bin/utaipan/witness.graphml [2019-11-26 02:49:37,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:49:37,991 INFO L168 Benchmark]: Toolchain (without parser) took 12580.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.4 MB). Free memory was 944.8 MB in the beginning and 871.5 MB in the end (delta: 73.3 MB). Peak memory consumption was 362.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:49:37,992 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:49:37,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:49:37,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.45 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:49:37,993 INFO L168 Benchmark]: Boogie Preprocessor took 74.84 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:49:37,993 INFO L168 Benchmark]: RCFGBuilder took 1992.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 888.6 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:49:37,994 INFO L168 Benchmark]: TraceAbstraction took 9602.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 888.6 MB in the beginning and 892.5 MB in the end (delta: -3.9 MB). Peak memory consumption was 150.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:49:37,994 INFO L168 Benchmark]: Witness Printer took 201.14 ms. Allocated memory is still 1.3 GB. Free memory was 892.5 MB in the beginning and 871.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:49:37,996 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 606.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.45 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 74.84 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 1992.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 888.6 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9602.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 888.6 MB in the beginning and 892.5 MB in the end (delta: -3.9 MB). Peak memory consumption was 150.7 MB. Max. memory is 11.5 GB. * Witness Printer took 201.14 ms. Allocated memory is still 1.3 GB. Free memory was 892.5 MB in the beginning and 871.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 446]: 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: (((((((((!(1 == a7) && a16 == 6) && !(13 == a8)) || ((a16 == 4 && a17 <= 0) && !(13 == a8))) || ((!(a21 == 1) && a16 == 4) && a17 <= 0)) || (!(a21 == 1) && a16 == 6)) || (!(1 == a7) && a17 == 1)) || (a17 == 1 && a20 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1)) || (!(a21 == 1) && a17 == 1)) || ((a21 == 1 && !(13 == a8)) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((!(1 == a7) && a16 == 6) && !(13 == a8)) || ((a16 == 4 && a17 <= 0) && !(13 == a8))) || ((!(a21 == 1) && a16 == 4) && a17 <= 0)) || (!(a21 == 1) && a16 == 6)) || (!(1 == a7) && a17 == 1)) || (a17 == 1 && a20 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1)) || (!(a21 == 1) && a17 == 1)) || ((a21 == 1 && !(13 == a8)) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 9.5s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 678 SDtfs, 1239 SDslu, 99 SDs, 0 SdLazy, 3911 SolverSat, 947 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1210occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1502 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 177 HoareAnnotationTreeSize, 3 FomulaSimplifications, 16259 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3467 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1662 NumberOfCodeBlocks, 1662 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1650 ConstructedInterpolants, 0 QuantifiedInterpolants, 634158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1518/1518 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...