./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/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 14ae8eb2d33b1f0bf446cd99369ade126e9422a8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:21:37,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:21:37,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:21:37,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:21:37,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:21:37,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:21:37,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:21:37,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:21:37,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:21:37,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:21:37,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:21:37,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:21:37,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:21:37,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:21:37,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:21:37,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:21:37,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:21:37,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:21:37,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:21:37,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:21:37,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:21:37,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:21:37,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:21:37,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:21:37,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:21:37,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:21:37,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:21:37,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:21:37,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:21:37,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:21:37,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:21:37,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:21:37,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:21:37,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:21:37,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:21:37,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:21:37,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:21:37,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:21:37,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:21:37,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:21:37,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:21:37,304 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:21:37,317 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:21:37,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:21:37,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:21:37,318 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:21:37,318 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:21:37,318 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:21:37,318 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:21:37,319 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:21:37,319 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:21:37,319 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:21:37,319 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:21:37,319 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:21:37,320 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:21:37,320 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:21:37,320 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:21:37,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:21:37,321 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:21:37,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:21:37,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:21:37,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:21:37,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:21:37,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:21:37,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:21:37,322 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:21:37,322 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:21:37,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:21:37,322 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:21:37,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:21:37,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:21:37,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:21:37,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:21:37,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:21:37,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:21:37,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:21:37,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:21:37,324 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:21:37,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:21:37,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:21:37,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:21:37,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:21:37,324 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_025be378-eedd-4052-a6e3-a52cd1736782/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 -> 14ae8eb2d33b1f0bf446cd99369ade126e9422a8 [2019-12-07 21:21:37,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:21:37,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:21:37,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:21:37,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:21:37,444 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:21:37,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label12.c [2019-12-07 21:21:37,485 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/data/bb1400e55/cf541a02edb74b63b9819af0b6639c36/FLAG8217bdc12 [2019-12-07 21:21:37,933 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:21:37,934 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/sv-benchmarks/c/eca-rers2012/Problem01_label12.c [2019-12-07 21:21:37,942 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/data/bb1400e55/cf541a02edb74b63b9819af0b6639c36/FLAG8217bdc12 [2019-12-07 21:21:37,951 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/data/bb1400e55/cf541a02edb74b63b9819af0b6639c36 [2019-12-07 21:21:37,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:21:37,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:21:37,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:21:37,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:21:37,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:21:37,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:21:37" (1/1) ... [2019-12-07 21:21:37,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b1d85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:37, skipping insertion in model container [2019-12-07 21:21:37,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:21:37" (1/1) ... [2019-12-07 21:21:37,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:21:37,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:21:38,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:21:38,234 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:21:38,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:21:38,295 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:21:38,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38 WrapperNode [2019-12-07 21:21:38,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:21:38,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:21:38,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:21:38,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:21:38,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... [2019-12-07 21:21:38,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... [2019-12-07 21:21:38,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:21:38,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:21:38,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:21:38,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:21:38,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... [2019-12-07 21:21:38,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... [2019-12-07 21:21:38,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... [2019-12-07 21:21:38,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... [2019-12-07 21:21:38,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... [2019-12-07 21:21:38,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... [2019-12-07 21:21:38,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... [2019-12-07 21:21:38,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:21:38,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:21:38,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:21:38,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:21:38,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:21:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:21:38,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:21:39,464 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:21:39,464 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 21:21:39,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:39 BoogieIcfgContainer [2019-12-07 21:21:39,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:21:39,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:21:39,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:21:39,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:21:39,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:21:37" (1/3) ... [2019-12-07 21:21:39,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303cedf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:21:39, skipping insertion in model container [2019-12-07 21:21:39,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:38" (2/3) ... [2019-12-07 21:21:39,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303cedf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:21:39, skipping insertion in model container [2019-12-07 21:21:39,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:39" (3/3) ... [2019-12-07 21:21:39,471 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label12.c [2019-12-07 21:21:39,478 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:21:39,484 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:21:39,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:21:39,508 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:21:39,508 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:21:39,509 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:21:39,509 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:21:39,509 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:21:39,509 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:21:39,509 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:21:39,509 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:21:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 21:21:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 21:21:39,526 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:39,527 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-12-07 21:21:39,527 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:39,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1323231641, now seen corresponding path program 1 times [2019-12-07 21:21:39,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:39,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579915094] [2019-12-07 21:21:39,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:39,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579915094] [2019-12-07 21:21:39,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:39,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:39,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752598639] [2019-12-07 21:21:39,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:39,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:39,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:39,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:39,800 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 21:21:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:40,205 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 21:21:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:21:40,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 21:21:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:40,216 INFO L225 Difference]: With dead ends: 297 [2019-12-07 21:21:40,216 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 21:21:40,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 21:21:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-12-07 21:21:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 21:21:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-12-07 21:21:40,260 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-12-07 21:21:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:40,260 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-12-07 21:21:40,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-12-07 21:21:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 21:21:40,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:40,263 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-12-07 21:21:40,263 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1048384262, now seen corresponding path program 1 times [2019-12-07 21:21:40,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:40,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921772601] [2019-12-07 21:21:40,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:40,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921772601] [2019-12-07 21:21:40,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:40,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:40,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269509997] [2019-12-07 21:21:40,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:40,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:40,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:40,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:40,306 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-12-07 21:21:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:40,697 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-12-07 21:21:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:21:40,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 21:21:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:40,700 INFO L225 Difference]: With dead ends: 573 [2019-12-07 21:21:40,700 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 21:21:40,701 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-12-07 21:21:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 21:21:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 21:21:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 21:21:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-12-07 21:21:40,723 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-12-07 21:21:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:40,723 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-12-07 21:21:40,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-12-07 21:21:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 21:21:40,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:40,727 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-12-07 21:21:40,727 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:40,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:40,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2123288934, now seen corresponding path program 1 times [2019-12-07 21:21:40,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:40,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616301393] [2019-12-07 21:21:40,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:40,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616301393] [2019-12-07 21:21:40,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:40,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:21:40,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137766363] [2019-12-07 21:21:40,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:40,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:40,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:40,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:40,796 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 4 states. [2019-12-07 21:21:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:41,112 INFO L93 Difference]: Finished difference Result 857 states and 1413 transitions. [2019-12-07 21:21:41,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:21:41,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 21:21:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:41,115 INFO L225 Difference]: With dead ends: 857 [2019-12-07 21:21:41,115 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 21:21:41,116 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-12-07 21:21:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 21:21:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 21:21:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 21:21:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 633 transitions. [2019-12-07 21:21:41,128 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 633 transitions. Word has length 78 [2019-12-07 21:21:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:41,128 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 633 transitions. [2019-12-07 21:21:41,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 633 transitions. [2019-12-07 21:21:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 21:21:41,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:41,130 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-12-07 21:21:41,130 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash 293133309, now seen corresponding path program 1 times [2019-12-07 21:21:41,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:41,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614748915] [2019-12-07 21:21:41,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:21:41,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614748915] [2019-12-07 21:21:41,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:41,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:21:41,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415586763] [2019-12-07 21:21:41,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:41,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:41,169 INFO L87 Difference]: Start difference. First operand 429 states and 633 transitions. Second operand 3 states. [2019-12-07 21:21:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:41,391 INFO L93 Difference]: Finished difference Result 1141 states and 1669 transitions. [2019-12-07 21:21:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:41,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-12-07 21:21:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:41,395 INFO L225 Difference]: With dead ends: 1141 [2019-12-07 21:21:41,395 INFO L226 Difference]: Without dead ends: 713 [2019-12-07 21:21:41,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-07 21:21:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-12-07 21:21:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 21:21:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 888 transitions. [2019-12-07 21:21:41,407 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 888 transitions. Word has length 89 [2019-12-07 21:21:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:41,408 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 888 transitions. [2019-12-07 21:21:41,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 888 transitions. [2019-12-07 21:21:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 21:21:41,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:41,409 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:41,409 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1374578287, now seen corresponding path program 1 times [2019-12-07 21:21:41,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:41,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279533627] [2019-12-07 21:21:41,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 21:21:41,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279533627] [2019-12-07 21:21:41,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:41,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:41,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99609449] [2019-12-07 21:21:41,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:41,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:41,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:41,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:41,463 INFO L87 Difference]: Start difference. First operand 642 states and 888 transitions. Second operand 4 states. [2019-12-07 21:21:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:41,742 INFO L93 Difference]: Finished difference Result 1380 states and 1890 transitions. [2019-12-07 21:21:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:21:41,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 21:21:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:41,745 INFO L225 Difference]: With dead ends: 1380 [2019-12-07 21:21:41,745 INFO L226 Difference]: Without dead ends: 739 [2019-12-07 21:21:41,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:21:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-12-07 21:21:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 713. [2019-12-07 21:21:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-12-07 21:21:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 965 transitions. [2019-12-07 21:21:41,760 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 965 transitions. Word has length 97 [2019-12-07 21:21:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:41,760 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 965 transitions. [2019-12-07 21:21:41,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 965 transitions. [2019-12-07 21:21:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 21:21:41,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:41,762 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:41,762 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash 252004809, now seen corresponding path program 1 times [2019-12-07 21:21:41,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:41,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875004853] [2019-12-07 21:21:41,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 21:21:41,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875004853] [2019-12-07 21:21:41,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:41,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:21:41,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709868933] [2019-12-07 21:21:41,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:41,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:41,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:41,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:41,803 INFO L87 Difference]: Start difference. First operand 713 states and 965 transitions. Second operand 4 states. [2019-12-07 21:21:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:42,186 INFO L93 Difference]: Finished difference Result 1922 states and 2638 transitions. [2019-12-07 21:21:42,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:21:42,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 21:21:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:42,191 INFO L225 Difference]: With dead ends: 1922 [2019-12-07 21:21:42,191 INFO L226 Difference]: Without dead ends: 1281 [2019-12-07 21:21:42,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-12-07 21:21:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1068. [2019-12-07 21:21:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-12-07 21:21:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1400 transitions. [2019-12-07 21:21:42,213 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1400 transitions. Word has length 101 [2019-12-07 21:21:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:42,213 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1400 transitions. [2019-12-07 21:21:42,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1400 transitions. [2019-12-07 21:21:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 21:21:42,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:42,215 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:42,216 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash 526061964, now seen corresponding path program 1 times [2019-12-07 21:21:42,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:42,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941406257] [2019-12-07 21:21:42,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 21:21:42,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941406257] [2019-12-07 21:21:42,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:42,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:21:42,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173822764] [2019-12-07 21:21:42,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:21:42,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:21:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:21:42,339 INFO L87 Difference]: Start difference. First operand 1068 states and 1400 transitions. Second operand 8 states. [2019-12-07 21:21:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:42,866 INFO L93 Difference]: Finished difference Result 2245 states and 2951 transitions. [2019-12-07 21:21:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:21:42,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-12-07 21:21:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:42,871 INFO L225 Difference]: With dead ends: 2245 [2019-12-07 21:21:42,871 INFO L226 Difference]: Without dead ends: 1249 [2019-12-07 21:21:42,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:21:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-12-07 21:21:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1139. [2019-12-07 21:21:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-12-07 21:21:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1471 transitions. [2019-12-07 21:21:42,895 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1471 transitions. Word has length 115 [2019-12-07 21:21:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:42,895 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1471 transitions. [2019-12-07 21:21:42,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:21:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1471 transitions. [2019-12-07 21:21:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 21:21:42,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:42,897 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, 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-12-07 21:21:42,897 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:42,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1428370297, now seen corresponding path program 1 times [2019-12-07 21:21:42,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:42,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392617190] [2019-12-07 21:21:42,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 21:21:42,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392617190] [2019-12-07 21:21:42,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:42,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:21:42,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968904324] [2019-12-07 21:21:42,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:42,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:42,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:42,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:42,946 INFO L87 Difference]: Start difference. First operand 1139 states and 1471 transitions. Second operand 4 states. [2019-12-07 21:21:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:43,245 INFO L93 Difference]: Finished difference Result 2845 states and 3648 transitions. [2019-12-07 21:21:43,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:21:43,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 21:21:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:43,250 INFO L225 Difference]: With dead ends: 2845 [2019-12-07 21:21:43,251 INFO L226 Difference]: Without dead ends: 1352 [2019-12-07 21:21:43,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-12-07 21:21:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-12-07 21:21:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-12-07 21:21:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1192 transitions. [2019-12-07 21:21:43,270 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1192 transitions. Word has length 118 [2019-12-07 21:21:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:43,271 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1192 transitions. [2019-12-07 21:21:43,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1192 transitions. [2019-12-07 21:21:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 21:21:43,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:43,273 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:43,273 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:43,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:43,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2055484886, now seen corresponding path program 1 times [2019-12-07 21:21:43,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:43,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354920439] [2019-12-07 21:21:43,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 21:21:43,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354920439] [2019-12-07 21:21:43,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113027300] [2019-12-07 21:21:43,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:21:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:43,465 INFO L264 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 21:21:43,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 21:21:43,508 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:21:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 21:21:43,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:21:43,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-12-07 21:21:43,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937775385] [2019-12-07 21:21:43,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:43,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:43,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:21:43,535 INFO L87 Difference]: Start difference. First operand 1068 states and 1192 transitions. Second operand 3 states. [2019-12-07 21:21:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:43,732 INFO L93 Difference]: Finished difference Result 2206 states and 2466 transitions. [2019-12-07 21:21:43,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:43,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-12-07 21:21:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:43,738 INFO L225 Difference]: With dead ends: 2206 [2019-12-07 21:21:43,738 INFO L226 Difference]: Without dead ends: 1139 [2019-12-07 21:21:43,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:21:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-12-07 21:21:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-12-07 21:21:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-12-07 21:21:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1165 transitions. [2019-12-07 21:21:43,762 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1165 transitions. Word has length 164 [2019-12-07 21:21:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:43,762 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1165 transitions. [2019-12-07 21:21:43,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1165 transitions. [2019-12-07 21:21:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 21:21:43,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:43,765 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:43,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:21:43,966 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1425418322, now seen corresponding path program 1 times [2019-12-07 21:21:43,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:43,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281523862] [2019-12-07 21:21:43,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:44,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281523862] [2019-12-07 21:21:44,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489366886] [2019-12-07 21:21:44,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:21:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:44,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 21:21:44,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 21:21:44,318 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:21:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 21:21:44,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:21:44,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-12-07 21:21:44,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356231381] [2019-12-07 21:21:44,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:44,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:44,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:21:44,342 INFO L87 Difference]: Start difference. First operand 1068 states and 1165 transitions. Second operand 3 states. [2019-12-07 21:21:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:44,550 INFO L93 Difference]: Finished difference Result 2133 states and 2338 transitions. [2019-12-07 21:21:44,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:44,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 21:21:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:44,551 INFO L225 Difference]: With dead ends: 2133 [2019-12-07 21:21:44,551 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:21:44,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:21:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:21:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:21:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:21:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:21:44,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2019-12-07 21:21:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:44,554 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:21:44,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:21:44,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:21:44,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:21:44,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:21:45,134 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-12-07 21:21:45,374 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-12-07 21:21:45,376 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 21:21:45,376 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 21:21:45,376 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:21:45,376 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 21:21:45,376 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 21:21:45,376 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 21:21:45,376 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 21:21:45,377 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 21:21:45,378 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a16~0 4)) (.cse2 (<= ~a20~0 0)) (.cse7 (= ~a17~0 1)) (.cse9 (= 13 ~a8~0)) (.cse4 (not (= 15 ~a8~0))) (.cse3 (= ~a16~0 5)) (.cse6 (not (= 1 ~a7~0))) (.cse0 (<= ~a17~0 0)) (.cse1 (= ~a21~0 1)) (.cse8 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse4 .cse7 .cse1) (and .cse5 .cse4 .cse6 .cse1 .cse8) (and .cse9 .cse7) (and .cse6 .cse7 .cse1 .cse2) (and .cse5 .cse7 .cse1 .cse2) (and .cse6 .cse7 (= ~a12~0 8) .cse1 .cse8 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse3) (and .cse9 (not .cse3)) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse6 .cse1 .cse3) (and .cse6 .cse0 .cse1 .cse8))) [2019-12-07 21:21:45,378 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 21:21:45,378 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 21:21:45,378 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 21:21:45,378 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 21:21:45,378 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 21:21:45,378 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 21:21:45,378 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 21:21:45,378 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 21:21:45,378 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 21:21:45,378 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 21:21:45,379 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a16~0 4)) (.cse2 (<= ~a20~0 0)) (.cse7 (= ~a17~0 1)) (.cse9 (= 13 ~a8~0)) (.cse4 (not (= 15 ~a8~0))) (.cse3 (= ~a16~0 5)) (.cse6 (not (= 1 ~a7~0))) (.cse0 (<= ~a17~0 0)) (.cse1 (= ~a21~0 1)) (.cse8 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse4 .cse7 .cse1) (and .cse5 .cse4 .cse6 .cse1 .cse8) (and .cse9 .cse7) (and .cse6 .cse7 .cse1 .cse2) (and .cse5 .cse7 .cse1 .cse2) (and .cse6 (= ~a12~0 8) .cse7 .cse1 .cse8 .cse3) (and .cse9 (not .cse3)) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse6 .cse1 .cse3) (and .cse6 .cse0 .cse1 .cse8))) [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 21:21:45,380 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 536) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 21:21:45,381 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 21:21:45,382 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 21:21:45,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:21:45 BoogieIcfgContainer [2019-12-07 21:21:45,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:21:45,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:21:45,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:21:45,398 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:21:45,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:39" (3/4) ... [2019-12-07 21:21:45,401 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:21:45,415 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 100 nodes and edges [2019-12-07 21:21:45,417 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 21:21:45,418 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 21:21:45,420 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 21:21:45,499 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_025be378-eedd-4052-a6e3-a52cd1736782/bin/utaipan/witness.graphml [2019-12-07 21:21:45,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:21:45,500 INFO L168 Benchmark]: Toolchain (without parser) took 7546.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 937.3 MB in the beginning and 920.0 MB in the end (delta: 17.3 MB). Peak memory consumption was 253.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:45,500 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:21:45,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:45,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:45,501 INFO L168 Benchmark]: Boogie Preprocessor took 38.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:21:45,501 INFO L168 Benchmark]: RCFGBuilder took 1079.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 858.1 MB in the end (delta: 209.1 MB). Peak memory consumption was 209.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:45,501 INFO L168 Benchmark]: TraceAbstraction took 5931.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 133.7 MB). Free memory was 858.1 MB in the beginning and 939.3 MB in the end (delta: -81.2 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:45,501 INFO L168 Benchmark]: Witness Printer took 101.11 ms. Allocated memory is still 1.3 GB. Free memory was 939.3 MB in the beginning and 920.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:45,503 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1079.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 858.1 MB in the end (delta: 209.1 MB). Peak memory consumption was 209.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5931.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 133.7 MB). Free memory was 858.1 MB in the beginning and 939.3 MB in the end (delta: -81.2 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * Witness Printer took 101.11 ms. Allocated memory is still 1.3 GB. Free memory was 939.3 MB in the beginning and 920.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 536]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((a17 <= 0 && a21 == 1) && a20 <= 0) && a16 == 5) || (((!(15 == a8) && a21 == 1) && a20 <= 0) && a16 == 5)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1)) || ((((a16 == 4 && !(15 == a8)) && !(1 == a7)) && a21 == 1) && a20 == 1)) || (13 == a8 && a17 == 1)) || (((!(1 == a7) && a17 == 1) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && a17 == 1) && a21 == 1) && a20 <= 0)) || ((((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && !(1 == input)) && a16 == 5)) || (13 == a8 && !(a16 == 5))) || (((!(15 == a8) && a17 <= 0) && a21 == 1) && a16 == 5)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((a17 <= 0 && a21 == 1) && a20 <= 0) && a16 == 5) || (((!(15 == a8) && a21 == 1) && a20 <= 0) && a16 == 5)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1)) || ((((a16 == 4 && !(15 == a8)) && !(1 == a7)) && a21 == 1) && a20 == 1)) || (13 == a8 && a17 == 1)) || (((!(1 == a7) && a17 == 1) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && a17 == 1) && a21 == 1) && a20 <= 0)) || (((((!(1 == a7) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1) && a16 == 5)) || (13 == a8 && !(a16 == 5))) || (((!(15 == a8) && a17 <= 0) && a21 == 1) && a16 == 5)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 653 SDtfs, 1352 SDslu, 84 SDs, 0 SdLazy, 3249 SolverSat, 979 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 667 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 846 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 389 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7848 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1394 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1408 NumberOfCodeBlocks, 1408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1725 ConstructedInterpolants, 0 QuantifiedInterpolants, 700094 SizeOfPredicates, 2 NumberOfNonLiveVariables, 751 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1289/1336 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...