./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:15:16,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:15:16,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:15:16,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:15:16,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:15:16,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:15:16,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:15:16,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:15:16,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:15:16,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:15:16,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:15:16,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:15:16,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:15:16,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:15:16,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:15:16,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:15:16,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:15:16,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:15:16,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:15:16,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:15:16,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:15:16,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:15:16,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:15:16,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:15:16,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:15:16,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:15:16,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:15:16,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:15:16,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:15:16,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:15:16,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:15:16,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:15:16,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:15:16,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:15:16,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:15:16,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:15:16,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:15:16,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:15:16,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:15:16,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:15:16,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:15:16,621 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 02:15:16,683 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:15:16,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:15:16,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:15:16,686 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:15:16,686 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:15:16,686 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:15:16,687 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:15:16,687 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:15:16,687 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:15:16,687 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:15:16,689 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:15:16,689 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:15:16,690 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:15:16,690 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:15:16,690 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:15:16,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:15:16,692 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:15:16,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:15:16,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:15:16,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:15:16,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:15:16,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:15:16,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:15:16,694 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:15:16,694 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:15:16,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:15:16,695 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:15:16,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:15:16,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:15:16,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:15:16,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:15:16,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:15:16,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:15:16,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:15:16,699 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:15:16,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:15:16,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:15:16,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:15:16,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:15:16,701 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8 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(reach_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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2021-11-07 02:15:17,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:15:17,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:15:17,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:15:17,103 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:15:17,104 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:15:17,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-11-07 02:15:17,176 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/data/660e27a20/9586df4745c740748a399eebf7d8790e/FLAG9e3841dc0 [2021-11-07 02:15:17,797 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:15:17,801 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-11-07 02:15:17,836 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/data/660e27a20/9586df4745c740748a399eebf7d8790e/FLAG9e3841dc0 [2021-11-07 02:15:18,052 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/data/660e27a20/9586df4745c740748a399eebf7d8790e [2021-11-07 02:15:18,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:15:18,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:15:18,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:15:18,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:15:18,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:15:18,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:15:18" (1/1) ... [2021-11-07 02:15:18,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd3ca6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:18, skipping insertion in model container [2021-11-07 02:15:18,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:15:18" (1/1) ... [2021-11-07 02:15:18,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:15:18,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:15:18,399 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-11-07 02:15:18,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:15:18,829 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:15:18,845 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-11-07 02:15:18,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:15:19,019 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:15:19,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19 WrapperNode [2021-11-07 02:15:19,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:15:19,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:15:19,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:15:19,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:15:19,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:15:19,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:15:19,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:15:19,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:15:19,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:15:19,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:15:19,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:15:19,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:15:19,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (1/1) ... [2021-11-07 02:15:19,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:15:19,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:15:19,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:15:19,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:15:19,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 02:15:19,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-07 02:15:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:15:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 02:15:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-07 02:15:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-07 02:15:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-07 02:15:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-07 02:15:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-07 02:15:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-07 02:15:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-11-07 02:15:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-11-07 02:15:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:15:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-07 02:15:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:15:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:15:19,332 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-07 02:15:21,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:15:21,515 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-07 02:15:21,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:15:21 BoogieIcfgContainer [2021-11-07 02:15:21,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:15:21,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:15:21,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:15:21,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:15:21,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:15:18" (1/3) ... [2021-11-07 02:15:21,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541b9292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:15:21, skipping insertion in model container [2021-11-07 02:15:21,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:15:19" (2/3) ... [2021-11-07 02:15:21,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541b9292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:15:21, skipping insertion in model container [2021-11-07 02:15:21,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:15:21" (3/3) ... [2021-11-07 02:15:21,531 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-11-07 02:15:21,538 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-07 02:15:21,539 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:15:21,539 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 02:15:21,539 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-07 02:15:21,587 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,588 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,588 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,589 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,589 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,589 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,590 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,590 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,591 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,592 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,592 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,593 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,593 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,593 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,593 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,594 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,594 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,594 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,595 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,595 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,595 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,596 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,596 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,596 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,597 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,597 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,597 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,598 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,598 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,598 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,600 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,600 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,600 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,602 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,602 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,602 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,603 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,603 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,605 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,606 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,606 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,606 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,607 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,607 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,607 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,607 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,608 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,608 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,608 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,609 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,609 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,609 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,610 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,610 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,610 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,611 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,611 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,611 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,611 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,611 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,612 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,612 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,613 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,613 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,613 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,613 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,614 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,614 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,615 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,615 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,615 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,615 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,619 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,621 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,621 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,621 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,622 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,622 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,622 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,622 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,625 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,626 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,628 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,628 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,629 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,629 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,629 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,629 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,633 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,633 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,633 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,634 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 02:15:21,635 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-07 02:15:21,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:15:21,701 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:15:21,701 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-07 02:15:21,724 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-07 02:15:21,743 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 268 flow [2021-11-07 02:15:21,751 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 268 flow [2021-11-07 02:15:21,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 268 flow [2021-11-07 02:15:21,853 INFO L129 PetriNetUnfolder]: 2/120 cut-off events. [2021-11-07 02:15:21,853 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-07 02:15:21,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2021-11-07 02:15:21,868 INFO L116 LiptonReduction]: Number of co-enabled transitions 2682 [2021-11-07 02:15:41,075 INFO L131 LiptonReduction]: Checked pairs total: 6268 [2021-11-07 02:15:41,075 INFO L133 LiptonReduction]: Total number of compositions: 101 [2021-11-07 02:15:41,087 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2021-11-07 02:15:41,278 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2282 states, 2279 states have (on average 3.8121983326020183) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 2282 states, 2279 states have (on average 3.8121983326020183) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:15:41,305 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:41,306 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:41,307 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1638475840, now seen corresponding path program 1 times [2021-11-07 02:15:41,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:41,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424612118] [2021-11-07 02:15:41,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:41,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:41,817 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:41,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424612118] [2021-11-07 02:15:41,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424612118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:41,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:41,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 02:15:41,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624523601] [2021-11-07 02:15:41,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:15:41,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:15:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:15:41,872 INFO L87 Difference]: Start difference. First operand has 2282 states, 2279 states have (on average 3.8121983326020183) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:42,033 INFO L93 Difference]: Finished difference Result 1882 states and 7048 transitions. [2021-11-07 02:15:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:15:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-07 02:15:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:42,106 INFO L225 Difference]: With dead ends: 1882 [2021-11-07 02:15:42,106 INFO L226 Difference]: Without dead ends: 1802 [2021-11-07 02:15:42,108 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:15:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2021-11-07 02:15:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2021-11-07 02:15:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 3.7667962243198225) internal successors, (6784), 1801 states have internal predecessors, (6784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2021-11-07 02:15:42,356 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2021-11-07 02:15:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:42,357 INFO L470 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2021-11-07 02:15:42,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2021-11-07 02:15:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:15:42,362 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:42,362 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:42,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:15:42,362 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1677622827, now seen corresponding path program 1 times [2021-11-07 02:15:42,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:42,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956536857] [2021-11-07 02:15:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:42,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:42,601 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:42,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956536857] [2021-11-07 02:15:42,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956536857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:42,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:42,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 02:15:42,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976720684] [2021-11-07 02:15:42,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:15:42,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:42,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:15:42,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:15:42,606 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:42,648 INFO L93 Difference]: Finished difference Result 1752 states and 6554 transitions. [2021-11-07 02:15:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:15:42,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:15:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:42,675 INFO L225 Difference]: With dead ends: 1752 [2021-11-07 02:15:42,675 INFO L226 Difference]: Without dead ends: 1752 [2021-11-07 02:15:42,676 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:15:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2021-11-07 02:15:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2021-11-07 02:15:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 3.743003997715591) internal successors, (6554), 1751 states have internal predecessors, (6554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 6554 transitions. [2021-11-07 02:15:42,783 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 6554 transitions. Word has length 11 [2021-11-07 02:15:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:42,783 INFO L470 AbstractCegarLoop]: Abstraction has 1752 states and 6554 transitions. [2021-11-07 02:15:42,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 6554 transitions. [2021-11-07 02:15:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 02:15:42,787 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:42,787 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:42,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:15:42,788 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:42,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1241052862, now seen corresponding path program 1 times [2021-11-07 02:15:42,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:42,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678576575] [2021-11-07 02:15:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:42,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:42,995 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:42,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678576575] [2021-11-07 02:15:42,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678576575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:42,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:42,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 02:15:42,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489179317] [2021-11-07 02:15:42,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:15:42,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:15:42,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:15:42,999 INFO L87 Difference]: Start difference. First operand 1752 states and 6554 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:43,049 INFO L93 Difference]: Finished difference Result 1722 states and 6420 transitions. [2021-11-07 02:15:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:15:43,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 02:15:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:43,076 INFO L225 Difference]: With dead ends: 1722 [2021-11-07 02:15:43,076 INFO L226 Difference]: Without dead ends: 1722 [2021-11-07 02:15:43,077 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:15:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2021-11-07 02:15:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2021-11-07 02:15:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1721 states have (on average 3.730389308541546) internal successors, (6420), 1721 states have internal predecessors, (6420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6420 transitions. [2021-11-07 02:15:43,181 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6420 transitions. Word has length 12 [2021-11-07 02:15:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:43,181 INFO L470 AbstractCegarLoop]: Abstraction has 1722 states and 6420 transitions. [2021-11-07 02:15:43,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6420 transitions. [2021-11-07 02:15:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:15:43,188 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:43,188 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:43,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:15:43,189 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1771173454, now seen corresponding path program 1 times [2021-11-07 02:15:43,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:43,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852371066] [2021-11-07 02:15:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:43,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:43,391 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:43,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852371066] [2021-11-07 02:15:43,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852371066] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:43,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:43,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:15:43,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433565166] [2021-11-07 02:15:43,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:15:43,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:15:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:15:43,397 INFO L87 Difference]: Start difference. First operand 1722 states and 6420 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:43,489 INFO L93 Difference]: Finished difference Result 2386 states and 8562 transitions. [2021-11-07 02:15:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:15:43,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 02:15:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:43,517 INFO L225 Difference]: With dead ends: 2386 [2021-11-07 02:15:43,517 INFO L226 Difference]: Without dead ends: 1842 [2021-11-07 02:15:43,518 INFO L786 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 [2021-11-07 02:15:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-11-07 02:15:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1682. [2021-11-07 02:15:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 3.5609756097560976) internal successors, (5986), 1681 states have internal predecessors, (5986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 5986 transitions. [2021-11-07 02:15:43,653 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 5986 transitions. Word has length 13 [2021-11-07 02:15:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:43,653 INFO L470 AbstractCegarLoop]: Abstraction has 1682 states and 5986 transitions. [2021-11-07 02:15:43,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 5986 transitions. [2021-11-07 02:15:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:15:43,657 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:43,658 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:43,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:15:43,658 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1081592393, now seen corresponding path program 1 times [2021-11-07 02:15:43,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:43,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042213387] [2021-11-07 02:15:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:43,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:43,998 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:43,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042213387] [2021-11-07 02:15:43,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042213387] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:43,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:43,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:15:43,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184178575] [2021-11-07 02:15:44,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:15:44,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:44,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:15:44,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:15:44,001 INFO L87 Difference]: Start difference. First operand 1682 states and 5986 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:44,082 INFO L93 Difference]: Finished difference Result 1640 states and 5800 transitions. [2021-11-07 02:15:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:15:44,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 02:15:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:44,104 INFO L225 Difference]: With dead ends: 1640 [2021-11-07 02:15:44,105 INFO L226 Difference]: Without dead ends: 1640 [2021-11-07 02:15:44,106 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:15:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-11-07 02:15:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2021-11-07 02:15:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 3.538743136058572) internal successors, (5800), 1639 states have internal predecessors, (5800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5800 transitions. [2021-11-07 02:15:44,250 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5800 transitions. Word has length 13 [2021-11-07 02:15:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:44,251 INFO L470 AbstractCegarLoop]: Abstraction has 1640 states and 5800 transitions. [2021-11-07 02:15:44,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5800 transitions. [2021-11-07 02:15:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 02:15:44,257 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:44,258 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:44,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:15:44,258 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1872787779, now seen corresponding path program 1 times [2021-11-07 02:15:44,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:44,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19504397] [2021-11-07 02:15:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:44,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:44,501 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:44,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19504397] [2021-11-07 02:15:44,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19504397] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:44,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:44,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:15:44,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208152] [2021-11-07 02:15:44,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:15:44,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:15:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:15:44,503 INFO L87 Difference]: Start difference. First operand 1640 states and 5800 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:44,608 INFO L93 Difference]: Finished difference Result 1598 states and 5628 transitions. [2021-11-07 02:15:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:15:44,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-07 02:15:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:44,630 INFO L225 Difference]: With dead ends: 1598 [2021-11-07 02:15:44,631 INFO L226 Difference]: Without dead ends: 1598 [2021-11-07 02:15:44,631 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:15:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2021-11-07 02:15:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2021-11-07 02:15:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 3.5241077019411398) internal successors, (5628), 1597 states have internal predecessors, (5628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 5628 transitions. [2021-11-07 02:15:44,713 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 5628 transitions. Word has length 14 [2021-11-07 02:15:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:44,713 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 5628 transitions. [2021-11-07 02:15:44,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 5628 transitions. [2021-11-07 02:15:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:15:44,720 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:44,720 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:44,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:15:44,721 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2073075207, now seen corresponding path program 1 times [2021-11-07 02:15:44,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:44,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838136439] [2021-11-07 02:15:44,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:44,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:44,957 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:44,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838136439] [2021-11-07 02:15:44,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838136439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:44,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:44,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:15:44,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326678904] [2021-11-07 02:15:44,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:15:44,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:44,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:15:44,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:15:44,960 INFO L87 Difference]: Start difference. First operand 1598 states and 5628 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:45,141 INFO L93 Difference]: Finished difference Result 1710 states and 6056 transitions. [2021-11-07 02:15:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:15:45,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:15:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:45,165 INFO L225 Difference]: With dead ends: 1710 [2021-11-07 02:15:45,166 INFO L226 Difference]: Without dead ends: 1710 [2021-11-07 02:15:45,166 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:15:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2021-11-07 02:15:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1710. [2021-11-07 02:15:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1709 states have (on average 3.543592744294909) internal successors, (6056), 1709 states have internal predecessors, (6056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 6056 transitions. [2021-11-07 02:15:45,254 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 6056 transitions. Word has length 15 [2021-11-07 02:15:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:45,255 INFO L470 AbstractCegarLoop]: Abstraction has 1710 states and 6056 transitions. [2021-11-07 02:15:45,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 6056 transitions. [2021-11-07 02:15:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:15:45,260 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:45,260 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:45,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:15:45,261 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:45,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2073119847, now seen corresponding path program 2 times [2021-11-07 02:15:45,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:45,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931989403] [2021-11-07 02:15:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:45,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:45,460 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:45,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931989403] [2021-11-07 02:15:45,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931989403] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:45,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:45,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:15:45,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389018438] [2021-11-07 02:15:45,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:15:45,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:45,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:15:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:15:45,464 INFO L87 Difference]: Start difference. First operand 1710 states and 6056 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:45,556 INFO L93 Difference]: Finished difference Result 1934 states and 6816 transitions. [2021-11-07 02:15:45,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:15:45,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:15:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:45,611 INFO L225 Difference]: With dead ends: 1934 [2021-11-07 02:15:45,612 INFO L226 Difference]: Without dead ends: 1934 [2021-11-07 02:15:45,612 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:15:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2021-11-07 02:15:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1886. [2021-11-07 02:15:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1885 states have (on average 3.53315649867374) internal successors, (6660), 1885 states have internal predecessors, (6660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6660 transitions. [2021-11-07 02:15:45,697 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6660 transitions. Word has length 15 [2021-11-07 02:15:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:45,697 INFO L470 AbstractCegarLoop]: Abstraction has 1886 states and 6660 transitions. [2021-11-07 02:15:45,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6660 transitions. [2021-11-07 02:15:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:15:45,701 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:45,701 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:45,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:15:45,703 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash -29626043, now seen corresponding path program 3 times [2021-11-07 02:15:45,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:45,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810868951] [2021-11-07 02:15:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:45,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:45,879 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:45,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810868951] [2021-11-07 02:15:45,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810868951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:45,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:45,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:15:45,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176332266] [2021-11-07 02:15:45,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:15:45,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:15:45,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:15:45,882 INFO L87 Difference]: Start difference. First operand 1886 states and 6660 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:45,984 INFO L93 Difference]: Finished difference Result 1982 states and 6946 transitions. [2021-11-07 02:15:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:15:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:15:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:45,999 INFO L225 Difference]: With dead ends: 1982 [2021-11-07 02:15:45,999 INFO L226 Difference]: Without dead ends: 1982 [2021-11-07 02:15:46,000 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:15:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-11-07 02:15:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1858. [2021-11-07 02:15:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 3.493807215939688) internal successors, (6488), 1857 states have internal predecessors, (6488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 6488 transitions. [2021-11-07 02:15:46,145 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 6488 transitions. Word has length 15 [2021-11-07 02:15:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:46,145 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 6488 transitions. [2021-11-07 02:15:46,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 6488 transitions. [2021-11-07 02:15:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:15:46,152 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:46,153 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:46,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:15:46,153 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash -159180566, now seen corresponding path program 1 times [2021-11-07 02:15:46,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:46,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764666419] [2021-11-07 02:15:46,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:46,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:46,374 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:46,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764666419] [2021-11-07 02:15:46,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764666419] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:46,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:46,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:15:46,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161155407] [2021-11-07 02:15:46,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 02:15:46,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:46,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 02:15:46,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:15:46,377 INFO L87 Difference]: Start difference. First operand 1858 states and 6488 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:46,535 INFO L93 Difference]: Finished difference Result 2090 states and 7300 transitions. [2021-11-07 02:15:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:15:46,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 02:15:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:46,549 INFO L225 Difference]: With dead ends: 2090 [2021-11-07 02:15:46,550 INFO L226 Difference]: Without dead ends: 2090 [2021-11-07 02:15:46,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:15:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2021-11-07 02:15:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1610. [2021-11-07 02:15:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 3.487880671224363) internal successors, (5612), 1609 states have internal predecessors, (5612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 5612 transitions. [2021-11-07 02:15:46,669 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 5612 transitions. Word has length 16 [2021-11-07 02:15:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:46,669 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 5612 transitions. [2021-11-07 02:15:46,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 5612 transitions. [2021-11-07 02:15:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:15:46,675 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:46,675 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:46,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:15:46,676 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:46,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:46,677 INFO L85 PathProgramCache]: Analyzing trace with hash -920960370, now seen corresponding path program 1 times [2021-11-07 02:15:46,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:46,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547668867] [2021-11-07 02:15:46,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:46,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:46,800 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:46,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547668867] [2021-11-07 02:15:46,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547668867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:46,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:46,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:15:46,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56142617] [2021-11-07 02:15:46,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:15:46,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:15:46,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:15:46,809 INFO L87 Difference]: Start difference. First operand 1610 states and 5612 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:46,866 INFO L93 Difference]: Finished difference Result 1715 states and 5456 transitions. [2021-11-07 02:15:46,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:15:46,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 02:15:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:46,874 INFO L225 Difference]: With dead ends: 1715 [2021-11-07 02:15:46,875 INFO L226 Difference]: Without dead ends: 1283 [2021-11-07 02:15:46,875 INFO L786 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 [2021-11-07 02:15:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2021-11-07 02:15:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2021-11-07 02:15:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 3.1630265210608424) internal successors, (4055), 1282 states have internal predecessors, (4055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 4055 transitions. [2021-11-07 02:15:46,932 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 4055 transitions. Word has length 16 [2021-11-07 02:15:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:46,932 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 4055 transitions. [2021-11-07 02:15:46,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 4055 transitions. [2021-11-07 02:15:46,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:15:46,939 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:46,939 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:46,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 02:15:46,939 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1239163265, now seen corresponding path program 1 times [2021-11-07 02:15:46,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:46,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651873002] [2021-11-07 02:15:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:46,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:47,075 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:47,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651873002] [2021-11-07 02:15:47,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651873002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:47,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:47,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:15:47,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122442554] [2021-11-07 02:15:47,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:15:47,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:47,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:15:47,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:15:47,078 INFO L87 Difference]: Start difference. First operand 1283 states and 4055 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:47,135 INFO L93 Difference]: Finished difference Result 1150 states and 3339 transitions. [2021-11-07 02:15:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:15:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:15:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:47,140 INFO L225 Difference]: With dead ends: 1150 [2021-11-07 02:15:47,140 INFO L226 Difference]: Without dead ends: 871 [2021-11-07 02:15:47,141 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:15:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-11-07 02:15:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2021-11-07 02:15:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 2.8517241379310345) internal successors, (2481), 870 states have internal predecessors, (2481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2481 transitions. [2021-11-07 02:15:47,197 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2481 transitions. Word has length 17 [2021-11-07 02:15:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:47,197 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 2481 transitions. [2021-11-07 02:15:47,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2481 transitions. [2021-11-07 02:15:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:15:47,201 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:47,201 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:47,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:15:47,202 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash 634628423, now seen corresponding path program 1 times [2021-11-07 02:15:47,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:47,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368646636] [2021-11-07 02:15:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:47,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:47,306 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:47,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368646636] [2021-11-07 02:15:47,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368646636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:47,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:47,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:15:47,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534831113] [2021-11-07 02:15:47,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:15:47,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:47,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:15:47,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:15:47,310 INFO L87 Difference]: Start difference. First operand 871 states and 2481 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:47,338 INFO L93 Difference]: Finished difference Result 1201 states and 3360 transitions. [2021-11-07 02:15:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:15:47,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-07 02:15:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:47,342 INFO L225 Difference]: With dead ends: 1201 [2021-11-07 02:15:47,342 INFO L226 Difference]: Without dead ends: 561 [2021-11-07 02:15:47,342 INFO L786 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 [2021-11-07 02:15:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-11-07 02:15:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2021-11-07 02:15:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 2.648214285714286) internal successors, (1483), 560 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1483 transitions. [2021-11-07 02:15:47,364 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1483 transitions. Word has length 19 [2021-11-07 02:15:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:47,365 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 1483 transitions. [2021-11-07 02:15:47,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1483 transitions. [2021-11-07 02:15:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:15:47,367 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:47,368 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:47,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 02:15:47,368 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1720530527, now seen corresponding path program 1 times [2021-11-07 02:15:47,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:47,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932685443] [2021-11-07 02:15:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:47,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:47,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:47,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932685443] [2021-11-07 02:15:47,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932685443] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:47,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:47,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:15:47,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865232255] [2021-11-07 02:15:47,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:15:47,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:47,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:15:47,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:15:47,494 INFO L87 Difference]: Start difference. First operand 561 states and 1483 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:47,561 INFO L93 Difference]: Finished difference Result 479 states and 1218 transitions. [2021-11-07 02:15:47,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:15:47,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-07 02:15:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:47,564 INFO L225 Difference]: With dead ends: 479 [2021-11-07 02:15:47,564 INFO L226 Difference]: Without dead ends: 403 [2021-11-07 02:15:47,565 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:15:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-07 02:15:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 387. [2021-11-07 02:15:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 2.55699481865285) internal successors, (987), 386 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 987 transitions. [2021-11-07 02:15:47,581 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 987 transitions. Word has length 19 [2021-11-07 02:15:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:47,582 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 987 transitions. [2021-11-07 02:15:47,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 987 transitions. [2021-11-07 02:15:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:15:47,584 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:47,584 INFO L513 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] [2021-11-07 02:15:47,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 02:15:47,585 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:47,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1510881533, now seen corresponding path program 1 times [2021-11-07 02:15:47,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:47,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001308340] [2021-11-07 02:15:47,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:47,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:47,721 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:47,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001308340] [2021-11-07 02:15:47,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001308340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:47,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:47,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:15:47,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677823310] [2021-11-07 02:15:47,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 02:15:47,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:47,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 02:15:47,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:15:47,725 INFO L87 Difference]: Start difference. First operand 387 states and 987 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:47,786 INFO L93 Difference]: Finished difference Result 365 states and 942 transitions. [2021-11-07 02:15:47,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 02:15:47,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 02:15:47,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:47,788 INFO L225 Difference]: With dead ends: 365 [2021-11-07 02:15:47,788 INFO L226 Difference]: Without dead ends: 223 [2021-11-07 02:15:47,788 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:15:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-11-07 02:15:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2021-11-07 02:15:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.4902912621359223) internal successors, (513), 206 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 513 transitions. [2021-11-07 02:15:47,801 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 513 transitions. Word has length 22 [2021-11-07 02:15:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:47,802 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 513 transitions. [2021-11-07 02:15:47,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 513 transitions. [2021-11-07 02:15:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:15:47,803 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:47,804 INFO L513 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] [2021-11-07 02:15:47,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 02:15:47,804 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1718323758, now seen corresponding path program 1 times [2021-11-07 02:15:47,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:47,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768351602] [2021-11-07 02:15:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:47,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:47,873 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:47,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768351602] [2021-11-07 02:15:47,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768351602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:47,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:47,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:15:47,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984416498] [2021-11-07 02:15:47,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:15:47,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:47,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:15:47,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:15:47,875 INFO L87 Difference]: Start difference. First operand 207 states and 513 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:47,886 INFO L93 Difference]: Finished difference Result 275 states and 676 transitions. [2021-11-07 02:15:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:15:47,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 02:15:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:47,888 INFO L225 Difference]: With dead ends: 275 [2021-11-07 02:15:47,888 INFO L226 Difference]: Without dead ends: 91 [2021-11-07 02:15:47,888 INFO L786 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 [2021-11-07 02:15:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-07 02:15:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-11-07 02:15:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.188888888888889) internal successors, (197), 90 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 197 transitions. [2021-11-07 02:15:47,892 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 197 transitions. Word has length 25 [2021-11-07 02:15:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:47,892 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 197 transitions. [2021-11-07 02:15:47,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 197 transitions. [2021-11-07 02:15:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:15:47,893 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:47,894 INFO L513 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] [2021-11-07 02:15:47,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 02:15:47,894 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:47,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash 583869732, now seen corresponding path program 2 times [2021-11-07 02:15:47,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:47,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149414077] [2021-11-07 02:15:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:47,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:15:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:15:48,077 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:15:48,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149414077] [2021-11-07 02:15:48,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149414077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:15:48,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:15:48,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:15:48,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315211299] [2021-11-07 02:15:48,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 02:15:48,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:15:48,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 02:15:48,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:15:48,080 INFO L87 Difference]: Start difference. First operand 91 states and 197 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:15:48,139 INFO L93 Difference]: Finished difference Result 117 states and 251 transitions. [2021-11-07 02:15:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:15:48,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 02:15:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:15:48,141 INFO L225 Difference]: With dead ends: 117 [2021-11-07 02:15:48,141 INFO L226 Difference]: Without dead ends: 63 [2021-11-07 02:15:48,141 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:15:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-07 02:15:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-11-07 02:15:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 62 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2021-11-07 02:15:48,143 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 25 [2021-11-07 02:15:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:15:48,144 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2021-11-07 02:15:48,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:15:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2021-11-07 02:15:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:15:48,144 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:15:48,144 INFO L513 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] [2021-11-07 02:15:48,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 02:15:48,145 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-07 02:15:48,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:15:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash -995369118, now seen corresponding path program 3 times [2021-11-07 02:15:48,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:15:48,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612872320] [2021-11-07 02:15:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:15:48,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:15:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:15:48,191 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 02:15:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:15:48,270 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 02:15:48,270 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 02:15:48,271 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:15:48,272 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:15:48,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-07 02:15:48,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-07 02:15:48,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-11-07 02:15:48,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-11-07 02:15:48,274 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:15:48,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 02:15:48,276 INFO L731 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:15:48,280 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-07 02:15:48,280 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:15:48,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:15:48 BasicIcfg [2021-11-07 02:15:48,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:15:48,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:15:48,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:15:48,378 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:15:48,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:15:21" (3/4) ... [2021-11-07 02:15:48,380 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 02:15:48,471 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 02:15:48,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:15:48,473 INFO L168 Benchmark]: Toolchain (without parser) took 30415.91 ms. Allocated memory was 86.0 MB in the beginning and 224.4 MB in the end (delta: 138.4 MB). Free memory was 48.1 MB in the beginning and 129.4 MB in the end (delta: -81.2 MB). Peak memory consumption was 55.7 MB. Max. memory is 16.1 GB. [2021-11-07 02:15:48,473 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 86.0 MB. Free memory was 66.0 MB in the beginning and 65.9 MB in the end (delta: 38.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:15:48,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 961.77 ms. Allocated memory was 86.0 MB in the beginning and 123.7 MB in the end (delta: 37.7 MB). Free memory was 48.0 MB in the beginning and 84.6 MB in the end (delta: -36.6 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:15:48,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.17 ms. Allocated memory is still 123.7 MB. Free memory was 84.6 MB in the beginning and 81.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 02:15:48,474 INFO L168 Benchmark]: Boogie Preprocessor took 101.28 ms. Allocated memory is still 123.7 MB. Free memory was 81.7 MB in the beginning and 79.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:15:48,475 INFO L168 Benchmark]: RCFGBuilder took 2299.65 ms. Allocated memory is still 123.7 MB. Free memory was 79.2 MB in the beginning and 83.4 MB in the end (delta: -4.2 MB). Peak memory consumption was 43.3 MB. Max. memory is 16.1 GB. [2021-11-07 02:15:48,475 INFO L168 Benchmark]: TraceAbstraction took 26855.04 ms. Allocated memory was 123.7 MB in the beginning and 224.4 MB in the end (delta: 100.7 MB). Free memory was 82.9 MB in the beginning and 146.2 MB in the end (delta: -63.3 MB). Peak memory consumption was 122.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:15:48,480 INFO L168 Benchmark]: Witness Printer took 94.29 ms. Allocated memory is still 224.4 MB. Free memory was 146.2 MB in the beginning and 129.4 MB in the end (delta: 16.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 02:15:48,482 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 86.0 MB. Free memory was 66.0 MB in the beginning and 65.9 MB in the end (delta: 38.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 961.77 ms. Allocated memory was 86.0 MB in the beginning and 123.7 MB in the end (delta: 37.7 MB). Free memory was 48.0 MB in the beginning and 84.6 MB in the end (delta: -36.6 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 96.17 ms. Allocated memory is still 123.7 MB. Free memory was 84.6 MB in the beginning and 81.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 101.28 ms. Allocated memory is still 123.7 MB. Free memory was 81.7 MB in the beginning and 79.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2299.65 ms. Allocated memory is still 123.7 MB. Free memory was 79.2 MB in the beginning and 83.4 MB in the end (delta: -4.2 MB). Peak memory consumption was 43.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26855.04 ms. Allocated memory was 123.7 MB in the beginning and 224.4 MB in the end (delta: 100.7 MB). Free memory was 82.9 MB in the beginning and 146.2 MB in the end (delta: -63.3 MB). Peak memory consumption was 122.1 MB. Max. memory is 16.1 GB. * Witness Printer took 94.29 ms. Allocated memory is still 224.4 MB. Free memory was 146.2 MB in the beginning and 129.4 MB in the end (delta: 16.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.3s, 135 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 31 TransitionsAfterwards, 2682 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 6268 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3416, positive: 3248, positive conditional: 0, positive unconditional: 3248, negative: 168, negative conditional: 0, negative unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1859, positive: 1798, positive conditional: 0, positive unconditional: 1798, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1859, positive: 1778, positive conditional: 0, positive unconditional: 1778, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 922, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 755, negative conditional: 0, negative unconditional: 755, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3416, positive: 1450, positive conditional: 0, positive unconditional: 1450, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 1859, unknown conditional: 0, unknown unconditional: 1859] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L776] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 26.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 535 SDtfs, 631 SDslu, 752 SDs, 0 SdLazy, 334 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2282occurred in iteration=0, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 844 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 1914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 02:15:48,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693cc656-9768-4756-b2b4-cfd8239531ea/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE