./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-atomic/lamport.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/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 4f308056a588d49578d6b80408483bd72f47ef45 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:13:17,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:13:17,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:13:17,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:13:17,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:13:17,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:13:17,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:13:17,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:13:17,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:13:17,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:13:17,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:13:17,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:13:17,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:13:17,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:13:17,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:13:17,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:13:17,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:13:17,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:13:17,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:13:17,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:13:17,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:13:17,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:13:17,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:13:17,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:13:17,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:13:17,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:13:17,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:13:17,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:13:17,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:13:17,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:13:17,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:13:17,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:13:17,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:13:17,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:13:17,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:13:17,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:13:17,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:13:17,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:13:17,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:13:17,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:13:17,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:13:17,524 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:13:17,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:13:17,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:13:17,542 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:13:17,542 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:13:17,542 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:13:17,543 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:13:17,543 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:13:17,543 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:13:17,543 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:13:17,544 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:13:17,545 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:13:17,545 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:13:17,545 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:13:17,545 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:13:17,545 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:13:17,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:13:17,546 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:13:17,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:13:17,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:13:17,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:13:17,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:13:17,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:13:17,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:13:17,548 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:13:17,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:13:17,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:13:17,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:13:17,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:13:17,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:13:17,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:13:17,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:13:17,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:13:17,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:13:17,550 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:13:17,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:13:17,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:13:17,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:13:17,551 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_c1896148-5653-4ab6-8b00-8725613c1633/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 -> 4f308056a588d49578d6b80408483bd72f47ef45 [2019-11-26 02:13:17,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:13:17,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:13:17,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:13:17,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:13:17,753 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:13:17,753 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/../../sv-benchmarks/c/pthread-atomic/lamport.i [2019-11-26 02:13:17,812 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/data/b36ff365e/0bf07ff6f5dc4693ae9373ca5385d1d7/FLAGf4be3b19f [2019-11-26 02:13:18,285 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:13:18,286 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/sv-benchmarks/c/pthread-atomic/lamport.i [2019-11-26 02:13:18,298 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/data/b36ff365e/0bf07ff6f5dc4693ae9373ca5385d1d7/FLAGf4be3b19f [2019-11-26 02:13:18,605 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/data/b36ff365e/0bf07ff6f5dc4693ae9373ca5385d1d7 [2019-11-26 02:13:18,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:13:18,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:13:18,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:13:18,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:13:18,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:13:18,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:13:18" (1/1) ... [2019-11-26 02:13:18,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c47741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:18, skipping insertion in model container [2019-11-26 02:13:18,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:13:18" (1/1) ... [2019-11-26 02:13:18,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:13:18,678 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:13:19,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:13:19,069 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:13:19,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:13:19,237 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:13:19,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19 WrapperNode [2019-11-26 02:13:19,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:13:19,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:13:19,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:13:19,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:13:19,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... [2019-11-26 02:13:19,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... [2019-11-26 02:13:19,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:13:19,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:13:19,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:13:19,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:13:19,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... [2019-11-26 02:13:19,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... [2019-11-26 02:13:19,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... [2019-11-26 02:13:19,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... [2019-11-26 02:13:19,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... [2019-11-26 02:13:19,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... [2019-11-26 02:13:19,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... [2019-11-26 02:13:19,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:13:19,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:13:19,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:13:19,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:13:19,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:13:19,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:13:19,377 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-26 02:13:19,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-26 02:13:19,377 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-26 02:13:19,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-26 02:13:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:13:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:13:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:13:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:13:19,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:13:19,380 WARN L202 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-26 02:13:19,785 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:13:19,785 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-26 02:13:19,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:13:19 BoogieIcfgContainer [2019-11-26 02:13:19,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:13:19,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:13:19,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:13:19,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:13:19,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:13:18" (1/3) ... [2019-11-26 02:13:19,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebd21b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:13:19, skipping insertion in model container [2019-11-26 02:13:19,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:13:19" (2/3) ... [2019-11-26 02:13:19,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebd21b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:13:19, skipping insertion in model container [2019-11-26 02:13:19,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:13:19" (3/3) ... [2019-11-26 02:13:19,793 INFO L109 eAbstractionObserver]: Analyzing ICFG lamport.i [2019-11-26 02:13:19,831 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,831 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,831 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,831 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,832 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,832 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,833 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,833 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,834 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,834 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,834 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,835 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,836 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,836 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,836 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,836 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,837 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,837 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,838 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,838 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,838 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,839 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,839 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,840 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,841 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,841 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,841 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,841 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,842 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,842 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,843 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,843 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,843 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,843 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,844 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,844 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 02:13:19,876 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-26 02:13:19,877 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:13:19,883 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-26 02:13:19,891 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-26 02:13:19,907 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:13:19,907 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:13:19,907 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:13:19,907 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:13:19,907 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:13:19,907 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:13:19,907 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:13:19,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:13:19,921 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 182 places, 249 transitions [2019-11-26 02:13:20,069 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1817 states. [2019-11-26 02:13:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states. [2019-11-26 02:13:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 02:13:20,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:20,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:13:20,085 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2107991510, now seen corresponding path program 1 times [2019-11-26 02:13:20,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:20,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583775564] [2019-11-26 02:13:20,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:20,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583775564] [2019-11-26 02:13:20,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:20,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:13:20,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634530061] [2019-11-26 02:13:20,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:13:20,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:20,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:13:20,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:13:20,276 INFO L87 Difference]: Start difference. First operand 1817 states. Second operand 2 states. [2019-11-26 02:13:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:20,344 INFO L93 Difference]: Finished difference Result 1817 states and 5405 transitions. [2019-11-26 02:13:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:13:20,346 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-11-26 02:13:20,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:20,401 INFO L225 Difference]: With dead ends: 1817 [2019-11-26 02:13:20,402 INFO L226 Difference]: Without dead ends: 1703 [2019-11-26 02:13:20,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:13:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-11-26 02:13:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1703. [2019-11-26 02:13:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-11-26 02:13:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 5135 transitions. [2019-11-26 02:13:20,580 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 5135 transitions. Word has length 19 [2019-11-26 02:13:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:20,580 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 5135 transitions. [2019-11-26 02:13:20,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:13:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 5135 transitions. [2019-11-26 02:13:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:13:20,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:20,586 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] [2019-11-26 02:13:20,586 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash -124043682, now seen corresponding path program 1 times [2019-11-26 02:13:20,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:20,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259708947] [2019-11-26 02:13:20,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:20,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259708947] [2019-11-26 02:13:20,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:20,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:20,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952893861] [2019-11-26 02:13:20,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:20,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:20,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:20,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:20,675 INFO L87 Difference]: Start difference. First operand 1703 states and 5135 transitions. Second operand 3 states. [2019-11-26 02:13:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:20,736 INFO L93 Difference]: Finished difference Result 1688 states and 5004 transitions. [2019-11-26 02:13:20,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:20,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-26 02:13:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:20,748 INFO L225 Difference]: With dead ends: 1688 [2019-11-26 02:13:20,748 INFO L226 Difference]: Without dead ends: 1400 [2019-11-26 02:13:20,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-11-26 02:13:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1346. [2019-11-26 02:13:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2019-11-26 02:13:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 4070 transitions. [2019-11-26 02:13:20,799 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 4070 transitions. Word has length 25 [2019-11-26 02:13:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:20,799 INFO L462 AbstractCegarLoop]: Abstraction has 1346 states and 4070 transitions. [2019-11-26 02:13:20,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 4070 transitions. [2019-11-26 02:13:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 02:13:20,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:20,809 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] [2019-11-26 02:13:20,809 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:20,810 INFO L82 PathProgramCache]: Analyzing trace with hash 772914522, now seen corresponding path program 1 times [2019-11-26 02:13:20,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:20,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692560134] [2019-11-26 02:13:20,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:20,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692560134] [2019-11-26 02:13:20,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:20,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:20,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210138625] [2019-11-26 02:13:20,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:20,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:20,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:20,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:20,880 INFO L87 Difference]: Start difference. First operand 1346 states and 4070 transitions. Second operand 3 states. [2019-11-26 02:13:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:20,908 INFO L93 Difference]: Finished difference Result 1256 states and 3768 transitions. [2019-11-26 02:13:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:20,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-26 02:13:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:20,917 INFO L225 Difference]: With dead ends: 1256 [2019-11-26 02:13:20,917 INFO L226 Difference]: Without dead ends: 953 [2019-11-26 02:13:20,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-11-26 02:13:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2019-11-26 02:13:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-26 02:13:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 2915 transitions. [2019-11-26 02:13:20,954 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 2915 transitions. Word has length 28 [2019-11-26 02:13:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:20,955 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 2915 transitions. [2019-11-26 02:13:20,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 2915 transitions. [2019-11-26 02:13:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:13:20,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:20,959 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] [2019-11-26 02:13:20,959 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash 566255697, now seen corresponding path program 1 times [2019-11-26 02:13:20,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:20,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492327557] [2019-11-26 02:13:20,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:21,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492327557] [2019-11-26 02:13:21,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:21,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:21,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752333446] [2019-11-26 02:13:21,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:21,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:21,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:21,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,007 INFO L87 Difference]: Start difference. First operand 953 states and 2915 transitions. Second operand 3 states. [2019-11-26 02:13:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:21,048 INFO L93 Difference]: Finished difference Result 1487 states and 4401 transitions. [2019-11-26 02:13:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:21,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-26 02:13:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:21,061 INFO L225 Difference]: With dead ends: 1487 [2019-11-26 02:13:21,061 INFO L226 Difference]: Without dead ends: 1487 [2019-11-26 02:13:21,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-11-26 02:13:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1106. [2019-11-26 02:13:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2019-11-26 02:13:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 3394 transitions. [2019-11-26 02:13:21,108 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 3394 transitions. Word has length 37 [2019-11-26 02:13:21,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:21,109 INFO L462 AbstractCegarLoop]: Abstraction has 1106 states and 3394 transitions. [2019-11-26 02:13:21,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 3394 transitions. [2019-11-26 02:13:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:13:21,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:21,113 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] [2019-11-26 02:13:21,113 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:21,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:21,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1821938953, now seen corresponding path program 1 times [2019-11-26 02:13:21,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:21,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202043276] [2019-11-26 02:13:21,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:21,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202043276] [2019-11-26 02:13:21,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:21,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:21,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972076515] [2019-11-26 02:13:21,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:21,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:21,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,185 INFO L87 Difference]: Start difference. First operand 1106 states and 3394 transitions. Second operand 3 states. [2019-11-26 02:13:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:21,249 INFO L93 Difference]: Finished difference Result 1469 states and 4413 transitions. [2019-11-26 02:13:21,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:21,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-26 02:13:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:21,260 INFO L225 Difference]: With dead ends: 1469 [2019-11-26 02:13:21,260 INFO L226 Difference]: Without dead ends: 1169 [2019-11-26 02:13:21,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-11-26 02:13:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1067. [2019-11-26 02:13:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-11-26 02:13:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3149 transitions. [2019-11-26 02:13:21,303 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3149 transitions. Word has length 37 [2019-11-26 02:13:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:21,303 INFO L462 AbstractCegarLoop]: Abstraction has 1067 states and 3149 transitions. [2019-11-26 02:13:21,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3149 transitions. [2019-11-26 02:13:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:13:21,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:21,307 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] [2019-11-26 02:13:21,307 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:21,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1096091805, now seen corresponding path program 2 times [2019-11-26 02:13:21,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:21,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389118878] [2019-11-26 02:13:21,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:21,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389118878] [2019-11-26 02:13:21,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:21,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:21,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131010615] [2019-11-26 02:13:21,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:21,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:21,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:21,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,336 INFO L87 Difference]: Start difference. First operand 1067 states and 3149 transitions. Second operand 3 states. [2019-11-26 02:13:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:21,384 INFO L93 Difference]: Finished difference Result 926 states and 2500 transitions. [2019-11-26 02:13:21,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:21,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-26 02:13:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:21,388 INFO L225 Difference]: With dead ends: 926 [2019-11-26 02:13:21,388 INFO L226 Difference]: Without dead ends: 668 [2019-11-26 02:13:21,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-11-26 02:13:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 587. [2019-11-26 02:13:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-26 02:13:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1488 transitions. [2019-11-26 02:13:21,406 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1488 transitions. Word has length 37 [2019-11-26 02:13:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:21,407 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1488 transitions. [2019-11-26 02:13:21,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1488 transitions. [2019-11-26 02:13:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:13:21,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:21,409 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] [2019-11-26 02:13:21,409 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1530523923, now seen corresponding path program 3 times [2019-11-26 02:13:21,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:21,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419090841] [2019-11-26 02:13:21,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:21,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419090841] [2019-11-26 02:13:21,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:21,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:13:21,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816366148] [2019-11-26 02:13:21,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:13:21,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:13:21,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:13:21,445 INFO L87 Difference]: Start difference. First operand 587 states and 1488 transitions. Second operand 4 states. [2019-11-26 02:13:21,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:21,476 INFO L93 Difference]: Finished difference Result 872 states and 2185 transitions. [2019-11-26 02:13:21,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:21,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-26 02:13:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:21,482 INFO L225 Difference]: With dead ends: 872 [2019-11-26 02:13:21,483 INFO L226 Difference]: Without dead ends: 863 [2019-11-26 02:13:21,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:13:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-11-26 02:13:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 569. [2019-11-26 02:13:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-11-26 02:13:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1425 transitions. [2019-11-26 02:13:21,506 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 1425 transitions. Word has length 37 [2019-11-26 02:13:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:21,506 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 1425 transitions. [2019-11-26 02:13:21,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:13:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1425 transitions. [2019-11-26 02:13:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-26 02:13:21,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:21,508 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] [2019-11-26 02:13:21,509 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:21,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1733266930, now seen corresponding path program 1 times [2019-11-26 02:13:21,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:21,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009948051] [2019-11-26 02:13:21,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:21,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009948051] [2019-11-26 02:13:21,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:21,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:21,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764915963] [2019-11-26 02:13:21,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:21,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:21,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,542 INFO L87 Difference]: Start difference. First operand 569 states and 1425 transitions. Second operand 3 states. [2019-11-26 02:13:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:21,589 INFO L93 Difference]: Finished difference Result 545 states and 1361 transitions. [2019-11-26 02:13:21,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:21,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-26 02:13:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:21,593 INFO L225 Difference]: With dead ends: 545 [2019-11-26 02:13:21,593 INFO L226 Difference]: Without dead ends: 473 [2019-11-26 02:13:21,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-26 02:13:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2019-11-26 02:13:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-11-26 02:13:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1178 transitions. [2019-11-26 02:13:21,607 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1178 transitions. Word has length 40 [2019-11-26 02:13:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:21,607 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1178 transitions. [2019-11-26 02:13:21,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1178 transitions. [2019-11-26 02:13:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-26 02:13:21,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:13:21,609 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] [2019-11-26 02:13:21,609 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:13:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:13:21,610 INFO L82 PathProgramCache]: Analyzing trace with hash -310974678, now seen corresponding path program 1 times [2019-11-26 02:13:21,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:13:21,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261013812] [2019-11-26 02:13:21,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:13:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:13:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:13:21,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261013812] [2019-11-26 02:13:21,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:13:21,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:13:21,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594501561] [2019-11-26 02:13:21,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:13:21,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:13:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:13:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,636 INFO L87 Difference]: Start difference. First operand 473 states and 1178 transitions. Second operand 3 states. [2019-11-26 02:13:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:13:21,642 INFO L93 Difference]: Finished difference Result 314 states and 832 transitions. [2019-11-26 02:13:21,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:13:21,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-26 02:13:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:13:21,643 INFO L225 Difference]: With dead ends: 314 [2019-11-26 02:13:21,643 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:13:21,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:13:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:13:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:13:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:13:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:13:21,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-11-26 02:13:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:13:21,644 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:13:21,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:13:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:13:21,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:13:21,647 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-26 02:13:21,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:13:21 BasicIcfg [2019-11-26 02:13:21,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:13:21,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:13:21,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:13:21,650 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:13:21,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:13:19" (3/4) ... [2019-11-26 02:13:21,653 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:13:21,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-26 02:13:21,660 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-26 02:13:21,663 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-26 02:13:21,663 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-26 02:13:21,663 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:13:21,698 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c1896148-5653-4ab6-8b00-8725613c1633/bin/utaipan/witness.graphml [2019-11-26 02:13:21,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:13:21,700 INFO L168 Benchmark]: Toolchain (without parser) took 3091.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -290.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:13:21,700 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:13:21,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -230.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:13:21,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:13:21,701 INFO L168 Benchmark]: Boogie Preprocessor took 28.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:13:21,702 INFO L168 Benchmark]: RCFGBuilder took 464.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:13:21,702 INFO L168 Benchmark]: TraceAbstraction took 1862.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:13:21,703 INFO L168 Benchmark]: Witness Printer took 48.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:13:21,705 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 628.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -230.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 464.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1862.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 48.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 723]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 697]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 697]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 723]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 723]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 697]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 697]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 723]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 216 locations, 8 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 825 SDtfs, 288 SDslu, 507 SDs, 0 SdLazy, 92 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1817occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 912 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 13053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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...